Efficient calculation of sensor utility and sensor removal in wireless sensor networks for adaptive signal estimation and beamforming

Wireless sensor networks are often deployed over a large area of interest and therefore the quality of the sensor signals may vary significantly across the different sensors. In this case, it is useful to have a measure for the importance or the so-called "utility" of each sensor, e.g., for sensor subset selection, resource allocation or topology selection. In this paper, we consider the efficient calculation of sensor utility measures for four different signal estimation or beamforming algorithms in an adaptive context. We use the definition of sensor utility as the increase in cost (e.g., mean-squared error) when the sensor is removed from the estimation procedure. Since each possible sensor removal corresponds to a new estimation problem (involving less sensors), calculating the sensor utilities would require a continuous updating of different signal estimators (where is the number of sensors), increasing computational complexity and memory usage by a factor. However, we derive formulas to efficiently calculate all sensor utilities with hardly any increase in memory usage and computational complexity compared to the signal estimation algorithm already in place. When applied in adaptive signal estimation algorithms, this allows for on-line tracking of all the sensor utilities at almost no additional cost. Furthermore, we derive efficient formulas for sensor removal, i.e., for updating the signal estimator coefficients when a sensor is removed, e.g., due to a failure in the wireless link or when its utility is too low. We provide a complexity evaluation of the derived formulas, and demonstrate the significant reduction in computational complexity compared to straightforward implementations

Partial Relaxation Approach: An Eigenvalue-Based DOA Estimator Framework

In this paper, the partial relaxation approach is introduced and applied to DOA estimation using spectral search. Unlike existing methods like Capon or MUSIC which can be considered as single source approximations of multi-source estimation criteria, the proposed approach accounts for the existence of multiple sources. At each considered direction, the manifold structure of the remaining interfering signals impinging on the sensor array is relaxed, which results in closed form estimates for the interference parameters. The conventional multidimensional optimization problem reduces, thanks to this relaxation, to a simple spectral search. Following this principle, we propose estimators based on the Deterministic Maximum Likelihood, Weighted Subspace Fitting and covariance fitting methods. To calculate the pseudo-spectra efficiently, an iterative rooting scheme based on the rational function approximation is applied to the partial relaxation methods. Simulation results show that the performance of the proposed estimators is superior to the conventional methods especially in the case of low Signal-to-Noise-Ratio and low number of snapshots, irrespectively of any specific structure of the sensor array while maintaining a comparable computational cost as MUSIC.Comment: This work has been submitted to IEEE for possible publication. Copyright may be transferred without notice, after which this version may no longer be accessibl

Sparse Filter Design Under a Quadratic Constraint: Low-Complexity Algorithms

This paper considers three problems in sparse filter design, the first involving a weighted least-squares constraint on the frequency response, the second a constraint on mean squared error in estimation, and the third a constraint on signal-to-noise ratio in detection. The three problems are unified under a single framework based on sparsity maximization under a quadratic performance constraint. Efficient and exact solutions are developed for specific cases in which the matrix in the quadratic constraint is diagonal, block-diagonal, banded, or has low condition number. For the more difficult general case, a low-complexity algorithm based on backward greedy selection is described with emphasis on its efficient implementation. Examples in wireless channel equalization and minimum-variance distortionless-response beamforming show that the backward selection algorithm yields optimally sparse designs in many instances while also highlighting the benefits of sparse design.Texas Instruments Leadership University Consortium Progra

3-D Beamspace ML Based Bearing Estimator Incorporating Frequency Diversity and Interference Cancellation

The problem of low-angle radar tracking utilizing an array of antennas is considered. In the low-angle environment, echoes return from a low flying target via a specular path as well as a direct path. The problem is compounded by the fact that the two signals arrive within a beamwidth of each other and are usually fully correlated, or coherent. In addition, the SNR at each antenna element is typically low and only a small number of data samples, or snapshots, is available for processing due to the rapid movement of the target. Theoretical studies indicates that the Maximum Likelihood (ML) method is the only reliable estimation procedure in this type of scenario. However, the classical ML estimator involves a multi-dimensional search over a multi-modal surface and is consequently computationally burdensome. In order to facilitate real time processing, we here propose the idea of beamspace domain processing in which the element space snapshot vectors are first operated on by a reduced Butler matrix composed of three orthogonal beamforming weight vectors facilitating a simple, closed-form Beamspace Domain ML (BDML) estimator for the direct and specular path angles. The computational simplicity of the method arises from the fact that the respective beams associated with the three columns of the reduced Butler matrix have all but three nulls in common. The performance of the BDML estimator is enhanced by incorporating the estimation of the complex reflection coefficient and the bisector angle, respectively, for the symmetric and nonsymmetric multipath cases. To minimize the probability of track breaking, the use of frequency diversity is incorporated. The concept of coherent signal subspace processing is invoked as a means for retaining the computational simplicity of single frequency operation. With proper selection of the auxiliary frequencies, it is shown that perfect focusing may be achieved without iterating. In order to combat the effects of strong interfering sources, a novel scheme is presented for adaptively forming the three beams which retains the feature of common nulls

Efficient Beamspace Eigen-Based Direction of Arrival Estimation schemes

The Multiple SIgnal Classification (MUSIC) algorithm developed in the late 70\u27s was the first vector subspace approach used to accurately determine the arrival angles of signal wavefronts impinging upon an array of sensors. As facilitated by the geometry associated with the common uniform linear array of sensors, a root-based formulation was developed to replace the computationally intensive spectral search process and was found to offer an enhanced resolution capability in the presence of two closely-spaced signals. Operation in beamspace, where sectors of space are individually probed via a pre-processor operating on the sensor data, was found to offer both a performance benefit and a reduced computationa1 complexi ty resulting from the reduced data dimension associated with beamspace processing. Little progress, however, has been made in the development of a computationally efficient Root-MUSIC algorithm in a beamspace setting. Two approaches of efficiently arriving at a Root-MUSIC formulation in beamspace are developed and analyzed in this Thesis. In the first approach, a structura1 constraint is placed on the beamforming vectors that can be exploited to yield a reduced order polynomial whose roots provide information on the signal arrival angles. The second approach is considerably more general, and hence, applicable to any vector subspace angle estimation algorithm. In this approach, classical multirate digital signal processing is applied to effectively reduce the dimension of the vectors that span the signal subspace, leading to an efficient beamspace Root-MUSIC (or ESPRIT) algorithm. An auxiliaay, yet important, observation is shown to allow a real-valued eigenanalysis of the beamspace sample covariance matrix to provide a computational savings as well as a performance benefit, particularly in the case of correlated signal scenes. A rigorous theoretical analysis, based upon derived large-sample statistics of the signal subspace eigenvectors, is included to provide insight into the operation of the two algorithmic methodologies employing the real-valued processing enhancement. Numerous simulations are presented to validate the theoretical angle bias and variance expressions as well as to assess the merit of the two beamspace approaches

Sensor array signal processing : two decades later

Caption title.Includes bibliographical references (p. 55-65).Supported by Army Research Office. DAAL03-92-G-115 Supported by the Air Force Office of Scientific Research. F49620-92-J-2002 Supported by the National Science Foundation. MIP-9015281 Supported by the ONR. N00014-91-J-1967 Supported by the AFOSR. F49620-93-1-0102Hamid Krim, Mats Viberg

Array and multichannel signal processing using nonparametric statistics

In array signal processing a group of sensors located at distinct spatial locations is deployed to measure a propagating wavefield. The multichannel output is then processed to provide information about parameters of interest. Application areas include smart antennas in communications, radar, sonar and biomedicine. When deriving array signal processing algorithms the noise is typically modeled as a white Gaussian random process. A shortcoming of the estimation procedures derived under Gaussian assumption is that they are extremely sensitive to deviations from the assumed model, i.e. they are not robust. In real-world applications the assumption of white Gaussian noise is not always valid. Consequently, there has been a growing interest in estimation methods which work reliably in both Gaussian and non-Gaussian noise. In this thesis, new statistical procedures for array and multichannel signal processing are developed. In the area of array signal processing, the work concentrates on high-resolution subspace-based Direction Of Arrival (DOA) estimation and estimation of the number of source signals. Robust methods for DOA estimation and estimation of the number of source signals are derived. Spatial-smoothing based extensions of the techniques to deal with coherent signals are also derived. The methods developed are based on multivariate nonparametric statistics, in particular sign and rank covariance matrices. It is shown that these statistics may be used to obtain convergent estimates of the signal and noise subspaces for a large family of symmetric noise distributions. Simulations reveal that the techniques developed exhibit near-optimal performance when the noise distribution is Gaussian and are highly reliable if the noise is non-Gaussian. Multivariate nonparametric statistics are also applied to frequency estimation and estimation of the eigenvectors of the covariance matrix. Theoretical justification for the techniques is shown and their robust performance is illustrated in simulations.reviewe

A CLT on the SNR of Diagonally Loaded MVDR Filters

This paper studies the fluctuations of the signal-to-noise ratio (SNR) of minimum variance distorsionless response (MVDR) filters implementing diagonal loading in the estimation of the covariance matrix. Previous results in the signal processing literature are generalized and extended by considering both spatially as well as temporarily correlated samples. Specifically, a central limit theorem (CLT) is established for the fluctuations of the SNR of the diagonally loaded MVDR filter, under both supervised and unsupervised training settings in adaptive filtering applications. Our second-order analysis is based on the Nash-Poincar\'e inequality and the integration by parts formula for Gaussian functionals, as well as classical tools from statistical asymptotic theory. Numerical evaluations validating the accuracy of the CLT confirm the asymptotic Gaussianity of the fluctuations of the SNR of the MVDR filter.Comment: This is a corrected version of the paper that will appear at IEEE Transactions on Signal Processing September 201

Subspace Tracking and Least Squares Approaches to Channel Estimation in Millimeter Wave Multiuser MIMO

The problem of MIMO channel estimation at millimeter wave frequencies, both in a single-user and in a multi-user setting, is tackled in this paper. Using a subspace approach, we develop a protocol enabling the estimation of the right (resp. left) singular vectors at the transmitter (resp. receiver) side; then, we adapt the projection approximation subspace tracking with deflation and the orthogonal Oja algorithms to our framework and obtain two channel estimation algorithms. We also present an alternative algorithm based on the least squares approach. The hybrid analog/digital nature of the beamformer is also explicitly taken into account at the algorithm design stage. In order to limit the system complexity, a fixed analog beamformer is used at both sides of the communication links. The obtained numerical results, showing the accuracy in the estimation of the channel matrix dominant singular vectors, the system achievable spectral efficiency, and the system bit-error-rate, prove that the proposed algorithms are effective, and that they compare favorably, in terms of the performance-complexity trade-off, with respect to several competing alternatives.Comment: To appear on the IEEE Transactions on Communication