TY - GEN
T1 - A MINIMAL, GIVENS ROTATION BASED FRLS LATTICE ALGORITHM
AU - Desbouvries, François
AU - Regalia, Phillip A.
N1 - Publisher Copyright:
© 1996 European Signal Processing Conference, EUSIPCO. All rights reserved.
PY - 1996/1/1
Y1 - 1996/1/1
N2 - We propose a new Givens rotation based least-squares lattice algorithm. Based on spherical trigonometry principles, this algorithm turns out to be a normalized version of the fast QRD-based least-squares lattice filter, introduced independently by Ling and Proudler et al. In constrast to those algorithms, the storage requirements of the new algorithm are minimal (in the system theory sense). From this, we show that the new algorithm satisfies the backward consistency property, and hence enjoys stable error propagation.
AB - We propose a new Givens rotation based least-squares lattice algorithm. Based on spherical trigonometry principles, this algorithm turns out to be a normalized version of the fast QRD-based least-squares lattice filter, introduced independently by Ling and Proudler et al. In constrast to those algorithms, the storage requirements of the new algorithm are minimal (in the system theory sense). From this, we show that the new algorithm satisfies the backward consistency property, and hence enjoys stable error propagation.
UR - https://www.scopus.com/pages/publications/105028941161
M3 - Conference contribution
AN - SCOPUS:105028941161
T3 - European Signal Processing Conference
BT - 1996 8th European Signal Processing Conference, EUSIPCO 1996
PB - European Signal Processing Conference, EUSIPCO
T2 - 8th European Signal Processing Conference, EUSIPCO 1996
Y2 - 10 September 1996 through 13 September 1996
ER -