ITU-T G.729 Annex A: reduced complexity 8 kb/s CS-ACELP codec for digital simultaneous voice and data

Salami, R.; Laflamme, C.; Bessette, B.; Adoul, J.-P.

doi:10.1109/35.620526

Cited by 65 publications

(27 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In consideration of merely a single pulse contribution, the number of nonzero pulses in the codevector c k of length 40 is reduced to 1 from 4. Therefore, (2) can be simplified into (5), where the numerator of (5) is derived from (2) and (3), and the denominator of (5) is derived from (2) and (4), respectively. Just as in (2), the contribution of the ith pulse is reflected by the value of Q i k…”

Section: The Rcm Search Methodsmentioning

confidence: 99%

“…There have been a great number of studies proposed on search load reduction, say, the focus search in G.729 [3] and the depth-first search in G.729A [5], among other approaches. In recent times, to further reduce the computational complexity, there are many effective algebraic codebook search algorithms [6][7][8][9][10][11][12][13][14] proposed to reduce the pulse combinations.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

An efficient algebraic codebook search for ACELP speech coder

Yeh

Hwang

2014

J AUDIO SPEECH MUSIC PROC.

View full text Add to dashboard Cite

In a bid to enhance the search performance, this paper presents an improved version of reduced candidate mechanism (RCM), an algebraic codebook search conducted on an algebraic code-excited linear prediction (ACELP) speech coder. This improvement is made based on two findings in a piece of our prior work. The first finding is that a pulse with a high contribution in the associated track is more likely to serve as an optimal pulse in the optimal codevector and the second is that the speech quality can be well maintained at a search accuracy above 50% approximately. Subsequently, a new finding in this study concerning a structured algebraic codebook in G.729 indicates that there is a 0.8321 probability that the number 1 ranked pulse in a global sorting by pulse contribution is indeed one of the optimal pulses. Hence, the number 1 pulse in the global sorting is labeled as one of the optimal pulses, following which a sequence of search tasks are fulfilled through RCM. This proposed complexity reduction algorithm, implemented on a G.729A speech codec, takes as few as eight searches, a search load tantamount to 2.5% of G.729A, 12.5% of global pulse replacement method (iteration = 2), 16.7% of iteration-free pulse replacement method, and 50% of RCM (N = 2). This proposal is thus found to successfully reduce the required computational complexity to a great extent as intended.

show abstract

Section: The Rcm Search Methodsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

An efficient algebraic codebook search for ACELP speech coder

Yeh

Hwang

2014

J AUDIO SPEECH MUSIC PROC.

View full text Add to dashboard Cite

show abstract

“…In order to keep the computational complexity reasonable, a fast procedure known as a depth-first tree search [6] is used. The search begins with subset #1 and proceeds with subsequent subsets according to a tree structure while only 2 pulses are determined at each tree level.…”

Section: A Innovation Codebookmentioning

confidence: 99%

Flexible and scalable transform-domain codebook for high bit rate CELP coders

Eksler

Bessette

Jelinek

et al. 2017

2017 25th European Signal Processing Conference (EUSIPCO)

View full text Add to dashboard Cite

Abstract-The Code-Excited Linear Prediction (CELP) model is very efficient in coding speech at low bit rates. However, if the bit rate of the coder is increased, the CELP model does not gain in quality as quickly as other approaches. Moreover, the computational complexity of the CELP model generally increases significantly at higher bit rates. In this paper we focus on a technique that aims to overcome these limitations by means of a special transform-domain codebook within the CELP model. We show by the example of the AMR-WB codec that the CELP model with the new flexible and scalable codebook improves the quality at high bit rates at no additional complexity cost.

show abstract

“…This parameter has significant merits of compression with interpolation, vector quantization and prediction. However, a conversion and a quantization consume typically about 1.0 WMOPS [9,10]. Thus, LSP parameter is not feasible for this application.…”

Section: Introductionmentioning

confidence: 99%

Low-complexity PARCOR coefficient quantization and prediction order estimation designed for entropy coding of prediction residuals

Kamamoto

Moriya

Harada

et al. 2013

Acoust. Sci. & Tech.

View full text Add to dashboard Cite

This paper presents a set of low-complexity tools used in lossless coding of G.711 bitstream, based on linear prediction. One is an algorithm for quantizing the PARCOR/reflection coefficients and the other is an estimation method for the optimal prediction order. Both tools are based on a criterion that minimizes the entropy of the prediction residual signal and can be implemented in fixed-point arithmetic at very low-complexity. Since proposed methods show efficient performance in terms of compression and complexity, they are adopted in the Recommendation ITU-T G.711.0, a new standard for lossless compression of G.711 (A-law/ -law logarithmic PCM) payload.

show abstract

ITU-T G.729 Annex A: reduced complexity 8 kb/s CS-ACELP codec for digital simultaneous voice and data

Cited by 65 publications

References 5 publications

An efficient algebraic codebook search for ACELP speech coder

An efficient algebraic codebook search for ACELP speech coder

Flexible and scalable transform-domain codebook for high bit rate CELP coders

Low-complexity PARCOR coefficient quantization and prediction order estimation designed for entropy coding of prediction residuals

Contact Info

Product

Resources

About