A time domain reformulation of linear prediction equivalent to the LSP decomposition

Tom Bäckström, Paavo Alku, W. Bastiaan Kleijn

Abstract

The Line spectrum pair (LSP) decomposition is a widely used method in speech coding. In this paper, we will present a reformulation of conventional linear prediction which is equivalent to the LSP decomposition. The paper shows that the symmetric and antisymmetric polynomials of the LSP decomposition are equivalent to two filters, that are determined by predicting a signal sample using its averaged and differentiated previous values.
BibTeX
@inproceedings{backstrom2002time,
  author = {Tom Bäckström and Paavo Alku and W. Bastiaan Kleijn},
  title = {{A time domain reformulation of linear prediction equivalent to the LSP decomposition}},
  booktitle = {IEEE International Conference on Acoustics, Speech and Signal Processing},
  year = {2002},
  doi = {10.1109/icassp.2002.5743804},
}

Loading related content...

Figure