|
Log Area Ratio
Log area ratios (LAR) can be used to represent reflection coefficients (another form for linear prediction coefficients) for transmission over a channel. While not as efficient as line spectral pairs (LSPs), log area ratios are much simpler to compute. Let r_k be the ''k''th reflection coefficient of a filter, the ''k''th LAR is: : A_k = \log Use of Log Area Ratios have now been mostly replaced by Line Spectral Pairs, but older codecs, such as GSM-FR use LARs. See also * Line spectral pairs Line spectral pairs (LSP) or line spectral frequencies (LSF) are used to represent linear predictive coding, linear prediction coefficients (LPC) for transmission over a channel. LSPs have several properties (e.g. smaller sensitivity to quantizatio ... References Lossy compression algorithms Data compression {{Compu-stub ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Reflection Coefficient
In physics and electrical engineering the reflection coefficient is a parameter that describes how much of a wave is reflected by an impedance discontinuity in the transmission medium. It is equal to the ratio of the amplitude of the reflected wave to the incident wave, with each expressed as phasors. For example, it is used in optics to calculate the amount of light that is reflected from a surface with a different index of refraction, such as a glass surface, or in an electrical transmission line to calculate how much of the electromagnetic wave is reflected by an impedance discontinuity. The reflection coefficient is closely related to the ''transmission coefficient''. The reflectance of a system is also sometimes called a reflection coefficient. Different disciplines have different applications for the term. Transmission lines In telecommunications and transmission line theory, the reflection coefficient is the ratio of the complex amplitude of the reflected wave to ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Linear Predictive Coding
Linear predictive coding (LPC) is a method used mostly in audio signal processing and speech processing for representing the spectral envelope of a digital signal of speech in compressed form, using the information of a linear predictive model. LPC is the most widely used method in speech coding and speech synthesis. It is a powerful speech analysis technique, and a useful method for encoding good quality speech at a low bit rate. Overview LPC starts with the assumption that a speech signal is produced by a buzzer at the end of a tube (for voiced sounds), with occasional added hissing and popping sounds (for voiceless sounds such as sibilants and plosives). Although apparently crude, this Source–filter model is actually a close approximation of the reality of speech production. The glottis (the space between the vocal folds) produces the buzz, which is characterized by its intensity (loudness) and frequency (pitch). The vocal tract (the throat and mouth) forms the tube, whi ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Line Spectral Pairs
Line spectral pairs (LSP) or line spectral frequencies (LSF) are used to represent linear predictive coding, linear prediction coefficients (LPC) for transmission over a channel. LSPs have several properties (e.g. smaller sensitivity to quantization noise) that make them superior to direct quantization of LPCs. For this reason, LSPs are very useful in speech coding. LSP representation was developed by Fumitada Itakura, at Nippon Telegraph and Telephone (NTT) in 1975. From 1975 to 1981, he studied problems in speech analysis and synthesis based on the LSP method. In 1980, his team developed an LSP-based speech synthesizer chip. LSP is an important technology for speech synthesis and coding, and in the 1990s was adopted by almost all international speech coding standards as an essential component, contributing to the enhancement of digital speech communication over mobile channels and the internet worldwide. LSPs are used in the code-excited linear prediction (CELP) algorithm, develop ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
Lossy Compression Algorithms
In information technology, lossy compression or irreversible compression is the class of data compression methods that uses inexact approximations and partial data discarding to represent the content. These techniques are used to reduce data size for storing, handling, and transmitting content. Higher degrees of approximation create coarser images as more details are removed. This is opposed to lossless data compression (reversible data compression) which does not degrade the data. The amount of data reduction possible using lossy compression is much higher than using lossless techniques. Well-designed lossy compression technology often reduces file sizes significantly before degradation is noticed by the end-user. Even when noticeable by the user, further data reduction may be desirable (e.g., for real-time communication or to reduce transmission times or storage needs). The most widely used lossy compression algorithm is the discrete cosine transform (DCT), first published by N ... [...More Info...] [...Related Items...] OR: [Wikipedia] [Google] [Baidu] |
