In this paper, a block-constrained trellis coded vector quantization (BC-TCVQ) algorithm is combined with an algebraic codebook to produce an algebraic trellis vector code (ATVC) to be used in ACELP coding. ATVC expands the set of allowed algebraic codebook pulse position, and the trellis branches are labeled with these subsets. The Viterbi algorithm is used to select the excitation codevector. A fast codebook search method using an efficient non-exhaustive search technique is also proposed to reduce the complexity of the ATVC search procedure while maintaining the quality of the reconstructed speech. The ATVC block code is used as the fixed codebook of AMR-NB (12.2 kbps), which reduces the computational complexity compared to the conventional algebraic codebook.

In multimedia communication, due to the limited computational capability of the personal information machine, a coder with low computational complexity is needed to integrate services from several media sources. This paper presents two efficient candidate schemes to simplify the most computationally demanding operation, the excitation codebook search procedure. For fast adaptive codebook search, we propose an algorithm that uses residual signals to predict the candidate gain-vectors of the adaptive codebook. For the fixed codebook, we propose a fast search algorithm using an energy function to predict the candidate pulses, and we redesign the codebook structure to twin multi-track positions architecture. Overall simulation results indicate that the average perceptual evaluation of speech quality (PESQ) score is degraded slightly, by 0.049, and our proposed methods can reduce total computational complexity by about 67% relative to the original G.723.1 encoder computation load, and with perceptually negligible degradation. Objective and subjective evaluations verify that the more efficient candidate schemes we propose can provide speech quality comparable to that using the original coder approach.

The AMR wideband speech codec was recently developed for high-quality wideband speech communications. Although it has an excellent performance due to expanded bandwidth of speech signal, it requires a huge amount of computation especially in codebook search. To solve this problem, this paper proposes an efficient codebook search method for AMR wideband codec. Starting from a poorly performing initial codevector, the proposed method enhances the performance of the codevector iteratively by exchanging the worst pulse in the codevector with a better one after evaluating the role of each pulse. Simulations show that the AMR wideband codec adopting the proposed codebook search method provides better performance with much less computational load than that using the standard method.

In this paper, we propose an adaptive encoding method of fixed codebook in CELP coders and implement an adaptive fixed code-excited linear prediction (AF-CELP) speech coder as a low-bit-rate extension to the 8 kbit/s CS-ACELP. The AF-CELP can be implemented at low bit rates as well as low complexity by exploiting the fact that the fixed codebook contribution to the speech signal is periodic, as is the adaptive codebook (or pitch filter) contribution. Listening tests show that the 6.4 kbit/s AF-CELP has a comparable quality to the 8 kbit/s CS-ACELP under real environmental test conditions.