Sensor array

A sensor array is a group of sensors, usually deployed in a certain geometry pattern, used for collecting and processing electromagnetic or acoustic signals.

Uses your system voice; voice and rate in settings.

≈ 9 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

A sensor array is a group of sensors, usually deployed in a certain geometry pattern, used for collecting and processing electromagnetic or acoustic signals. The advantage of using a sensor array over using a single sensor lies in the fact that an array adds new dimensions to the observation, helping to estimate more parameters and improve the estimation performance.

For example an array of radio antenna elements used for beamforming can increase antenna gain in the direction of the signal while decreasing the gain in other directions, i.e., increasing signal-to-noise ratio (SNR) by amplifying the signal coherently. Another example of sensor array application is to estimate the direction of arrival of impinging electromagnetic waves.

The related processing method is called array signal processing. A third examples includes chemical sensor arrays, which utilize multiple chemical sensors for fingerprint detection in complex mixtures or sensing environments.

Application examples of array signal processing include radar/sonar, wireless communications, seismology, machine condition monitoring, astronomical observations fault diagnosis, etc. Using array signal processing, the temporal and spatial properties (or parameters) of the impinging signals interfered by noise and hidden in the data collected by the sensor array can be estimated and revealed. This is known as parameter estimation. \Delta t_i = \frac{(i-1)d \cos \theta}{c}, i = 1, 2, ..., M \ \ (1) Each sensor is associated with a different delay.

The delays are small but not trivial. In frequency domain, they are displayed as phase shift among the signals received by the sensors. The delays are closely related to the incident angle and the geometry of the sensor array.

Given the geometry of the array, the delays or phase differences can be used to estimate the incident angle. Eq. (1) is the mathematical basis behind array signal processing.

Simply summing the signals received by the sensors and calculating the mean value give the result y = \frac{1}{M}\sum_{i=1}^{M} \boldsymbol x_i (t-\Delta t_i) \ \ (2) . Because the received signals are out of phase, this mean value does not give an enhanced signal compared with the original source.

Heuristically, if we can find delays of each of the received signals and remove them prior to the summation, the mean value y = \frac{1}{M}\sum_{i=1}^{M} \boldsymbol x_i (t) \ \ (3) will result in an enhanced signal. The process of time-shifting signals using a well selected set of delays for each channel of the sensor array so that the signal is added constructively is called beamforming.

In addition to the delay-and-sum approach described above, a number of spectral based (non-parametric) approaches and parametric approaches exist which improve various performance metrics. These beamforming algorithms are briefly described as follows . Delay and sum beamforming is a time domain approach.

It is simple to implement, but it may poorly estimate direction of arrival (DOA). The solution to this is a frequency domain approach. The Fourier transform transforms the signal from the time domain to the frequency domain.

This converts the time delay between adjacent sensors into a phase shift. Thus, the array output vector at any time t can be denoted as \boldsymbol x(t) = x_1(t)\begin{bmatrix} 1 & e^{-j\omega\Delta t} & \cdots & e^{-j\omega(M-1)\Delta t} \end{bmatrix}^T , where x_1(t) stands for the signal received by the first sensor.

Frequency domain beamforming algorithms use the spatial covariance matrix, represented by \boldsymbol R=E\{ \boldsymbol x(t) \boldsymbol x^T(t)\} . This M by M matrix carries the spatial and spectral information of the incoming signals.

Assuming zero-mean Gaussian white noise, the basic model of the spatial covariance matrix is given by \boldsymbol R = \boldsymbol V \boldsymbol S \boldsymbol V^H + \sigma^2 \boldsymbol I \ \ (4) where \sigma^2 is the variance of the white noise, \boldsymbol I is the identity matrix and \boldsymbol V is the array manifold vector \boldsymbol V = \begin{bmatrix} \boldsymbol v_1 & \cdots & \boldsymbol v_k \end{bmatrix}^T with \boldsymbol v_i = \begin{bmatrix} 1 & e^{-j\omega\Delta t_i} & \cdots & e^{-j\omega(M-1)\Delta t_i} \end{bmatrix}^T . This model is of central importance in frequency domain beamforming algorithms. Some spectrum-based beamforming approaches are listed below. \hat{P}_{Bartlett}(\theta)=\boldsymbol v^H \boldsymbol R \boldsymbol v \ \ (5) .

The angle that maximizes this power is an estimation of the angle of arrival. \hat{P}_{Capon}(\theta)=\frac{1}{\boldsymbol v^H \boldsymbol R^{-1} \boldsymbol v} \ \ (6) . Though the MVDR/Capon beamformer can achieve better resolution than the conventional (Bartlett) approach, this algorithm has higher complexity due to the full-rank matrix inversion.

Technical advances in GPU computing have begun to narrow this gap and make real-time Capon beamforming possible. \boldsymbol R = \boldsymbol U_s \boldsymbol \Lambda_s \boldsymbol U_s^H + \boldsymbol U_n \boldsymbol \Lambda_n \boldsymbol U_n^H \ \ (7) . MUSIC uses the noise sub-space of the spatial covariance matrix in the denominator of the Capon algorithm \hat{P}_{MUSIC}(\theta)=\frac{1}{\boldsymbol v^H \boldsymbol U_n \boldsymbol U_n^H\boldsymbol v} \ \ (8) .

Therefore MUSIC beamformer is also known as subspace beamformer. Compared to the Capon beamformer, it gives much better DOA estimation. L_{ML}(\theta)=\|\hat{\boldsymbol R}- \boldsymbol R\|_F^2 = \|\hat{\boldsymbol R}-( \boldsymbol V \boldsymbol S \boldsymbol V^H + \sigma^2 \boldsymbol I )\|_F^2 \ \ (9) , where \| \cdot \|_F is the Frobenius norm.

It can be seen in Eq. (4) that the penalty function of Eq. (9) is minimized by approximating the signal model to the sample covariance matrix as accurate as possible.

In other words, the maximum likelihood beamformer is to find the DOA \theta , the independent variable of matrix \boldsymbol V , so that the penalty function in Eq. (9) is minimized. In practice, the penalty function may look different, depending on the signal and noise model.

For this reason, there are two major categories of maximum likelihood beamformers: Deterministic ML beamformers and stochastic ML beamformers, corresponding to a deterministic and a stochastic model, respectively. Another idea to change the former penalty equation is the consideration of simplifying the minimization by differentiation of the penalty function.

In order to simplify the optimization algorithm, logarithmic operations and the probability density function (PDF) of the observations may be used in some ML beamformers. The optimizing problem is solved by finding the roots of the derivative of the penalty function after equating it with zero.

Because the equation is non-linear a numerical searching approach such as Newton–Raphson method is usually employed. The Newton–Raphson method is an iterative root search method with the iteration x_{n+1} = x_n - \frac{f(x_n)}{f'(x_n)} \ \ (10) . The search starts from an initial guess x_0 .

If the Newton-Raphson search method is employed to minimize the beamforming penalty function, the resulting beamformer is called Newton ML beamformer. Several well-known ML beamformers are described below without providing further details due to the complexity of the expressions.

Deterministic maximum likelihood beamformer In deterministic maximum likelihood beamformer (DML), the noise is modeled as a stationary Gaussian white random processes while the signal waveform as deterministic (but arbitrary) and unknown. Stochastic maximum likelihood beamformer In stochastic maximum likelihood beamformer (SML), the noise is modeled as stationary Gaussian white random processes (the same as in DML) whereas the signal waveform as Gaussian random processes.

Method of direction estimation Method of direction estimation (MODE) is subspace maximum likelihood beamformer, just as MUSIC, is the subspace spectral based beamformer. Subspace ML beamforming is obtained by eigen-decomposition of the sample covariance matrix.

Further reading

H. Krim and M. Viberg, “Two decades of array signal processing research”, IEEE Transactions on Signal Processing Magazine, July 1996 S. Haykin, Ed., “Array Signal Processing”, Eaglewood Cliffs, NJ: Prentice-Hall, 1985 S. U. Pillai, “Array Signal Processing”, New York: Springer-Verlag, 1989 P. Stoica and R. Moses, “Introduction to Spectral Analysis", Prentice-Hall, Englewood Cliffs, USA, 1997. available for download. J. Li and P. Stoica, “Robust Adaptive Beamforming", John Wiley, 2006.

J. Cadzow, “Multiple Source Location—The Signal Subspace Approach”, IEEE Transactions on Acoustics, Speech, and Signal Processing, Vol. 38, No. 7, July 1990 G. Bienvenu and L. Kopp, “Optimality of high resolution array processing using the eigensystem approach”, IEEE Transactions on Acoustics, Speech and Signal Process, Vol. ASSP-31, pp. 1234–1248, October 1983 I. Ziskind and M. Wax, “Maximum likelihood localization of multiple sources by alternating projection”, IEEE Transactions on Acoustics, Speech and Signal Process, Vol. ASSP-36, pp. 1553–1560, October 1988 B. Ottersten, M. Verberg,

P. Stoica, and A. Nehorai, “Exact and large sample maximum likelihood techniques for parameter estimation and detection in array processing”, Radar Array Processing, Springer-Verlag, Berlin, pp. 99–151, 1993 M. Viberg, B. Ottersten, and T. Kailath, “Detection and estimation in sensor arrays using weighted subspace fitting”, IEEE Transactions on Signal Processing, vol. SP-39, pp 2346–2449, November 1991 Y. Bresler and Macovski, “Exact maximum likelihood parameter estimation of superimposed exponential signals in noise”, IEEE Transactions on Acoustic,

Speech and Signal Proceeding, vol ASSP-34, pp. 1081–1089, October 1986 R. O. Schmidt, “New mathematical tools in direction finding and spectral analysis”, Proceedings of SPIE 27th Annual Symposium, San Diego, California, August 1983

Text derived from https://en.wikipedia.org/w/index.php?oldid=1372090903 under CC BY-SA 4.0; modifications have been made.

Provenance

snapshot enwiki-001372090903 · captured 2026-08-30 · ledger · version history

Cite this page as: encyclopegia.org, “Sensor array”, snapshot enwiki-001372090903. https://encyclopegia.org/a/sensor-array

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.