Reduced polynomial order linear prediction Dowling, Eric M. ; DeGroat, Ronald D. ; Linebarger, Darel A. ; Scharf, Louis L. ; Vis, Marvin L. "This work was supported, in part, by the National Science Foundation Grant MIP-9203296 and the Texas Advanced Research Program Grant 009741-022." Reduced rank linear predictive frequency and direction-of-arrival (DOA) estimation algorithms use the singular value decomposition (SVD) to produce a noise-cleaned linear prediction vector. These algorithms then root this vector to obtain a subset of roots, whose angles contain the desired frequency or DOA information. The roots closest to the unit circle are deemed to be the "signal roots." The rest of the roots are "extraneous." The extraneous roots are expensive to calculate. Further, a search must be done to discern the signal roots from the extraneous roots. Here, we present a reduced polynomial order linear prediction method that simplifies the rooting computation for applications where high-speed processing is critical. Colorado State University. Libraries 1996 text ; image application/pdf ECElls00004.pdf FACFECEN100393ARTI eng c1996 IEEE
Reduced polynomial order linear prediction
Dowling, Eric M. ; DeGroat, Ronald D. ; Linebarger, Darel A. ; Scharf, Louis L. ; Vis, Marvin L.
"This work was supported, in part, by the National Science Foundation Grant MIP-9203296 and the Texas Advanced Research Program Grant 009741-022."
Reduced rank linear predictive frequency and direction-of-arrival (DOA) estimation algorithms use the singular value decomposition (SVD) to produce a noise-cleaned linear prediction vector. These algorithms then root this vector to obtain a subset of roots, whose angles contain the desired frequency or DOA information. The roots closest to the unit circle are deemed to be the "signal roots." The rest of the roots are "extraneous." The extraneous roots are expensive to calculate. Further, a search must be done to discern the signal roots from the extraneous roots. Here, we present a reduced polynomial order linear prediction method that simplifies the rooting computation for applications where high-speed processing is critical.
Colorado State University. Libraries
1996
text ; image
application/pdf
ECElls00004.pdf
FACFECEN100393ARTI
eng
c1996 IEEE