Complexity scalability design in global pulse replacement algorithm for ACELP speech codecs

Authors:
Fu-Kun Chen;Bo-Kai Su;Yue-Dar Jou
Affiliations:
Department of Computer Science and Information Engineering, Southern Taiwan University;Department of Computer Science and Information Engineering, Southern Taiwan University;Department of Electrical Engineering, ROC Military Academy, Taiwan
Venue:
DSP'09 Proceedings of the 16th international conference on Digital Signal Processing
Year:
2009

Citing 4
Cited 0

Digital Speech; Coding for Low Bit Rate Communication Systems

Digital Speech; Coding for Low Bit Rate Communication Systems
Maximum-take-precedence ACELP: a low complexity search method

ICASSP '01 Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02
Switching Search Method for Pulse Assignment in ITU-T G.729D

IEICE - Transactions on Information and Systems
Efficient fixed codebook search method for ACELP speech codecs

ICHIT'06 Proceedings of the 1st international conference on Advances in hybrid information technology

Quantified Score

Hi-index	0.00

Visualization

Abstract

The algebraic code excited linear prediction (ACELP) algorithm, due to low complexity and high quality in its analysis-by-synthesis (AbS) optimization, has been adopted by many speech coding standards. In this paper, the scalability of computational complexity to the global pulse replacement search method for ACELP is proposed. In addition, the proposed method can achieve the lowest computational complexity with perceptually negligible degradation. Based on the standard subjective and objective quality measurements, the experimental results reflect the facts.