Computationally efficient objective function for algebraic codebook optimization in ACELP

Tom Bäckström*

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionScientificpeer-review

4 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH
PublisherInternational Speech Communication Association
Pages3434-3438
Number of pages5
Publication statusPublished - 1 Jan 2013
MoE publication typeA4 Article in a conference publication
EventInterspeech - Lyon, France
Duration: 25 Aug 201329 Aug 2013

Publication series

NameProceedings of the Annual Conference of the International Speech Communication Association, INTERSPEECH
PublisherInternational Speech Communication Association
ISSN (Print)2308-457X

Conference

ConferenceInterspeech
CountryFrance
CityLyon
Period25/08/201329/08/2013

Keywords

  • ACELP
  • Computational complexity
  • Perceptual model
  • Speech coding
  • Toeplitz matrix

Fingerprint Dive into the research topics of 'Computationally efficient objective function for algebraic codebook optimization in ACELP'. Together they form a unique fingerprint.

Cite this