ISCA Archive Interspeech 2013
ISCA Archive Interspeech 2013

Computationally efficient objective function for algebraic codebook optimization in ACELP

Tom Bäckström

Speech coding with the ACELP paradigm is based on a least squares algorithm in a perceptual domain, where the perceptual domain is specified by a filter. This article shows that the computational complexity of this conventional definition of the least squares problem can be reduced by taking into account the impact of the zero impulse response into the next frame. The proposed modification introduces a Toeplitz structure to a correlation matrix appearing in the objective function, which simplifies the structure and reduces computations. It is shown that the proposed method reduces computational complexity up to 17% without reducing perceptual quality.


doi: 10.21437/Interspeech.2013-752

Cite as: Bäckström, T. (2013) Computationally efficient objective function for algebraic codebook optimization in ACELP. Proc. Interspeech 2013, 3434-3438, doi: 10.21437/Interspeech.2013-752

@inproceedings{backstrom13_interspeech,
  author={Tom Bäckström},
  title={{Computationally efficient objective function for algebraic codebook optimization in ACELP}},
  year=2013,
  booktitle={Proc. Interspeech 2013},
  pages={3434--3438},
  doi={10.21437/Interspeech.2013-752}
}