- •Contents
- •Preface
- •1.1 Smart Antenna Architecture
- •1.2 Overview of This Book
- •1.3 Notations
- •2.1 Single Transmit Antenna
- •2.1.1 Directivity and Gain
- •2.1.2 Radiation Pattern
- •2.1.3 Equivalent Resonant Circuits and Bandwidth
- •2.2 Single Receive Antenna
- •2.3 Antenna Array
- •2.4 Conclusion
- •Reference
- •3.1 Introduction
- •3.2 Data Model
- •3.2.1 Uniform Linear Array (ULA)
- •3.3 Centro-Symmetric Sensor Arrays
- •3.3.1 Uniform Linear Array
- •3.3.2 Uniform Rectangular Array (URA)
- •3.3.3 Covariance Matrices
- •3.4 Beamforming Techniques
- •3.4.1 Conventional Beamformer
- •3.4.2 Capon’s Beamformer
- •3.4.3 Linear Prediction
- •3.5 Maximum Likelihood Techniques
- •3.6 Subspace-Based Techniques
- •3.6.1 Concept of Subspaces
- •3.6.2 MUSIC
- •3.6.3 Minimum Norm
- •3.6.4 ESPRIT
- •3.7 Conclusion
- •References
- •4.1 Introduction
- •4.2 Preprocessing Schemes
- •4.2.2 Spatial Smoothing
- •4.3 Model Order Estimators
- •4.3.1 Classical Technique
- •4.3.2 Minimum Descriptive Length Criterion
- •4.3.3 Akaike Information Theoretic Criterion
- •4.4 Conclusion
- •References
- •5.1 Introduction
- •5.2 Basic Principle
- •5.2.1 Signal and Data Model
- •5.2.2 Signal Subspace Estimation
- •5.2.3 Estimation of the Subspace Rotating Operator
- •5.3 Standard ESPRIT
- •5.3.1 Signal Subspace Estimation
- •5.3.2 Solution of Invariance Equation
- •5.3.3 Spatial Frequency and DOA Estimation
- •5.4 Real-Valued Transformation
- •5.5 Unitary ESPRIT in Element Space
- •5.6 Beamspace Transformation
- •5.6.1 DFT Beamspace Invariance Structure
- •5.6.2 DFT Beamspace in a Reduced Dimension
- •5.7 Unitary ESPRIT in DFT Beamspace
- •5.8 Conclusion
- •References
- •6.1 Introduction
- •6.2 Performance Analysis
- •6.2.1 Standard ESPRIT
- •6.3 Comparative Analysis
- •6.4 Discussions
- •6.5 Conclusion
- •References
- •7.1 Summary
- •7.2 Advanced Topics on DOA Estimations
- •References
- •Appendix
- •A.1 Kronecker Product
- •A.2 Special Vectors and Matrix Notations
- •A.3 FLOPS
- •List of Abbreviations
- •About the Authors
- •Index
Overview of Basic DOA Estimation Algorithms |
45 |
|
|
elevation and azimuthal angles of an incoming signal generated by a source. The DOA process is then to extract these two frequencies from the data model.
In the previous two sections we discussed the expressions for data vector x using the array steering matrices of some commonly used antenna arrays. In the next section, we discuss the covariance matrix of these data vectors, an important quantity that is used in DOA algorithms.
3.3.3Covariance Matrices
The signals received by an array are noise-corrupted in the real world. These noises are normally uncorrelated while the pure signals received by different elements are correlated as they are originated from the same sources. By using this property, one may be able to extract effectively the DOA information. To do so, the concept of cross-covariance information among the noise-corrupted signals, spatial covariance matrix, is introduced and employed in finding DOAs. The spatial covariance matrix of the data (i.e., signals plus noises) received by an array is defined as
|
xx |
{ |
} |
|
R |
|
= E x(t )x H (t ) |
(3.35) |
where E{ } denotes the statistical expectation.
Equation (3.35) quantifies the degree of correlation of the data signals received by array elements. The higher values of its elements, the higher degree of correlations among the signals.
By substituting (3.10) into (3.35), we have
R |
xx |
= E x(t )x H (t ) |
= AR |
ss |
A H + σ 2 |
I |
M |
(3.36) |
|
|
{ |
} |
|
N |
|
|
where Rss = E{s(t)sH(t)} is the signal covariance matrix and σ 2N is the com-
mon variance of the noises.
In practice, the exact covariance matrix of Rxx is difficult to find due to the limited number of data sets received and processed by an array. Therefore, an estimation is made. By assuming that all underlying random noise processes are ergodic, the ensemble average (or statistical expectation) can be replaced by a time average. Let X be denoted as the noise corrupted signal (or data) matrix composed of N snapshots of x(tn), 1 ≤ n ≤ N,