Performance Analysis of Fast Root-Music Algorithms
碩士 === 國立臺灣海洋大學 === 電機工程學系 === 92 === Abstract Root-MUSIC is a polynomial rooting algorithm for high resolution direction estimation。 Compared to MUSIC，it is computationally more efficient since the directions of arrivals (DOA) can be directly read off from the arguments of the signal-related zeros...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/86421854401315136537 |
| Summary: | 碩士 === 國立臺灣海洋大學 === 電機工程學系 === 92 === Abstract
Root-MUSIC is a polynomial rooting algorithm for high resolution direction estimation。 Compared to MUSIC，it is computationally more efficient since the directions of arrivals (DOA) can be directly read off from the arguments of the signal-related zeros of a polynomial to replace extensive peak search in spatial spectrum。 Moreover it outperforms MUSIC even at lower signal-to-noise ratios。However Root-MUSIC is limited to a uniform linear array。
In the thesis，two approaches for reducing the computation complexity of Root-MUSIC are considered，One approach is to use fast separation of subspace in lies of eigendecomposition。 The other approach is to reduce the order of a polynomial。 Therefore，we try to find a scheme faster than variants of Root-MUSIC currently proposed in the literature，and have its estimation performance validated by computer simulations。
Keyword: Direction estimation， Array signal processing，Polynomial rooting。
|
|---|