Parallel and adaptive high-resolution direction finding
| Autor: | Ed F. Deprettere, F Vanpoucke, Marc Moonen |
|---|---|
| Rok vydání: | 1994 |
| Předmět: |
Numerical linear algebra
Mathematical optimization Adaptive algorithm Computational complexity theory Direction finding Orthogonal transformation Estimation theory Parallel algorithm Array processing Systolic array computer.software_genre Matrix decomposition Schur decomposition Sensor array Singular value decomposition Signal Processing Electrical and Electronic Engineering Throughput (business) computer Algorithm Subspace topology Mathematics |
| Zdroj: | IEEE Transactions on Signal Processing. 42:2439-2448 |
| ISSN: | 1053-587X |
| DOI: | 10.1109/78.317865 |
| Popis: | The direction-of-arrival (D OA) estimation problem consists in determining the angles of arrival of a number of signals impinging on a sensor array. Recently, the so-called ESPRIT method of Roy and Paulraj 11 has received a great deal of attention in the literature. The method employs matrix decomposition techniques, such as Singular Value Decomposition (SVD) and Generalized Schur Decomposition (GSD).The computational complexity thus involved, represents a serious impediment, especially when a real-timeimplementation is aimed at.Therefore, the aim here is to develop an ESPRIT-type algorithm which is fully adaptive and amenableto parallel implementation. By introducing adaptivity, the computational complexity per sampling period is reduced from 0(m3) to 0(m2), where m is the 'problem size', i.e. the number of antenna doublets.On a parallel processor array with 0(m2) processors, the throughput is then 0(m°), which means thatthe number of measurements that are processed per time unit is independent of the problem size. Thealgorithm is based on an adaptive SVD updating algorithm 8 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|