- •Abstract
- •Keywords
- •Contents
- •Introduction
- •Background on Array Processing
- •2.1 INTRODUCTION
- •2.1.1 Propagation Delays in Uniform Linear Arrays
- •2.1.2 Narrowband Approximation
- •2.1.3 Matrix Equation for Array Data
- •2.1.4 Eigenstructure of the Spatial Covariance Matrix
- •2.2 ANTENNA BEAMFORMING BASICS
- •2.2.1 The Conventional Beamformer
- •2.2.2 The Minimum Variance Distortionless Response Beamformer
- •3.1 CLASSICAL METHODS FOR DIRECTION OF ARRIVAL ESTIMATION
- •3.1.1 Delay-and-Sum Method
- •3.1.2 Capon’s Minimum Variance Distortionless Response Method
- •3.2 SUBSPACE METHODS FOR DOA ESTIMATION
- •3.2.1 Multiple Signal Classification Algorithm
- •3.2.2 Orthogonal Vector Methods
- •3.2.3 The Root MUSIC Algorithm
- •3.2.4 The Minimum Norm Method
- •3.2.5 Estimation of Signal Parameters via Rotational Invariance Techniques
- •3.2.6 Linear Prediction
- •3.2.7 The Unitary ESPRIT for Linear Arrays
- •3.2.8 QR ESPRIT
- •3.2.9 Beamspace DOA Estimation
- •3.2.10 The DFT Beamspace ESPRIT
- •3.2.11 The Multiple Invariance ESPRIT
- •3.2.12 Unitary ESPRIT for Planar Arrays
- •3.2.13 Maximum Likelihood Methods
- •3.2.13.1 The Alternating Projection Algorithm for ML DOA Estimation
- •4.1 ADAPTIVE SIMULATION EXAMPLE
- •Appendix
- •Signal Generator
- •The MUSIC Algorithm
- •The ESPRIT Algorithm
- •MVDR Method and the Classical Beamformer
- •Code to Simulate the MUSIC, the ESPRIT, the MVDR, the Min-Norm, and the Classical DOA Algorithms
- •References
- •Additional References
- •List of Symbols
- •List of Acronyms
- •Author Biography
71
|
List of Symbols |
|
|
|
|
|
|
|
|
xn |
N × 1 data vector at time index n |
|
|
|
n |
Discrete time index |
|
|
|
N |
Dimension of data vector xn |
|
|
|
r |
Number of signals present in the linear data model of xn |
|
|
|
Rxx |
Autocorrelation matrix associated with xn |
|
|
|
Rxx(n) |
Estimate of Rxx at time n |
|
|
|
In × k |
The n × k identity matrix |
|
|
|
In |
The n × n identity matrix |
|
|
|
A |
N × r matrix whose columns are steering vectors of incoming signals |
|
|
|
σ 2 |
Variance of the white, Gaussian noise |
|
|
|
QDQH |
The eigendecomposition of Rxx, where QQH = I, and Q can be partitioned as [Qs Qn], |
|||
|
2 |
2 |
2 |
|
|
where Qs is N × r and Qn is N × (N − r). D = diag{σ 0, |
σ 1, …, σ N - 1}, where |
||
|
|
|
|
|
|
σ 02 ≥ σ 21 ≥ … ≥ σ 2r − 1 > σ 2r = σ 2r + 1 = … = σ 2N − 1 |
|
|
|
Qs(n) |
Qs(n) is the estimate of Qs at time index n |
|
|
|
X(n) |
n × N data matrix whose ith row is xHi |
|
|
|
USVH |
Singular value decomposition of the data matrix X(n), with S = diag{σ 0, σ 1, …, σ N - 1}. |
|||
|
The columns of U are the left singular vectors of X and the columns of V are the right |
|||
|
singular vectors. The matrix V can be partitioned as V = [Vs |
Vn] with Vs = Qs and |
||
|
Vn = Qn |
|
|
|
zn |
zn = Qs(n)xn, r × 1 compressed data vector |
|
|
|
λWavelength of bandpass signal
c |
Speed of light |
D |
Distance between elements of uniform linear array in meters |
d |
Distance between elements of a uniform linear array in wavelengths |
wn |
N × 1 vector of complex beamformer weights |
73
|
List of Acronyms |
|
|
|
|
DOA |
Direction of arrival |
|
ESPRIT |
Estimation of signal parameters via rotational invariance techniques |
|
EVD |
Eigenvalue decomposition |
|
MIL |
Matrix inversion lemma |
|
MUSIC |
Multiple signal classification |
|
SVD |
Singular value decomposition |
|
SW |
Sliding window |
|
ULA |
Uniform linear array |
|
URA |
Uniform rectangular array |
|
DFT |
Discrete Fourier transform |
|
|
|
|
