A MINIMAL, GIVENS ROTATION BASED FRLS LATTICE ALGORITHM

François Desbouvries; Phillip A. Regalia

A MINIMAL, GIVENS ROTATION BASED FRLS LATTICE ALGORITHM

François Desbouvries
, Phillip A. Regalia

CNRS SAMOVAR UMR 5157

Résultats de recherche: Contribution à un journal › Article de conférence › Revue par des pairs

Résumé

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.

langue originale	Anglais
journal	European Signal Processing Conference
état	Publié - 1 janv. 1996
Modification externe	Oui
Evénement	8th European Signal Processing Conference, EUSIPCO 1996 - Trieste, Italie Durée: 10 sept. 1996 → 13 sept. 1996

Autres fichiers et liens

Lien vers la publication dans Scopus

Contient cette citation

@article{e4bc52029f9a4bbcbbb6399bebf2f955,

title = "A MINIMAL, GIVENS ROTATION BASED FRLS LATTICE ALGORITHM",

abstract = "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.",

author = "Fran{\c c}ois Desbouvries and Regalia, \{Phillip A.\}",

note = "Publisher Copyright: {\textcopyright} 1996 European Signal Processing Conference, EUSIPCO. All rights reserved.; 8th European Signal Processing Conference, EUSIPCO 1996 ; Conference date: 10-09-1996 Through 13-09-1996",

year = "1996",

month = jan,

day = "1",

language = "English",

journal = "European Signal Processing Conference",

issn = "2219-5491",

}

TY - JOUR

T1 - A MINIMAL, GIVENS ROTATION BASED FRLS LATTICE ALGORITHM

AU - Desbouvries, François

AU - Regalia, Phillip A.

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 article

AN - SCOPUS:105028941161

SN - 2219-5491

JO - European Signal Processing Conference

JF - European Signal Processing Conference

T2 - 8th European Signal Processing Conference, EUSIPCO 1996

Y2 - 10 September 1996 through 13 September 1996

ER -

A MINIMAL, GIVENS ROTATION BASED FRLS LATTICE ALGORITHM

Résumé

Autres fichiers et liens

Empreinte digitale

Contient cette citation