scispace - formally typeset
Search or ask a question
Topic

Code-excited linear prediction

About: Code-excited linear prediction is a research topic. Over the lifetime, 2025 publications have been published within this topic receiving 28633 citations. The topic is also known as: CELP.


Papers
More filters
Proceedings ArticleDOI
S. Chompun1
06 Dec 2004
TL;DR: Fine granularity scalability (FGS) is introduced by adjusting the amount of transmitted fixed excitation information in the MP-CELP speech coding with HPDR technique to change the bit rate of the conventional coding more finely and more smoothly.
Abstract: In this work, based on the MP-CELP speech coding with HPDR technique, fine granularity scalability (FGS) is introduced by adjusting the amount of transmitted fixed excitation information. The FGS feature aim at changing the bit rate of the conventional coding more finely and more smoothly. Through performance analysis and computer simulation, the quality of scalability of the MP-CELP coding is presented with an improvement from conventional scalable MP-CELP. The HPDR technique is also applied to the MP-CELP to use for tonal language, meanwhile it can support the core coding rate of 4.2, 5.5, 7.5 kbps and additional scaled bit rates.

8 citations

Proceedings ArticleDOI
12 Oct 1998
TL;DR: The algorithm for conjugate-structure algebraic code-excited linear prediction (CS-ACELP) is discussed, and its central aspects are analyzed in detail.
Abstract: The ITU-T issued the new recommendation G.729 in 1996, to realize a high-quality and low-delay speech coder at 8-kb/s. In this paper, the algorithm for conjugate-structure algebraic code-excited linear prediction (CS-ACELP) is discussed, and its central aspects are analyzed in detail. Topics covered include the special codebook structure, efficient codebook search strategies and speech improvement approaches.

8 citations

Journal ArticleDOI
TL;DR: This paper introduces an interpretation of directional prediction as a particular case of linear prediction, which uses the first-order linear filters and a set of geometric transformations, and motivates the proposal of a generalized intra prediction framework, whereby theFirst- order linear filters are replaced by adaptive linear filters with sparsity constraints.
Abstract: Directional intra prediction plays an important role in current state-of-the-art video coding standards. In directional prediction, neighbouring samples are projected along a specific direction to predict a block of samples. Ultimately, each prediction mode can be regarded as a set of very simple linear predictors, a different one for each pixel of a block. Therefore, a natural question that arises is whether one could use the theory of linear prediction in order to generate intra prediction modes that provide increased coding efficiency. However, such an interpretation of each directional mode as a set of linear predictors is too poor to provide useful insights for their design. In this paper, we introduce an interpretation of directional prediction as a particular case of linear prediction, which uses the first-order linear filters and a set of geometric transformations. This interpretation motivated the proposal of a generalized intra prediction framework, whereby the first-order linear filters are replaced by adaptive linear filters with sparsity constraints. In this context, we investigate the use of efficient sparse linear models, adaptively estimated for each block through the use of different algorithms, such as matching pursuit, least angle regression, least absolute shrinkage and selection operator, or elastic net. The proposed intra prediction framework was implemented and evaluated within the state-of-the-art high efficiency video coding standard. Experiments demonstrated the advantage of this predictive solution, mainly in the presence of images with complex features and textured areas, achieving higher average bitrate savings than other related sparse representation methods proposed in the literature.

8 citations

01 Jan 2003
TL;DR: This thesis introduces a novel method for accurate pitch detection and speech segmentation, named Multi-feature, Autocorrelation (ACR), Wavelet Technique (MAWT), which uses feature extraction, and ACR applied on Linear Predictive Coding residuals, with a wavelet-based refinement step.
Abstract: This thesis introduces a novel method for accurate pitch detection and speech segmentation, named Multi-feature, Autocorrelation (ACR) and Wavelet Technique (MAWT). MAWT uses feature extraction, and ACR applied on Linear Predictive Coding (LPC) residuals, with a wavelet-based refinement step. MAWT opens the way for a unique approach to modeling: although speech is divided into segments, the success of voicing decisions is not crucial. Experiments demonstrate the superiority of MAWT in pitch period detection accuracy over existing methods, and illustrate its advantages for speech segmentation. These advantages are more pronounced for gain-varying and transitional speech, and under noisy conditions.

8 citations

Patent
Kaoru Sato1, Toshiyuki Morii1
14 Dec 2007
TL;DR: In this paper, an adaptive sound source vector quantization device capable of improving quantization accuracy of adaptive sound sources quantization while suppressing increase of the calculation amount in CELP sound encoding which performs encoding in sub-frame unit.
Abstract: Disclosed is an adaptive sound source vector quantization device capable of improving quantization accuracy of adaptive sound source vector quantization while suppressing increase of the calculation amount in CELP sound encoding which performs encoding in sub-frame unit. In the device, a search adaptive sound source vector generation unit (103) cuts out an adaptive sound source vector of a frame length (n) from an adaptive sound source codebook (102), a search impulse response matrix generation unit (105) generates a search impulse response matrix of n n by using an impulse response matrix for each of sub-frames inputted from a synthesis filter (104), a search target vector generation unit (106) adds the target vector of each sub-frame so as to generate a search target vector of frame length (n), an evaluation scale calculation unit (107); calculates the evaluation scale of the adaptive sound source vector quantization by using the search adaptive sound source vector, the search impulse response matrix, and the search target vector.

8 citations


Network Information
Related Topics (5)
Decoding methods
65.7K papers, 900K citations
83% related
Data compression
43.6K papers, 756.5K citations
83% related
Signal processing
73.4K papers, 983.5K citations
83% related
Feature vector
48.8K papers, 954.4K citations
80% related
Feature extraction
111.8K papers, 2.1M citations
79% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
20226
20213
20207
201915
201810
201713