An overview of beamforming from a signal-processing perspective is provided, with an emphasis on recent research. Data-independent, statistically optimum, adaptive, and partially adaptive beamforming are discussed. Basic notation, terminology, and concepts are included. Several beamformer implementations are briefly described. >

Beamforming: a versatile approach to spatial filtering

Random matrix theory has found many applications in physics, statistics and engineering since its inception. Although early developments were motivated by practical experimental problems, random matrices are now used in fields as diverse as Riemann hypothesis, stochastic differential equations, condensed matter physics, statistical physics, chaotic systems, numerical linear algebra, neural networks, multivariate statistics, information theory, signal processing and small-world networks. This article provides a tutorial on random matrices which provides an overview of the theory and brings together in one source the most significant results recently obtained. Furthermore, the application of random matrix theory to the fundamental limits of wireless communication channels is described in depth.

/pdf/random-matrix-theory-and-wireless-communications-lhkk3xrf4v.pdf

Random Matrix Theory and Wireless Communications

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

An adaptive algorithm for radar target detection using an antenna array is proposed. The detector is derived in a manner similar to that of the generalized likelihood-ratio test (GLRT) but contains a simplified test statistic that is a limiting case of the GLRT detector. This simplified detector is analyzed for performance to signals on boresight, as well as when the signal direction is misaligned with the look direction. >

A CFAR adaptive matched filter detector

A general problem of signal detection in a background of unknown Gaussian noise is addressed, using the techniques of statistical hypothesis testing. Signal presence is sought in one data vector, and another independent set of signal-free data vectors is available which share the unknown covariance matrix of the noise in the former vector. A likelihood ratio decision rule is derived and its performance evaluated in both the noise-only and signal-plus-noise cases.

An Adaptive Detection Algorithm

In many applications, the practical usefulness of adaptive arrays is limited by their convergence rate. The adaptively controlled weights in these systems must change at a rate equal to or greater than the rate of change of the external noise field (e.g., due to scanning in a radar if step scan is not used). This convergence rate problem is most severe in adaptive systems with a large number of degrees of adaptivity and in situations where the eigenvalues of the noise covariance matrix are widely different. A direct method of adaptive weight computation, based on a sample covariance matrix of the noise field, has been found to provide very rapid convergence in all cases, i.e., independent of the eigenvalue distribution. A theory has been developed, based on earlier work by Goodman, which predicts the achievable convergence rate with this technique, and has been verified by simulation.

Rapid Convergence Rate in Adaptive Arrays

The Wiener filter is analyzed for stationary complex Gaussian signals from an information theoretic point of view. A dual-port analysis of the Wiener filter leads to a decomposition based on orthogonal projections and results in a new multistage method for implementing the Wiener filter using a nested chain of scalar Wiener filters. This new representation of the Wiener filter provides the capability to perform an information-theoretic analysis of previous, basis-dependent, reduced-rank Wiener filters. This analysis demonstrates that the cross-spectral metric is optimal in the sense that it maximizes mutual information between the observed and desired processes. A new reduced-rank Wiener filter is developed based on this new structure which evolves a basis using successive projections of the desired signal onto orthogonal, lower dimensional subspaces. The performance is evaluated using a comparative computer analysis model and it is demonstrated that the low-complexity multistage reduced-rank Wiener filter is capable of outperforming the more complex eigendecomposition-based methods.

/pdf/a-multistage-representation-of-the-wiener-filter-based-on-38egqe5yyp.pdf

A multistage representation of the Wiener filter based on orthogonal projections

A novel rank reduction scheme is introduced for adaptive filtering problems. This rank reduction method uses a cross-spectral metric to select the optimal lower dimensional subspace for reduced-rank adaptive filtering as a function of the basis vectors of the full-rank space.

Reduced-rank adaptive filtering

The ability of an AMTI (airborn moving target indication) radar to reject clutter is often seriously degraded by the motion of the radar. An adaptive receiving array can compensate for platform motion and provide excellent AMTI performance. Scattering from aircraft structure can also distort antenna patterns and reduce AMTI capability. The technique described here can adapt the element weights to compensate for near-field scatterers and element excitation errors. Another important advantage is the ability to null out discrete active interference sources without significantly degrading AMTI performance.

Adaptive arrays in airborne MTI radar

This paper is concerned with issues and techniques associated with the development of both optimal and adaptive (data dependent) reduced-rank signal processing architectures. Adaptive algorithms for 1D beamforming, 2D space-time adaptive processing (STAP), and 3D STAP for joint hot and cold clutter mitigation are surveyed. The following concepts are then introduced for the first time (other than workshop and conference records) and evaluated in a signal-dependent versus signal independent context: (1) the adaptive processing "region-of-convergence" as a function of sample support and rank, (2) a new variant of the cross-spectral metric (CSM) that retains dominant mode estimation in the direct-form processor (DFP) structure, and (3) the robustness of the proposed methods to the subspace "leakage" problem arising in many real-world applications. A comprehensive performance comparison is conducted both analytically and via Monte Carlo simulation which clearly demonstrates the superior theoretical compression performance of signal-dependent rank-reduction, its broader region-of-convergence, and its inherent robustness to subspace leakage.

I.S. Reed

Papers

Rapid Convergence Rate in Adaptive Arrays

A multistage representation of the Wiener filter based on orthogonal projections

Reduced-rank adaptive filtering

Adaptive arrays in airborne MTI radar

Optimal and adaptive reduced-rank STAP