Information about Algebraic Code Excited Linear Prediction
Algebraic Code Excited Linear Prediction (ACELP) is a speech encoding algorithm where a limited set of pulses is distributed as excitation to linear prediction filter.
The ACELP method is widely employed in current speech coding standards such as AMR, EFR, AMR-WB and ITU-T G-series standards G.729 and G.723.1.
ACELP is a registered trademark of VoiceAge Corporation[1] in Canada and/or other countries and was developed in 1989 by the Université de Sherbrooke in Canada[2].
The main advantage of ACELP is that the algebraic codebook it uses can be made very large (> 50 bits) without running into storage (RAM/ROM) or complexity (CPU time) problems.
A 16-bit algebraic codebook shall be used in the innovative codebook search, the aim of which is to find the best innovation and gain parameters. The innovation vector contains, at most, four non-zero pulses.
In ACELP a block of N speech samples is synthesized by filtering an appropriate innovation sequence from a codebook, scaled by a gain factor g c, through two time varying filters.
The long-term or pitch, synthesis filter is given by: 1/B(z) = 1/(1 - gpz-T)
The short-term synthesis filter is given by: H(z) = 1/A(z) = 1/(1 + ZIGMAi = 1 to Paiz-i)
(See for formats and for codecs)
..... Click the link for more information.
The ACELP method is widely employed in current speech coding standards such as AMR, EFR, AMR-WB and ITU-T G-series standards G.729 and G.723.1.
ACELP is a registered trademark of VoiceAge Corporation[1] in Canada and/or other countries and was developed in 1989 by the Université de Sherbrooke in Canada[2].
Features
The ACELP vocoder has a bit rate of 7.2 kbit/s including forward error correction (FEC).The main advantage of ACELP is that the algebraic codebook it uses can be made very large (> 50 bits) without running into storage (RAM/ROM) or complexity (CPU time) problems.
Technology
The ACELP vocoder algorithm is based on the CELP coding model, but ACELP codebooks have a specific algebraic structure imposed upon them.A 16-bit algebraic codebook shall be used in the innovative codebook search, the aim of which is to find the best innovation and gain parameters. The innovation vector contains, at most, four non-zero pulses.
In ACELP a block of N speech samples is synthesized by filtering an appropriate innovation sequence from a codebook, scaled by a gain factor g c, through two time varying filters.
The long-term or pitch, synthesis filter is given by: 1/B(z) = 1/(1 - gpz-T)
The short-term synthesis filter is given by: H(z) = 1/A(z) = 1/(1 + ZIGMAi = 1 to Paiz-i)
References
| Lossless compression methods | ||||
|---|---|---|---|---|
| Audio compression methods |
| |||
| Image compression methods |
| |||
| Video compression |
| |||
| Timeline of information theory, data compression, and error-correcting codes | ||||
Speech coding is the application of data compression of digital audio signals containing speech. Speech coding uses speech-specific parameter estimation using audio signal processing techniques to model the speech signal, combined with generic data compression algorithms to
..... Click the link for more information.
..... Click the link for more information.
Adaptive Multi-Rate Narrow Band (AMR-NB)
File extension:
MIME type:
Type of format: Audio
Adaptive Multi-Rate (AMR) is an audio data compression scheme optimized for speech coding.
..... Click the link for more information.
File extension:
.amrMIME type:
audio/amrType of format: Audio
Adaptive Multi-Rate (AMR) is an audio data compression scheme optimized for speech coding.
..... Click the link for more information.
Enhanced Full Rate or EFR or GSM-EFR is a speech coding standard that was developed in order to improve the quite poor quality of GSM-Full Rate (FR) codec. Working at 12.2 kbit/s the EFR provides wirelike quality in any noise free and background noise conditions.
..... Click the link for more information.
..... Click the link for more information.
Adaptive Multi-Rate Wide Band (AMR-WB)
File extension:
MIME type:
Type of format: Audio
Adaptive Multi Rate – WideBand (AMR-WB
..... Click the link for more information.
File extension:
.awbMIME type:
audio/amr-wbType of format: Audio
Adaptive Multi Rate – WideBand (AMR-WB
..... Click the link for more information.
G.729 is an audio data compression algorithm for voice that compresses voice audio in chunks of 10 milliseconds. Music or tones such as DTMF or fax tones cannot be transported reliably with this codec, and thus use G.711 or out-of-band methods to transport these signals.
G.
..... Click the link for more information.
G.
..... Click the link for more information.
G.723.1 is an audio codec for voice that compresses voice audio in 30 ms frames. An algorithmic look-ahead of 7.5 ms duration means that total algorithmic delay is 37.5 ms.
Note that this is a completely different codec from G.723.
There are two bit rates at which G.
..... Click the link for more information.
Note that this is a completely different codec from G.723.
There are two bit rates at which G.
..... Click the link for more information.
Université de Sherbrooke is a large university with three distinct campuses, two of which are located in Sherbrooke, Quebec, Canada, and another, located in Longueuil, a suburb of Montreal approximately 130 km west of Sherbrooke.
..... Click the link for more information.
..... Click the link for more information.
This page is currently protected from editing until disputes have been resolved.
Protection is not an endorsement of the current [ version] ([ protection log]).
..... Click the link for more information.
Protection is not an endorsement of the current [ version] ([ protection log]).
..... Click the link for more information.
In telecommunication, forward error correction (FEC) is a system of error control for data transmission, whereby the sender adds redundant data to its messages, which allows the receiver to detect and correct errors (within some bound) without the need to ask the sender for
..... Click the link for more information.
..... Click the link for more information.
Code Excited Linear Prediction (CELP) is a speech coding algorithm originally proposed by M.R. Schroeder and B.S. Atal in 1985. At the time, it provided significantly better quality than existing low bit-rate algorithms, such as RELP and LPC vocoders (e.g. FS-1015).
..... Click the link for more information.
..... Click the link for more information.
data compression or source coding is the process of encoding information using fewer bits (or other information-bearing units) than an un-encoded representation would use through use of specific encoding schemes.
..... Click the link for more information.
..... Click the link for more information.
Lossless data compression is a class of data compression algorithms that allows the exact original data to be reconstructed from the compressed data. This can be contrasted to lossy data compression, which does not allow the exact original data to be reconstructed from the
..... Click the link for more information.
..... Click the link for more information.
Information theory is a branch of applied mathematics and engineering involving the quantification of information to find fundamental limits on compressing and reliably communicating data.
..... Click the link for more information.
..... Click the link for more information.
Shannon entropy or information entropy is a measure of the uncertainty associated with a random variable.
Shannon entropy quantifies the information contained in a piece of data: it is the minimum average message length, in bits (if using base-2 logarithms), that must
..... Click the link for more information.
Shannon entropy quantifies the information contained in a piece of data: it is the minimum average message length, in bits (if using base-2 logarithms), that must
..... Click the link for more information.
In computer science, the Kolmogorov complexity (also known as descriptive complexity, Kolmogorov-Chaitin complexity, stochastic complexity, algorithmic entropy, or program-size complexity
..... Click the link for more information.
..... Click the link for more information.
Redundancy in information theory is the number of bits used to transmit a message minus the number of bits of actual information in the message. Informally, it is the amount of wasted "space" used to transmit certain data.
..... Click the link for more information.
..... Click the link for more information.
In information theory an entropy encoding is a lossless data compression scheme that is independent of the media’s specific characteristics.
One of the main types of entropy coding assigns codes to symbols so as to match code lengths with the probabilities of the
..... Click the link for more information.
One of the main types of entropy coding assigns codes to symbols so as to match code lengths with the probabilities of the
..... Click the link for more information.
Huffman coding is an entropy encoding algorithm used for lossless data compression. The term refers to the use of a variable-length code table for encoding a source symbol (such as a character in a file) where the variable-length code table has been derived in a particular way
..... Click the link for more information.
..... Click the link for more information.
Adaptive Huffman coding (also called Dynamic Huffman coding) is an adaptive coding technique based on Huffman coding, building the code as the symbols are being transmitted, having no initial knowledge of source distribution, that allows one-pass encoding and adaptation to
..... Click the link for more information.
..... Click the link for more information.
Arithmetic coding is a method for lossless data compression. Normally, a string of characters such as the words "hello there" is represented using a fixed number of bits per character, as in the ASCII code.
..... Click the link for more information.
..... Click the link for more information.
Range encoding is a form of arithmetic coding, a data compression method, that is believed to be free from arithmetic coding related patents. It is on this basis that interest in range encoding has arisen, particularly in the open source community.
..... Click the link for more information.
..... Click the link for more information.
..... Click the link for more information.
An Exponential-Golomb code (or just Exp-Golomb code) of order is a type of universal code, parameterized by a whole number . To encode a nonnegative integer in an order- exp-Golomb code, one can use the following method:
..... Click the link for more information.
..... Click the link for more information.
universal code for integers is a prefix code that maps the positive integers onto binary codewords, with the additional property that whatever the true probability distribution on integers, as long as the distribution is monotonic (i.e.
..... Click the link for more information.
..... Click the link for more information.
Elias gamma code is a universal code encoding positive integers. It is used most commonly when coding integers whose upper-bound cannot be determined beforehand.
To code a number:
..... Click the link for more information.
To code a number:
- Write it in binary.
..... Click the link for more information.
Fibonacci coding is a universal code which encodes positive integers into binary code words. All tokens end with "11" and have no "11" before the end.
The formula used to generate Fibonacci codes is:
where F(i) is the i-th Fibonacci number.
..... Click the link for more information.
The formula used to generate Fibonacci codes is:
where F(i) is the i-th Fibonacci number.
..... Click the link for more information.
A dictionary coder, also sometimes known as a substitution coder, is any of a number of lossless data compression algorithms which operate by searching for matches between the text to be compressed and a set of strings contained in a data structure (called the 'dictionary')
..... Click the link for more information.
..... Click the link for more information.
LZ77 and LZ78 are the names for the two lossless data compression algorithms published in papers by Abraham Lempel and Jacob Ziv in 1977 and 1978. They are also known as LZ1 and LZ2 respectively [1] .
..... Click the link for more information.
..... Click the link for more information.
Lempel-Ziv-Welch (LZW) is a universal lossless data compression algorithm created by Abraham Lempel, Jacob Ziv, and Terry Welch. It was published by Welch in 1984 as an improved implementation of the LZ78 algorithm published by Lempel and Ziv in 1978.
..... Click the link for more information.
..... Click the link for more information.
Lempel-Ziv-Oberhumer (LZO) is a data compression algorithm that is focused on decompression speed. The algorithm is lossless and the reference implementation is thread safe.
A free software tool which implements it is lzop.
..... Click the link for more information.
A free software tool which implements it is lzop.
..... Click the link for more information.
This article is copied from an article on Wikipedia.org - the free encyclopedia created and edited by online user community. The text was not checked or edited by anyone on our staff. Although the vast majority of the wikipedia encyclopedia articles provide accurate and timely information please do not assume the accuracy of any particular article. This article is distributed under the terms of GNU Free Documentation License.
Herod_Archelaus