Pregled bibliografske jedinice broj: 244530
A Modified Root Polynomial Algorithm
A Modified Root Polynomial Algorithm // Proceedings of the 18th IEEE International Conference on Applied Electromagnetics and Communications
Dubrovnik, 2005. str. 71-73 (predavanje, međunarodna recenzija, cjeloviti rad (in extenso), znanstveni)
CROSBI ID: 244530 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
A Modified Root Polynomial Algorithm
Autori
Wasylkiwskyj, Wasyl ; Kopriva, Ivica
Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni
Izvornik
Proceedings of the 18th IEEE International Conference on Applied Electromagnetics and Communications
/ - Dubrovnik, 2005, 71-73
Skup
18th IEEE International Conference on Applied Electromagnetics and Communications
Mjesto i datum
Dubrovnik, Hrvatska, 12.10.2005. - 14.10.2005
Vrsta sudjelovanja
Predavanje
Vrsta recenzije
Međunarodna recenzija
Ključne riječi
Direction finding; Polynomial rootinh algorithms;
Sažetak
Polynomial rooting direction finding (DF) algorithms are a computationally efficienta alternative to search based DF algorithms for uniform linear arrays (ULA) with equal element radiation patterns. However, in the second order (SO) statistics based Root MUSIC (RM) algorithm the number of roots that has to be calculated equals 2N-2 where N represents number of array elements. The Directions Of Arrivals (DOA) are estimated from the L pairs of roots closest to the unit circle where L represents number of sources. When number of array elements is large this leads to large computational load and can introduce significant numerical errors in the estimated DOA. In this paper we derive the SO statistics based Modified Root Polynomial (MRP) algorithm requiring the determination of only L roots.
Izvorni jezik
Engleski
Znanstvena područja
Elektrotehnika
POVEZANOST RADA
Ustanove:
Fakultet elektrotehnike i računarstva, Zagreb
Profili:
Ivica Kopriva
(autor)