2008•Unpublished venueRequires access

A fast adaptive codebook search method for speech coding

C. G. Kiran, K. Rajeev

Open publisher page 3 citations

Abstract

This paper presents an algorithm for fast codebook search of code excited linear prediction (CELP) coders and its descendants. The problem of reducing the bit rate of speech while preserving the quality of speech reconstructed from such a representation has received continuous attention. Real time implementation of adaptive codebook search in code excited linear prediction (CELP) and CELP based speech coders is identified as the computationally most complex module. Thus in this work, we propose a new method of using one bit computation instead of the 16 bit computation in the codebook search part of the speech codec. The simulation results show that effective codebook size and hence the computational time is reduced by 50%.

About this research paper

What this paper is about

This paper presents an algorithm for fast codebook search of code excited linear prediction (CELP) coders and its descendants. The problem of reducing the bit rate of speech while preserving the quality of speech reconstructed from such a representation has received continuous attention. Real time implementation of adaptive codebook search in code excited linear prediction (CELP) and CELP based speech coders is identified as the computationally most complex module. Thus in this work, we propose a new method of using one bit computation instead of the 16 bit computation in the codebook search part of the speech codec. The simulation results show that effective codebook size and hence the computational time is reduced by 50%.

Why it matters

OpenAlex reports 3 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

This paper presents an algorithm for fast codebook search of code excited linear prediction (CELP) coders and its descendants. The problem of reducing the bit rate of speech while preserving the quality of speech reconstructed from such a representation has received continuous attention. Real time implementation of adaptive codebook search in code excited linear prediction (CELP) and CELP based speech coders is identified as the computationally most complex module. Thus in this work, we propose a new method of using one bit computation instead of the 16 bit computation in the codebook search part of the speech codec. The simulation results show that effective codebook size and hence the computational time is reduced by 50%.

Key concepts: Code-excited linear prediction, Codebook, Speech coding, Vector sum excited linear prediction, Computer science, Linear predictive coding, Adaptive Multi-Rate audio codec, Codec2

Related papers

Back to paper searchBrowse research topicsOriginal source
A fast adaptive codebook search method for speech coding — Research Paper | ScholarLens