Search

Anyone who has served as a technical program committee (TPC) chair for a conference (or program manager for a funding agency) understands that paper (or proposal panel) review assignment is a demanding job that takes a lot of time, and reviewers are rarely satisfied with the end results. This article presents signal processing tools for two critical ?mass assignment? tasks: assigning papers (or proposals) to reviewers in a way that matches reviewing expertise to scientific content while respecting the reviewers? capacity constraints and splitting accepted papers (or submitted proposals) to sessions (panels) while adhering to session (panel) capacity constraints. The basic idea is to use feature vectors to represent papers and reviewers. Features can be key words or phrases (e.g., optimization or sensor networks) or other types of attributes (e.g., timeliness). This viewpoint enables optimal assignment problem formulations that make sense from a scientific and practical point of view. While optimal solutions are hard to compute for a large number of papers and reviewers, high-quality approximate solutions of moderate complexity are developed here using familiar signal processing and optimization tools. These algorithmic solutions easily outperform days of expert manual work as demonstrated in experiments with real conference data. [ABSTRACT FROM PUBLISHER]

To realize a quantitative diagnosis of faults in the planetary gearboxes of wind turbines by processing the complex frequency signals of the planetary gear boxes and avoiding the aliasing problem of the resulting frequencies, this paper proposes a diagnosis method based on improved variational mode decomposition (IVMD) and average multi-scale double symbolic dynamic entropy (AMDSDE). Moreover, an IVMD algorithm based on multi-scale permutation entropy is introduced to reduce noise interference and realize signal demodulation. Considering the effects of complex transfer paths and the correlation between current and adjacent state modes, AMDSDE is proposed. Each fault size is obtained based on the entropy curve, and the AMDSDE of unknown faults is calculated. To verify the accuracy of the proposed method, simulations and experimental signals are processed. The quantitative diagnosis of the planetary gearboxes of wind turbines is realized, providing a reliable basis for evaluating the health status of planetary gearboxes. [ABSTRACT FROM AUTHOR]

The scientific world is becoming more open to the public and fellow researchers. Open access publishing is becoming accepted, even if some publishers are resisting. The next step is the open code and data paradigm, which was briefly discussed in the "From the Editor" column in the November 2018 issue of IEEE Signal Processing Magazine (SPM) [1]. In this column, I follow up on this topic by sharing my experiences, best practices, and thoughts about reproducible research. [ABSTRACT FROM AUTHOR]

The fifth generation New Radio vehicle-to-everything (5G NR-V2X) has higher requirements for delay and reliability, which brings challenges to the physical layer signal processing. Mobile edge computing (MEC) can provide larger capacity data storage and more efficient computation through localization of on-board unit (OBU) and next generation Node B (gNB) services. This paper combines the channel estimation of New Radio vehicle-to-infrastructure (NR-V2I) communication baseband signal processing with MEC and designs an intelligent channel estimation framework. In the MEC server, this paper proposes a channel estimation algorithm based on deep learning. This algorithm uses a one-dimensional convolutional neural network (1D CNN) to complete frequency-domain interpolation and conditional recurrent unit (CRU) for time-domain state prediction. Additional velocity coding vector and multipath coding vector track changes in the environment, and accurately train channel data in different mobile environments. System simulation and analysis show that the proposed algorithm improves the channel estimation accuracy, reduces the bit error rate, and enhances the robustness compared with the representative channel estimation algorithms for NR-V2I. [ABSTRACT FROM AUTHOR]

In this paper, two different timing-mismatch compensation strategies for two-channel time-interleaved analog-to-digital converters are comprehensively analyzed and compared. In the first strategy (SA), one channel serves as a reference channel, and the other channel is compensated to match the reference channel using the timing mismatch between the channels. In the second strategy (SB), both channels are compensated to match each other, using half the value of the channel mismatch with different signs. For SB, the paper introduces a novel compensation structure that utilizes parallel differentiator-multiplier (PDM) branches. Expressions for the spurious-free dynamic range (SFDR) after compensation are derived for both strategies. These expressions reveal that the novel PDM structure achieves a remarkably greater SFDR than the existing cascaded differentiator-multiplier (CDM) compensation structure which can be used for both SA and SB. This is because, after compensation, the remaining aliasing distortion in the proposed PDM structure is shown to be of higher approximation order (in terms of the mismatch value) and thus substantially smaller than in the CDM structure. Simulations included in the paper validate the theoretical results. [ABSTRACT FROM AUTHOR]

This paper proposes a deep learning framework to design distributed compression strategies in which distributed agents need to compress high-dimensional observations of a source, then send the compressed bits via bandwidth limited links to a fusion center for source reconstruction. Further, we require the compression strategy to be progressive so that it can adapt to the varying link bandwidths between the agents and the fusion center. Moreover, to ensure scalability, we investigate strategies that depend only on the local channel state information (CSI) at each agent. Toward this end, we use a data-driven approach in which the progressive linear combination and uniform quantization strategy at each agent are trained as a function of its local CSI. To deal with the challenges of modeling the quantization operations (which always produce zero gradients in the training of neural networks), we propose a novel approach of exploiting the statistics of the batch training data to set the dynamic ranges of the uniform quantizers. Numerically, we show that the proposed distributed estimation strategy designed with only local CSI can significantly reduce the signaling overhead and can achieve a lower mean-squared error distortion for source reconstruction than state-of-the-art designs that require global CSI at comparable overall communication cost. [ABSTRACT FROM AUTHOR]

In this paper, we present a novel localization scheme, location-aware ranging correction (LARC), to correct ranging estimates from ultra wideband (UWB) signals. Existing solutions to calculate ranging corrections rely solely on channel information features (e.g., signal energy, maximum amplitude, estimated range). We propose to incorporate a preliminary location estimate into a localization chain, such that location-based features can be calculated as inputs to a range-error prediction model. This way, we can add information to range-only measurements without relying on additional hardware such as an inertial measurement unit (IMU). This improves performance and reduces overfitting behavior. We demonstrate our LARC method using an open-access measurement dataset with distances up to 20 m, using a simple regression model that can run purely on the CPU in real-time. The inclusion of the proposed features for range-error mitigation decreases the ranging error 90th percentile (P90) by 58% to 15 cm (compared to the uncorrected range error), for an unseen trajectory. The 2D localization P90 error is improved by 21% to 18 cm. We show the robustness of our approach by comparing results to a changed environment, where metallic objects have been moved around the room. In this modified environment, we obtain a 56% better P90 ranging performance of 16 cm. The 2D localization P90 error improves as much as for the unchanged environment, by 17% to 18 cm, showing the robustness of our method. This method evolved from the first-ranking solution of the 2021 and 2022 International Conference on Indoor Position and Indoor Navigation (IPIN) Competition. [ABSTRACT FROM AUTHOR]

It is known that there exist mathematical problems of practical relevance which cannot be computed on a Turing machine. An important example is the calculation of the first derivative of continuously differentiable functions. This paper precisely classifies the non-computability of the first derivative, and of the maximum-norm of the first derivative in the Zheng-Weihrauch hierarchy. Based on this classification, the paper investigates whether it is possible that a Turing machine detects this non-computability of the first derivative by observing the data of the problem, and whether it is possible to detect upper bounds for the peak value of the first derivative of continuously differentiable functions. So from a practical point of view, the question is whether it is possible to implement an exit-flag functionality for observing non-computability of the first derivative. This paper even studies two different types of exit-flag functionality. A strong one, where the Turing machine always has to stop, and a weak one, where the Turing machine stops if and only if the input lies within the corresponding set of interest. It will be shown that non-computability of the first derivative is not detectable by a Turing machine for two concrete examples, namely for the problem of computing the input–output behavior of simple analog circuits and for solutions of the three-dimensional wave equation. In addition, it is shown that it is even impossible to detect an upper bound for the maximum norm of the first derivative. In particular, it is shown that all three problems are not even semidecidable. Finally, we briefly discuss implications of these results for analog and quantum computing. [ABSTRACT FROM AUTHOR]

In near coast navigation, buoys and beacons convey essential information about dangers. At night-time, selected buoys send out individual blink-sequences that are marked in sea charts. International regulations require that navigation officer on watch makes visual confirmation of objects and their type in order to navigate safely. With rapid developments of highly automated vessels, this duty needs be carried out by algorithms that detect and locate objects without human intervention. At night-time, this requires algorithms that decode blink sequences and are able to classify from this information. The paper investigates this problem and suggests an algorithm that solves the problem. Convolutional Neural Networks (CNN) with Gated Recurrent Units (GRU) are developed for classification. A dedicated architecture is suggested that includes both temporal and color decoding to obtain unique precision. We demonstrate how networks are trained on synthetically generated data, and the paper shows, on real-world data, how the suggested approach yields 100.0% accurate results on 44 real-world recordings while being robust to inaccuracy in actual blink sequences. Comparison with baseline signal processing and with a recent state-of-the-art 3D CNN model shows that the new blink-sequence classifier outperforms alternative algorithms. A showcase of the results of this work is available in this video: https://youtu.be/KEi8qNnKV2w. [ABSTRACT FROM AUTHOR]

Real-world phenomena that can be formulated as signals are often affected by a number of factors and appear as multi-component modes. To understand and process such phenomena, “divide-and-conquer” is probably the most common strategy to address the problem. In other words, the captured signal is decomposed into signal components for each individual component to be processed. Unfortunately, for signals that are superimposition of non-stationary amplitude-frequency modulated (AM-FM) components, the “divide-and-conquer” strategy is bound to fail, since there is no way to be sure that the decomposed components take on the AM-FM formulations which are necessary for the extraction of their instantaneous frequencies (IFs) and amplitudes (IAs). In this paper, we propose an adaptive signal separation operation (ASSO) for effective and accurate separation of a single-channel blind-source multi-component signal, via introducing a time-varying parameter that adapts locally to IFs and using linear chirp (linear frequency modulation) signals to approximate components at each time instant. We derive more accurate component recovery formulae based on the linear chirp signal local approximation. In addition, a recovery scheme, together with a ridge detection method, is also proposed to extract the signal components one by one, and the time-varying parameter is updated for each component. The proposed method is suitable for engineering implementation, being capable of separating complicated signals into their components or sub-signals and reconstructing the signal trend directly. Numerical experiments on synthetic and real-world signals are presented to demonstrate our improvement over the previous attempts. [ABSTRACT FROM AUTHOR]

As an algorithmic framework, message passing is extremely powerful and has wide applications in the context of different disciplines including communications, coding theory, statistics, signal processing, artificial intelligence and combinatorial optimization. In this paper, we investigate the performance of a message-passing algorithm called min-sum belief propagation (BP) for the vertex-disjoint shortest $k$ -path problem ($k$ -VDSP) on weighted directed graphs, and derive the iterative message-passing update rules. As the main result of this paper, we prove that for a weighted directed graph $G$ of order $n$ , BP algorithm converges to the unique optimal solution of $k$ -VDSP on $G$ within $O(n^{2}w_{max})$ iterations, provided that the weight $w_{e}$ is nonnegative integral for each arc $e\in E(G)$ , where $w_{max}=\max \{w_{e}: e\in E(G)\}$. To the best of our knowledge, this is the first instance where BP algorithm is proved correct for NP-hard problems. Additionally, we establish the extensions of $k$ -VDSP to the case of multiple sources or sinks. [ABSTRACT FROM AUTHOR]

The papers in this special issue are intended to address some of the main research challenges in Graph Signal Processing by presenting a collection of the latest advances in the domain. These papers examine key representation, learning and processing aspects for signals living on graphs and networks, as well as new methods and applications in graph signal processing. Numerous applications rely on the processing of high dimensional data that reside on irregular or otherwise unordered structures that are naturally modeled as networks. The need for new tools to process such data has led to the emergence of the field of graph signal processing, which merges algebraic and spectral graph theoretic concepts with computational harmonic analysis to process signals on structures such as graphs. This important new paradigm in signal processing research, coupled with its numerous applications in very different domains, has fueled the rapid development of an inter-disciplinary research community that has been working on theoretical aspects of graph signal processing and applications to diverse problems such as big data analysis, coding and compression of 3D point clouds, biological data processing, and brain network analysis. [ABSTRACT FROM PUBLISHER]

This paper aims at proposing a novel 2D non-linear phase decomposition of images, which performs the image processing tasks better than the traditional Fourier transformation (linear phase decomposition), but further, it has additional mathematical properties allowing more effective image analysis, including adaptive decomposition components and positive instantaneous phase derivatives. 1D unwinding Blaschke decomposition has recently been proposed and studied. Through factorization it expresses arbitrary 1D signal into an infinite linear combination of Blaschke products. It offers fast converging positive frequency decomposition in the form of rational approximation. However, in the multi-dimensional cases, the usual factorization mechanism does not work. As a consequence, there is no genuine unwinding decomposition for multi-dimensions. In this paper, a 2D partial unwinding decomposition based on algebraic transforms reducing multi-dimensions to the 1D case is proposed and analyzed. The result shows that the fast convergence offers efficient image reconstruction. The tensor type decomposing terms are mutually orthogonal, giving rise to 2D positive frequency decomposition. The comparison results show that the proposed method outperforms the standard greedy algorithm and the most commonly used methods in the Fourier category. An application in watermarking is presented to demonstrate its potential in applications. [ABSTRACT FROM AUTHOR]

This paper deals with stabilization of an ideal transformer model (ITM) circuit, used as an interfacing algorithm for hardware-in-the-loop simulations. The ITM allows for the distribution of simulation model computations over multiple processors or can be used in power hardware-in-the-loop simulations. When specific impedance conditions of the partitioned circuit are not met, this interfacing algorithm becomes unstable. This paper first presents a new theoretical approach for representing the ITM interfacing algorithm that is based on delay differential equations. With a stability analysis of the obtained time-delay system, a stabilization method is proposed, which increases the stability boundaries of the ITM algorithm. Simulation examples, including the scenario of a two-level inverter system, are provided. [ABSTRACT FROM AUTHOR]

This paper studies the robust matrix completion (RMC) problem with the objective to recover a low-rank matrix from partial observations that may contain significant errors. If all the observations in one column are erroneous, existing RMC methods can locate the corrupted column at best but cannot recover the actual data in that column. Low-rank Hankel matrices characterize the additional correlations among columns besides the low-rankness and exist in power system monitoring, magnetic resonance imaging (MRI) imaging, and array signal processing. Exploiting the low-rank Hankel property, this paper develops an alternating-projection-based fast algorithm to solve the nonconvex RMC problem. The algorithm converges to the ground-truth low-rank matrix with a linear rate even when all the measurements in a constant fraction of columns are corrupted. The required number of observations is significantly less than the existing bounds for the conventional RMC. Numerical results are reported to evaluate the proposed algorithm. [ABSTRACT FROM AUTHOR]

This paper investigates the dynamic access point (AP) clustering and precoding problem in the downlink of user-centric virtual cell networks. The goal is to maximize the weighted sum spectral efficiency (SE) while satisfying the power constraints and AP clustering constraints in adjacent time slots (TSs). By adopting the random walk mobility to model the mobile user equipments’ movement behaviors, we consider dynamic and time-varying channel conditions. Therefore, the weighted sum SE maximization programming takes the form of discrete-time sequence of mixed-integer non-convex optimization problems. In this paper, we propose to solve this sequential problem in two stages. In the first stage, a dynamic AP clustering approach based on discrete particle swarm optimization is developed. This approach takes the advantage of the channel correlation by exploiting the relationship between AP clustering solutions in adjacent TSs to improve the SE performance and reduce complexity. In the second stage, given the AP clustering solution obtained in the first stage, a distributed precoding algorithm is devised via applying the weighted minimum mean square error method. By combining these two stages, we propose a novel dynamic AP clustering and precoding algorithm (DAPC-Pre). The effectiveness of the proposed DAPC-Pre algorithm is verified by the simulation results. In particular, the proposed algorithm converges fast and significantly outperforms benchmark algorithms in terms of sum SE under different dynamic environments. [ABSTRACT FROM AUTHOR]

Total variation (TV) is a one of the most popular regularizers for stabilizing the solution of ill-posed inverse problems. This paper proposes a novel proximal-gradient algorithm for minimizing TV regularized least-squares cost functionals. Unlike traditional methods that require nested iterations for computing the proximal step of TV, our algorithm approximates the latter with several simple proximals that have closed form solutions. We theoretically prove that the proposed parallel proximal method achieves the TV solution with arbitrarily high precision at a global rate of converge that is equivalent to the fast proximal-gradient methods. The results in this paper have the potential to enhance the applicability of TV for solving very large-scale imaging inverse problems. [ABSTRACT FROM AUTHOR]

Condition monitoring and diagnosis have become an essential part of power transformer asset management. A variety of online and offline measurements have been performed in utilities for evaluating different aspects of transformers’ conditions. However, properly processing measurement data and explicitly correlating these data to transformer condition is not a trivial task. This paper proposes an intelligent framework for condition monitoring and assessment of power transformer. Within this framework, various signal processing and pattern recognition techniques are applied for automatically denoising sensor acquired signals, extracting representative characteristics from raw data, and identifying types of faults in transformers. This paper provides case studies to demonstrate the effectiveness of the proposed framework and techniques for power transformer asset management. The hardware and software platform for implementing the proposed intelligent framework will also be presented in this paper. [ABSTRACT FROM PUBLISHER]

Being able to detect, identify, and diagnose a fault is a key feature of industrial supervision systems, which enables advance asset management, in particular, predictive maintenance, which greatly increases efficiency and productivity. In this paper, an Industrial Internet app for real-time fault detection and diagnosis is implemented and tested in a pilot scale industrial motor. Real-time fault detection and identification is based on dynamic incremental principal component analysis (DIPCA) and reconstruction-based contribution (RBC). When the analysis indicates that one of the vibration measurements is responsible for the fault, a convolutional neural network (CNN) is used to identify the unbalance or bearing fault type. The application was evaluated in its three functionalities: fault detection, fault identification, and fault identification of vibration-related faults, yielding a fault detection rate over 99%, a false alarm rate below 5%, and an identification accuracy over 90%. Note to Practitioners—This paper focuses on designing and evaluating a real-time fault diagnosis application in an industrial setup. To this end, this paper also tackles the problem of developing a methodology for implementing advanced state-of-the-art fault detection techniques in real machinery, following industry standards and using a modern informatics architecture. The application here developed uses a statistical data-driven fault diagnosis technique, hence it requires a training stage using historical data to learn patterns and estimate parameters. A proof of concept in fault diagnosis for industrial motors is given; however, it should be noted that both the methodology and the deployed architecture are scalable and flexible enough to facilitate the implementation in other industrial environments. The implementation here presented was deployed using only open-source tools, which allows evaluating this tool without incurring in high expenses. [ABSTRACT FROM AUTHOR]

This paper proposes a novel algorithm to determine the optimal orientation of sensing axes of redundant inertial sensors such as accelerometers and gyroscopes (gyros) for increasing the sensing accuracy. In this paper, we have proposed a novel iterative algorithm to find the optimal sensor configuration. The proposed algorithm utilizes the majorization-minimization (MM) algorithm and the duality principle to find the optimal configuration. Unlike the state-of-the-art approaches which are mainly geometrical in nature and restricted to sensors’ noise being uncorrelated, the proposed algorithm gives the exact orientations of the sensors and can easily deal with the cases of correlated noise. The proposed algorithm has been implemented and tested via numerical simulation in the MATLAB. The simulation results show that the algorithm converges to the optimal configurations and shows the effectiveness of the proposed algorithm. [ABSTRACT FROM AUTHOR]

To ensure the reliability of rail transit, it is necessary to diagnose and monitor rail faults. Although the first-order sinusoidal signal model can be used for rail diagnosis, its accuracy is too low. This paper proposes a second-order sinusoidal model to solve this problem. First, the parameters of the second-order sinusoidal model are optimized to approximate the average signal via the least-squares batch learning. Next, with the rail vibration signal model based on the second-order sinusoidal signal model, information related to the rail average signals, which includes the amplitude modulations and the phase modulations, is extracted and analyzed, and the process of rail crack generation is determined. The second-order sinusoidal model extracts the rail characteristics of the amplitude modulation and the phase modulation, reflects the rail fault information and monitors the rail breaking process. Finally, with the experiment (Fig. 0: on the right) and actual rail data, rail fault diagnosis are demonstrated, which are beneficial for the safety of rail transit. [ABSTRACT FROM AUTHOR]

Embedding Artificial Intelligence (AI) in integrated circuits is one of the technology pillars of the so-called digital transformation. Nowadays, the vast majority of electronic devices benefits from digital signal processing to implement more and more functionalities, which can be further enhanced by the action of AI algorithms and artefacts. Moreover, as the analog/digital interfaces are moving closer and closer to the point where the information is either acquired or transmitted, the so-called AI-managed data converters are becoming key building blocks in an increasingly number of interconnected cyberphysical systems–made up of both software and hardware components. Software Defined Radio (SDR) and Cognitive Radio (CR) systems intended for 5G/6G communications are good examples which can benefit from an early digitization managed by AI engines. [ABSTRACT FROM AUTHOR]

This paper describes a complete solution of a new dropped wireless sensor network (called “abandoned” since it is never picked up) dedicated to intelligence operation. The sensor network, named SEXTANT for Smart sEnsor X for Tactical situation AssessmeNT and presented in this paper is the achievement of several years of research and development in the fields of data fusion and smart sensors at the French Aerospace Lab. The main contribution of this paper is the presentation of experimental results obtained with our Joint Tracking and Classification (JTC) algorithm. The originality of this algorithm relies on the use contextual information in the target tracking processing and data fusion for target classification processing. [ABSTRACT FROM AUTHOR]

Cell-free massive MIMO is one of the key technologies for future wireless communications, in which users are simultaneously and jointly served by all access points (APs). In this paper, we investigate the minimum mean square error (MMSE) estimation of effective channel coefficients in cell-free massive MIMO systems with massive connectivity. To facilitate the theoretical analysis, only single measurement vector (SMV) based MMSE estimation is considered in this paper, i.e., the MMSE estimation is performed based on the received pilot signals at each AP separately. Inspired by the decoupling principle of replica symmetric postulated MMSE estimation of sparse signal vectors with independent and identically distributed (i.i.d.) non-zero components, we develop the corresponding decoupling principle for the SMV based MMSE estimation of sparse signal vectors with independent and non-identically distributed (i.n.i.d.) non-zero components, which plays a key role in the theoretical analysis of SMV based MMSE estimation of the effective channel coefficients in cell-free massive MIMO systems with massive connectivity. Subsequently, based on the obtained decoupling principle of MMSE estimation, likelihood ratio test and the optimal fusion rule, we perform user activity detection based on the received pilot signals at only one AP, or cooperation among the entire set of APs for centralized or distributed detection. Via theoretical analysis, we show that the error probabilities of both centralized and distributed detection tend to zero when the number of APs tends to infinity while the asymptotic ratio between the number of users and pilots is kept constant. We also investigate the asymptotic behavior of oracle estimation in cell-free massive MIMO systems with massive connectivity via random matrix theory. Moreover, in order to demonstrate the potential performance loss of SMV based MMSE estimation, which does not employ the correlation between the received pilot signals at different APs, the multiple measurement vector (MMV) based MMSE estimation, i.e., joint MMSE estimation with pilot signals from all APs, is analyzed via numerical results. Numerical analysis shows that the theoretical analyze with our decoupling principle for the SMV based MMSE estimation of sparse signal vectors with i.n.i.d. non-zero components matches well with the numerical results. [ABSTRACT FROM AUTHOR]

A rectangular-window sidelobe magnitude reduction method by widening the main lobe width was proposed by Saramäki. A technique for trading off main lobe width against sidelobe magnitude for any arbitrary window was reported by Lim et al.; a fast convergence algorithm for its implementation was proposed by the same authors in another article, where the derivatives of the window function are expressed in Chebyshev polynomials which have high arithmetic complexity. All the coefficients of a rectangular-window are equal; this special property is exploited, in this paper, for deriving the window function’s derivatives without the use of Chebyshev polynomials resulting in a great reduction in the arithmetic complexity. [ABSTRACT FROM AUTHOR]

This paper proposes a momentum algorithm based on Borges difference and an adaptive momentum (Adam) algorithm based on Borges difference to update parameters, which can adjust the momentum information more flexibly. The Borges difference is proposed from the definition of Borges derivative to be combined with the gradient algorithm in convolutional neural networks. The proposed momentum algorithm based on Borges difference and Adam algorithm based on Borges difference can be adjusted more flexibly in order to speed up the convergence. The parameter optimization algorithm with the Borges difference presents a better performance compared with the integer-order momentum algorithm and integer-order Adam algorithm, with the proposed nonlinear adjustment method for the parameter tuning of convolutional neural networks. By analyzing experimental results of Fashion-MNIST dataset and CIFAR-10 dataset, the optimization algorithms based on Borges difference proposed in this paper gain better effects on the optimization model compared with the corresponding ones based on the integer-order difference, and can speed up the convergence speed and recognition accuracy of the image recognition. [ABSTRACT FROM AUTHOR]

Non-contact vital sign monitoring has been an important research topic recently due to the ability to monitor patients for an extended period especially during sleep without requiring uncomfortable attachments. Radar is a popular sensor for vital sign monitoring research. Various algorithms have been proposed for estimating respiration rate and heart rate from the radar data. But many algorithms rely on Fast Fourier Transform (FFT) to convert time domain signal to the frequency domain and estimate vital signs, despite FFT having limitation of frequency resolution being inverse of the time interval of data sample. However, there are other spectral estimation algorithms, which have not been much researched into the suitability of vital sign estimation using radar signals. In this paper, we compared eight different types of spectral estimation algorithms, including FFT, for respiration rate and heart rate estimation of stationary subjects in a controlled environment. The evaluation is based on extensive data consisting of different stationary subject positions. Considering the results, the eligibility of algorithms other than FFT for respiration rate and heart rate estimation is demonstrated. Using this work, researchers can get an overview on which algorithm is suitable for their work without the need to review individual algorithms separately. [ABSTRACT FROM AUTHOR]

This paper considers structure learning from data with $n$ samples of $p$ variables, assuming that the structure is a forest, using the Chow–Liu algorithm. Specifically, for incomplete data, we construct two model selection algorithms that complete in $O(p^{2})$ steps: one obtains a forest with the maximum posterior probability given the data and the other obtains a forest that converges to the true one as $n$ increases. We show that the two forests are generally different when some values are missing. In addition, we present estimations for benchmark data sets to demonstrate that both algorithms work in realistic situations. Moreover, we derive the conditional entropy provided that no value is missing, and we evaluate the per-sample expected redundancy for the universal coding of incomplete data in terms of the number of non-missing samples. [ABSTRACT FROM AUTHOR]

Approximate message passing (AMP) refers to a class of efficient algorithms for statistical estimation in high-dimensional problems such as compressed sensing and low-rank matrix estimation. This paper analyzes the performance of AMP in the regime where the problem dimension is large but finite. For concreteness, we consider the setting of high-dimensional regression, where the goal is to estimate a high-dimensional vector $\beta _{0}$ from a noisy measurement $y=A \beta _{0} + w$. AMP is a low-complexity, scalable algorithm for this problem. Under suitable assumptions on the measurement matrix $A$ , AMP has the attractive feature that its performance can be accurately characterized in the large system limit by a simple scalar iteration called state evolution. Previous proofs of the validity of state evolution have all been asymptotic convergence results. In this paper, we derive a concentration inequality for AMP with Gaussian matrices with independent and identically distributed (i.i.d.) entries and finite dimension $n \times N$. The result shows that the probability of deviation from the state evolution prediction falls exponentially in $n$. This provides theoretical support for empirical findings that have demonstrated excellent agreement of AMP performance with state evolution predictions for moderately large dimensions. The concentration inequality also indicates that the number of AMP iterations $t$ can grow no faster than order $({\log n}/{\log \log n})$ for the performance to be close to the state evolution predictions with high probability. The analysis can be extended to obtain similar non-asymptotic results for AMP in other settings such as low-rank matrix estimation. [ABSTRACT FROM AUTHOR]

The use of low-resolution digital-to-analog converters (DACs) for transmit precoding provides crucial energy efficiency advantage for massive multiple-input multiple-output (MIMO) implementation. This paper formulates a quadrature amplitude modulation (QAM) constellation range and a one-bit symbol-level precoding design problem for minimizing the average symbol error rate (SER) in downlink massive MIMO transmission. A tight upper bound for the SER with low-resolution DAC precoding is first derived. The derived expression suggests that the performance degradation of one-bit precoding can be interpreted as a decrease in the effective minimum distance of the QAM constellation. Using the obtained SER expression, we propose a QAM constellation range design for the single-user case. It is shown that in the massive MIMO limit, a reasonable choice for constellation range with one-bit precoding is that of the infinite-resolution precoding with per-symbol power constraint, but reduced by a factor of $\sqrt{2/\pi }$ or about 0.8. The corresponding minimum distance reduction translates to about a 2 dB gap between the performance of one-bit precoding and infinite-resolution precoding. This paper further proposes a low-complexity heuristic algorithm for the one-bit precoder design. Finally, the proposed QAM constellation range and precoder design are generalized to the multiuser downlink. We propose to scale the constellation range for the infinite-resolution zero-forcing (ZF) precoding with per-symbol power constraint by the same factor of $\sqrt{2/\pi }$ for one-bit precoding. The proposed one-bit precoding scheme is shown to be within 2 dB of infinite-resolution ZF. In term of number of antennas, one-bit precoding requires about 50% more antennas to achieve the same performance as infinite-resolution precoding. [ABSTRACT FROM AUTHOR]

Cochlear implant technology successfully restores hearing function to patients with sensory impairment. Although cochlear implant users generally hear well in quiet, they still find noisy conditions very challenging, hence the need to employ noise reduction algorithms in these systems to enhance the user experience. This paper reviews noise reduction algorithms in cochlear implants. Traditionally, such algorithms have been classified as either single- or multiple-channel, depending on the number of microphones they use. This review retains this general classification in looking at recent papers and extends it to reflect recent interest in machine learning techniques. The review concludes with consideration of promising future areas of research. [ABSTRACT FROM AUTHOR]

Distributed or decentralized estimation of covariance, and distributed principal component analysis have been introduced and studied in the signal processing community in recent years, and applications in array processing have been indicated in some detail. Inspired by these, this paper provides a detailed development of several distributed algorithms for array processing. New distributed algorithms are proposed for DOA estimation methods like root-MUSIC, total least squares-ESPRIT, and FOCUSS. Other contributions include distributed design of the Capon beamformer from data, and distributed implementation of the spatial smoothing method for coherent sources. A distributed implementation of a recently proposed beamspace method called the convolutional beamspace (CBS) is also proposed. The proposed algorithms are fully distributed – an average consensus (AC) is used to avoid the need for a fusion center. The algorithms are based on a recently reported finite-time version of AC which converges to the exact solution in a finite number of iterations. Numerical examples are given throughout the paper to show the effectiveness of the proposed algorithms. [ABSTRACT FROM AUTHOR]

The potential of using of millimeter wave (mmWave) frequency for future wireless cellular communication systems has motivated the study of large-scale antenna arrays for achieving highly directional beamforming. However, the conventional fully digital beamforming methods which require one radio frequency (RF) chain per antenna element is not viable for large-scale antenna arrays due to the high cost and high power consumption of RF chain components in high frequencies. To address the challenge of this hardware limitation, this paper considers a hybrid beamforming architecture in which the overall beamformer consists of a low-dimensional digital beamformer followed by an RF beamformer implemented using analog phase shifters. Our aim is to show that such an architecture can approach the performance of a fully digital scheme with much fewer number of RF chains. Specifically, this paper establishes that if the number of RF chains is twice the total number of data streams, the hybrid beamforming structure can realize any fully digital beamformer exactly, regardless of the number of antenna elements. For cases with fewer number of RF chains, this paper further considers the hybrid beamforming design problem for both the transmission scenario of a point-to-point multiple-input multiple-output (MIMO) system and a downlink multi-user multiple-input single-output (MU-MISO) system. For each scenario, we propose a heuristic hybrid beamforming design that achieves a performance close to the performance of the fully digital beamforming baseline. Finally, the proposed algorithms are modified for the more practical setting in which only finite resolution phase shifters are available. Numerical simulations show that the proposed schemes are effective even when phase shifters with very low resolution are used. [ABSTRACT FROM PUBLISHER]

This paper deals with Gibbs samplers that include high dimensional conditional Gaussian distributions. It proposes an efficient algorithm that avoids the high dimensional Gaussian sampling and relies on a random excursion along a small set of directions. The algorithm is proved to converge, i.e., the drawn samples are asymptotically distributed according to the target distribution. Our main motivation is in inverse problems related to general linear observation models and their solution in a hierarchical Bayesian framework implemented through sampling algorithms. It finds direct applications in semi-blind/unsupervised methods as well as in some non-Gaussian methods. The paper provides an illustration focused on the unsupervised estimation for super-resolution methods. [ABSTRACT FROM PUBLISHER]

The papers in this special section focus on the use of signal and information processing for critical infrastructures. Critical infrastructures such as the smart electric power grid, gas and water utility networks, transportation networks, and communication networks are crucially supporting quality of life and economic growth. Future critical infrastructures are envisioned to integrate sensory data acquisition, communication and computation technologies, and signal processing to offer improved services to their end-users. Such an integration promises to have profound effects in improving societal welfare by enabling more efficient, open, consumer-centric, environmentally-friendly and resilient modern critical infrastructures. Thus, the design mantra for the evolution of critical infrastructures can be described, in part, as knowledge is power. At the heart of many technological challenges underlying the vision of evolved critical infrastructures is the need for signal and information processing. [ABSTRACT FROM AUTHOR]

In this paper, we study the optimal waveform design for wireless power transfer (WPT) from a multi-antenna energy transmitter (ET) to multiple single-antenna energy receivers (ERs) simultaneously in multi-path frequency-selective channels. First, we propose a refined nonlinear current-voltage model of the diode in the ER rectifier, and accordingly derive new expressions for the output direct current (DC) voltage and corresponding harvested power at the ER. Leveraging this new rectenna model, we first consider the single-ER case and study the multisine-based power waveform design based on the wireless channel to maximize the harvested power at the ER. We propose two efficient algorithms for finding high-quality suboptimal solutions to this non-convex optimization problem. Next, we extend our formulated waveform design problem to the general multi-ER case for maximizing the weighted sum of the harvested powers by all ERs, and propose an efficient difference-of-convex-functions programming (DCP)-based algorithm for solving this problem. Finally, we demonstrate the superior performance of our proposed waveform designs based on the new rectenna model over existing schemes/models via simulations. [ABSTRACT FROM AUTHOR]

Magnetic random-access memory (MRAM) is a promising memory technology due to its high density, non-volatility, and high endurance. However, achieving high memory fidelity incurs high write-energy costs, which should be reduced for large-scale deployment of MRAMs. In this paper, we formulate a biconvex optimization problem to optimize write fidelity given energy and latency constraints. The basic idea is to allocate non-uniform write pulses depending on the importance of each bit position. The fidelity measure we consider is mean squared error (MSE), for which we optimize write pulses via alternating convex search (ACS). We derive analytic solutions and propose an alternating water-filling algorithm by casting the MRAM’s write operation as communication over parallel channels. Hence, the proposed alternating water-filling algorithm is computationally more efficient than the original ACS while their solutions are identical. Since the formulated biconvex problem is non-convex, both the original ACS and the proposed algorithm do not guarantee global optimality. However, the MSEs obtained by the proposed algorithm are comparable to the MSEs by complicated global nonlinear programming solvers. Furthermore, we prove that our algorithm can reduce the MSE exponentially with the number of bits per word. For an 8-bit accessed word, the proposed algorithm reduces the MSE by a factor of 21. We also evaluate MNIST dataset classification supposing that the model parameters of deep neural networks are stored in MRAMs. The numerical results show that the optimized write pulses can achieve 40% write-energy reduction for the same classification accuracy. [ABSTRACT FROM AUTHOR]

Over the decades, multiple approaches have been proposed to solve convex programs. The development of interior-point methods allowed solving a more general set of convex programs known as semi-definite and second-order cone programs. However, these methods are excessively slow for high dimensions. On the other hand, optimization algorithms on manifolds have shown great abilities in finding solutions to non-convex problems in a reasonable time. This paper suggests using a Riemannian optimization approach to solve a subset of convex optimization problems wherein the optimization variable is a doubly stochastic matrix. Optimization over the set of doubly stochastic matrices is crucial for multiple communications and signal processing applications, especially graph-based clustering. The paper introduces and investigates the geometries of three convex manifolds, namely the doubly stochastic, the symmetric, and the definite multinomial manifolds which generalize the simplex, also known as the multinomial manifold. Theoretical complexity analysis and numerical simulation results testify the efficiency of the proposed method over state-of-the-art algorithms. In particular, they reveal that the proposed framework outperforms conventional generic and specialized approaches, especially in high dimensions. [ABSTRACT FROM AUTHOR]

In this paper, we propose new methodologies to decrease the computational cost of safe screening tests for LASSO. We first introduce a new screening strategy, dubbed “joint screening test,” which allows the rejection of a set of atoms by performing one single test. Our approach enables to find good compromises between complexity of implementation and effectiveness of screening. Second, we propose two new methods to decrease the computational cost inherent to the construction of the (so-called) “safe region.” Our numerical experiments show that the proposed procedures lead to significant computational gains as compared to standard methodologies. [ABSTRACT FROM AUTHOR]

In this paper, we propose a hybrid genetic algorithm (GA) for the optimal shape design of an axially symmetric dual-reflector antenna by combining the GA with the moving least square (MLS), which enhances the convergence rate and the global search performance. The MLS is used to construct local interpolation functions from non-uniform sample data and to estimate new superior positions. By combining these superior positions in the next generation, the MLS-GA shows better search performance for the global optimum and a faster convergence rate than those of the conventional GA. To verify the proposed MLS-GA, we applied it to the optimal shape design of the DRA at the W-band. [ABSTRACT FROM AUTHOR]

In this paper, a point-to-point network transmission control problem is formulated as a Markov decision process (MDP). Classical dynamic programming techniques such as value iteration, policy iteration, and linear programming can be employed to solve the optimization problem, but they suffer from high-computational complexity in networks with large state space. To achieve complexity reduction, the structure of the optimal policy can be exploited and incorporated into standard algorithms. In addition, function approximation can also be applied, where the value function is approximated by the linear combination of some basis vectors in a lower dimensional subspace. The main challenge for function approximation lies in the absence of general guidelines for subspace construction. In this paper, a proper subspace for projection is first generated based on system information, and more general construction methods are proposed using tools from graph signal processing (GSP). Graph symmetrization methods are also used to tackle the directed nature of the probability transition graph so that the well-developed GSP theory for undirected graphs can be employed. The numerical results for a typical wireless system show that standard algorithms with structural information incorporated can achieve 50% complexity reduction without performance loss. The subspace generated from the system can achieve zero policy error with faster runtime, and the GSP approach can also provide a proper subspace for perfect reconstruction of the optimal policy. It is also shown that how the proposed method can be applied to other MDP problems. [ABSTRACT FROM AUTHOR]

This paper introduces a node-asynchronous communication protocol in which an agent in a network wakes up randomly and independently, collects states of its neighbors, updates its own state, and then broadcasts back to its neighbors. This protocol differs from consensus algorithms and it allows distributed computation of an arbitrary eigenvector of the network, in which communication between agents is allowed to be directed. (The graph operator is still required to be a normal matrix). To analyze the scheme, this paper studies a random asynchronous variant of the power iteration. Under this random asynchronous model, an initial signal is proven to converge to an eigenvector of eigenvalue 1 (a fixed point) even in the case of operator having spectral radius larger than unity. The rate of convergence is shown to depend not only on the eigenvalue gap but also on the eigenspace geometry of the operator as well as the amount of asynchronicity of the updates. In particular, the convergence region for the eigenvalues gets larger as the updates get less synchronous. Random asynchronous updates are also interpreted from the graph signal perspective, and it is shown that a non-smooth signal converges to the smoothest signal under the random model. When the eigenvalues are real, second order polynomials are used to achieve convergence to an arbitrary eigenvector of the operator. Using second order polynomials the paper formalizes the node-asynchronous communication model. As an application, the protocol is used to compute the Fiedler vector of a network to achieve autonomous clustering. [ABSTRACT FROM AUTHOR]

In this paper, we devise a communication-efficient decentralized algorithm, named as communication-censored alternating direction method of multipliers (ADMM) (COCA), to solve a convex consensus optimization problem defined over a network. Similar to popular decentralized consensus optimization algorithms such as ADMM, at every iteration of COCA, a node exchanges its local variable with neighbors, and then updates its local variable according to the received neighboring variables and its local cost function. A different feature of COCA is that a node is not allowed to transmit its local variable to neighbors, if this variable is not sufficiently different to the previously transmitted one. The sufficiency of the difference is evaluated by a properly designed censoring function. Though this censoring strategy may slow down the optimization process, it effectively reduces the communication cost. We prove that when the censoring function is properly chosen, COCA converges to an optimal solution of the convex consensus optimization problem. Furthermore, if the local cost functions are strongly convex, COCA has a fast linear convergence rate. Numerical experiments demonstrate that, given a target solution accuracy, COCA is able to significantly reduce the overall communication cost compared to existing algorithms including ADMM, and hence fits for applications where network communication is a bottleneck. [ABSTRACT FROM AUTHOR]

Timing skews among channels degrade seriously the time-interleaved analog-to-digital converter (TIADC) performance, which can be improved by the blind timing skew estimation (TSE) technique. In this paper, we proposed the all-phase fast Fourier transform (ApFFT) based on spectrum sparsity signal phase relationship blind TSE (ApFFT-SSPR-BLTSE) algorithm. The ApFFT-SSPR-BLTSE algorithm reduces computational complexity based on the phase relationship of the total output from TIADC and the corresponding reference channel output compared with the existing spectrum sparsity blind TSE (SS-BLTSE) algorithm. We also utilized the ApFFT technique to increase the accuracy of phase spectral estimation. Simulation results show that the proposed ApFFT-SSPR-BLTSE algorithm, which as a reduced number of fast Fourier transforms (FFTs) and low hardware complexity, has higher accuracy for blind TSE compared to the existing SS-BLTSE algorithm. In addition, this paper presents an efficient hardware architecture of the ApFFT-SSPR-BLTSE algorithm on the Xilinx Virtex-6 vlx550tff1759 field-programmable gate array (FPGA) chip for the blind TSE of the four-channel 400-MHz 14-bit TIADC real system. The validation results show that the proposed algorithm uses only a few percent of the hardware resources of the FPGA chip, and the mismatch spurs were suppressed to better than −81.54 dB. [ABSTRACT FROM AUTHOR]

This paper proposes a new framework for the design of transmit and receive beamformers for interference alignment (IA) without symbol extensions in multi-antenna cellular networks. We consider IA in a G cell network with K users/cell, N antennas at each base station (BS) and M antennas at each user. The proposed framework is developed by recasting the conditions for IA as two sets of rank constraints, one on the rank of interference matrices, and the other on the transmit beamformers in the uplink. The interference matrix consists of all the interfering vectors received at a BS from the out-of-cell users in the uplink. Using these conditions and the crucial observation that the rank of interference matrices under alignment can be determined beforehand, this paper develops two sets of algorithms for IA. The first part of this paper develops rank minimization algorithms for IA by iteratively minimizing a weighted matrix norm of the interference matrix. Different choices of matrix norms lead to reweighted nuclear norm minimization (RNNM) or reweighted Frobenius norm minimization (RFNM) algorithms with significantly different per-iteration complexities. Alternately, the second part of this paper devises an alternating minimization (AM) algorithm where the rank-deficient interference matrices are expressed as a product of two lower-dimensional matrices that are then alternately optimized. Simulation results indicate that RNNM, which has a per-iteration complexity of a semidefinite program, is effective in designing aligned beamformers for proper-feasible systems with or without redundant antennas, while RFNM and AM, which have a per-iteration complexity of a quadratic program, are better suited for systems with redundant antennas. [ABSTRACT FROM PUBLISHER]

The parameters estimation of cubic-phase signal based on local polynomial Wigner distribution (LPWD) was proposed in the author’s previous paper, and it outperforms the traditional algorithms in inverse synthetic aperture radar (ISAR) imaging of maneuvering target. The contribution of this paper is that the asymptotic statistical performance of LPWD for the parameters estimation of cubic-phase signal is analyzed theoretically, and the asymptotic statistical results are derived for all the estimated parameters via the first-order perturbation principle. Then, the LPWD is used in ISAR imaging of ship target with complex motion, and the high-quality instantaneous ISAR images can be obtained. [ABSTRACT FROM PUBLISHER]