The quintessential goal of sensor array signal processing is the estimation of parameters by fusing temporal and spatial information, captured via sampling a wavefield with a set of judiciously placed antenna sensors. The wavefield is assumed to be generated by a finite number of emitters, and contains information about signal parameters characterizing the emitters. A review of the area of array processing is given. The focus is on parameter estimation methods, and many relevant problems are only briefly mentioned. We emphasize the relatively more recent subspace-based methods in relation to beamforming. The article consists of background material and of the basic problem formulation. Then we introduce spectral-based algorithmic solutions to the signal parameter estimation problem. We contrast these suboptimal solutions to parametric methods. Techniques derived from maximum likelihood principles as well as geometric arguments are covered. Later, a number of more specialized research topics are briefly reviewed. Then, we look at a number of real-world problems for which sensor array processing methods have been applied. We also include an example with real experimental data involving closely spaced emitters and highly correlated signals, as well as a manufacturing application example.

Two decades of array signal processing research: the parametric approach

1. Basic Concepts. 2. Nonparametric Methods. 3. Parametric Methods for Rational Spectra. 4. Parametric Methods for Line Spectra. 5. Filter Bank Methods. 6. Spatial Methods. Appendix A: Linear Algebra and Matrix Analysis Tools. Appendix B: Cramer-Rao Bound Tools. Appendix C: Model Order Selection Tools. Appendix D: Answers to Selected Exercises. Bibliography. References Grouped by Subject. Subject Index.

/pdf/spectral-analysis-of-signals-4dbupf9m4n.pdf

Spectral analysis of signals

We present a source localization method based on a sparse representation of sensor measurements with an overcomplete basis composed of samples from the array manifold. We enforce sparsity by imposing penalties based on the /spl lscr//sub 1/-norm. A number of recent theoretical results on sparsifying properties of /spl lscr//sub 1/ penalties justify this choice. Explicitly enforcing the sparsity of the representation is motivated by a desire to obtain a sharp estimate of the spatial spectrum that exhibits super-resolution. We propose to use the singular value decomposition (SVD) of the data matrix to summarize multiple time or frequency samples. Our formulation leads to an optimization problem, which we solve efficiently in a second-order cone (SOC) programming framework by an interior point implementation. We propose a grid refinement method to mitigate the effects of limiting estimates to a grid of spatial locations and introduce an automatic selection criterion for the regularization parameter involved in our approach. We demonstrate the effectiveness of the method on simulated data by plots of spatial spectra and by comparing the estimator variance to the Crame/spl acute/r-Rao bound (CRB). We observe that our approach has a number of advantages over other source localization techniques, including increased resolution, improved robustness to noise, limitations in data quantity, and correlation of the sources, as well as not requiring an accurate initialization.

/pdf/a-sparse-signal-reconstruction-perspective-for-source-52kw5wqztd.pdf

A sparse signal reconstruction perspective for source localization with sensor arrays

Array processing involves manipulation of signals induced on various antenna elements. Its capabilities of steering nulls to reduce cochannel interferences and pointing independent beams toward various mobiles, as well as its ability to provide estimates of directions of radiating sources, make it attractive to a mobile communications system designer. Array processing is expected to play an important role in fulfilling the increased demands of various mobile communications services. Part I of this paper showed how an array could be utilized in different configurations to improve the performance of mobile communications systems, with references to various studies where feasibility of apt array system for mobile communications is considered. This paper provides a comprehensive and detailed treatment of different beam-forming schemes, adaptive algorithms to adjust the required weighting on antennas, direction-of-arrival estimation methods-including their performance comparison-and effects of errors on the performance of an array system, as well as schemes to alleviate them. This paper brings together almost all aspects of array signal processing.

/pdf/application-of-antenna-arrays-to-mobile-communications-ii-52fds1c81j.pdf

Application of antenna arrays to mobile communications. II. Beam-forming and direction-of-arrival considerations

This paper addresses a problem arising in a context of digital communications. A digital source is transmitted through a continuous channel (the propagation medium), and several measurements are performed at the receiver, either by means of several sensors, or by oversampling the received signal compared to the emission rate. Given only these observations, the baseband equivalents of the corresponding channels have to be recovered. An orthogonality property between "signal" and "noise" subspaces is exploited to build some quadratic form whose minimization yields the desired estimates up to a scale factor. This is in the same spirit as recent works by Tong et al. (see Proc. 25th Asilomar Conf., p.856-860, 1991) but requires fewer computations. Numerical simulations demonstrate the performance of the proposed methods in a channel identification context. >

Subspace methods for the blind identification of multichannel FIR filters

The performance of the MUSIC and ML methods is studied, and their statistical efficiency is analyzed. The Cramer-Rao bound (CRB) for the estimation problems is derived, and some useful properties of the CRB covariance matrix are established. The relationship between the MUSIC and ML estimators is investigated as well. A numerical study is reported of the statistical efficiency of the MUSIC estimator for the problem of finding the directions of two plane waves using a uniform linear array. An exact description of the results is included. >

Nehorai Arye

Papers

MUSIC, maximum likelihood, and Cramer-Rao bound