Jerome R. Bellegarda
ICASSP 1989
A general linear prediction framework is developed for the derivation of the complex split Levinson algorithm, which leads naturally to a structural interpretation of the redundancy present in the classical Levinson-Durbin algorithm. A novel order-recursive predictor structure is presented. It is conceptually simpler than a lattice realization since it propagates only one (generalized) prediction error. When the usual prediction error is desired, it can be recovered through a simple terminal stage.
Jerome R. Bellegarda
ICASSP 1989
Jerome R. Bellegarda, David Nahamoo
ICASSP 1989
Jerome R. Bellegarda, Peter V. de Souza, et al.
ICASSP 1993
Krishna Nathan, Jerome R. Bellegarda, et al.
ICASSP 1993