Parallel adaptive rooting algorithm for general frequency estimation and direction finding

Jyh Chern Ho, Jar-Ferr Yang, Mostafa Kaveh

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

An adaptive rooting algorithm, is proposed for tracking the nonstationary roots of null spectra for data from sensor arrays, or time series. Without the assumption of uniformity for linear arrays, this adaptive-rooting algorithm associated with the zero-extraction technique is further extended to construct a parallel-effective-rooting processor. The adaptive algorithm tracks all the principal roots and reduces the computational complexity from order N3 to order N2. Simulations show better resolution performance of the suggested algorithm than that of the usual of spectral-based high-resolution techniques such as minimum-norm or MUSIC, for both uniform and nonuniform cases. Simulations also reveal that its convergence speed competes with those of recent fast adaptive eigen-structure algorithms for tracking the nonstationary parameters.

Original languageEnglish
Pages (from-to)43-48
Number of pages6
JournalIEE Proceedings, Part F: Radar and Signal Processing
Volume139
Issue number1
DOIs
Publication statusPublished - 1992 Jan 1

Fingerprint

Frequency estimation
Adaptive algorithms
Parallel algorithms
Sensor arrays
Time series
Computational complexity

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

@article{3c05e7453e544a7da1b31048030aa884,
title = "Parallel adaptive rooting algorithm for general frequency estimation and direction finding",
abstract = "An adaptive rooting algorithm, is proposed for tracking the nonstationary roots of null spectra for data from sensor arrays, or time series. Without the assumption of uniformity for linear arrays, this adaptive-rooting algorithm associated with the zero-extraction technique is further extended to construct a parallel-effective-rooting processor. The adaptive algorithm tracks all the principal roots and reduces the computational complexity from order N3 to order N2. Simulations show better resolution performance of the suggested algorithm than that of the usual of spectral-based high-resolution techniques such as minimum-norm or MUSIC, for both uniform and nonuniform cases. Simulations also reveal that its convergence speed competes with those of recent fast adaptive eigen-structure algorithms for tracking the nonstationary parameters.",
author = "Ho, {Jyh Chern} and Jar-Ferr Yang and Mostafa Kaveh",
year = "1992",
month = "1",
day = "1",
doi = "10.1049/ip-f-2.1992.0004",
language = "English",
volume = "139",
pages = "43--48",
journal = "IEE Proceedings, Part F: Radar and Signal Processing",
issn = "0956-375X",
publisher = "Institute of Electrical Engineers",
number = "1",

}

Parallel adaptive rooting algorithm for general frequency estimation and direction finding. / Ho, Jyh Chern; Yang, Jar-Ferr; Kaveh, Mostafa.

In: IEE Proceedings, Part F: Radar and Signal Processing, Vol. 139, No. 1, 01.01.1992, p. 43-48.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Parallel adaptive rooting algorithm for general frequency estimation and direction finding

AU - Ho, Jyh Chern

AU - Yang, Jar-Ferr

AU - Kaveh, Mostafa

PY - 1992/1/1

Y1 - 1992/1/1

N2 - An adaptive rooting algorithm, is proposed for tracking the nonstationary roots of null spectra for data from sensor arrays, or time series. Without the assumption of uniformity for linear arrays, this adaptive-rooting algorithm associated with the zero-extraction technique is further extended to construct a parallel-effective-rooting processor. The adaptive algorithm tracks all the principal roots and reduces the computational complexity from order N3 to order N2. Simulations show better resolution performance of the suggested algorithm than that of the usual of spectral-based high-resolution techniques such as minimum-norm or MUSIC, for both uniform and nonuniform cases. Simulations also reveal that its convergence speed competes with those of recent fast adaptive eigen-structure algorithms for tracking the nonstationary parameters.

AB - An adaptive rooting algorithm, is proposed for tracking the nonstationary roots of null spectra for data from sensor arrays, or time series. Without the assumption of uniformity for linear arrays, this adaptive-rooting algorithm associated with the zero-extraction technique is further extended to construct a parallel-effective-rooting processor. The adaptive algorithm tracks all the principal roots and reduces the computational complexity from order N3 to order N2. Simulations show better resolution performance of the suggested algorithm than that of the usual of spectral-based high-resolution techniques such as minimum-norm or MUSIC, for both uniform and nonuniform cases. Simulations also reveal that its convergence speed competes with those of recent fast adaptive eigen-structure algorithms for tracking the nonstationary parameters.

UR - http://www.scopus.com/inward/record.url?scp=0026818344&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0026818344&partnerID=8YFLogxK

U2 - 10.1049/ip-f-2.1992.0004

DO - 10.1049/ip-f-2.1992.0004

M3 - Article

VL - 139

SP - 43

EP - 48

JO - IEE Proceedings, Part F: Radar and Signal Processing

JF - IEE Proceedings, Part F: Radar and Signal Processing

SN - 0956-375X

IS - 1

ER -