A-law algorithm
Encyclopedia : A : AL : ALA : A-law algorithm
An a-law algorithm is a standard companding algorithm, used in European digital communications systems to optimize, i.e., modify, the dynamic range of an analog signal for digitizing.
It is similar to the mu-law algorithm used in North America and Japan.
For a given input x, the equation for A-law encoding is as follows,
- [F(x) = \sgn(x) \begin , & |x| < \\\frac, & \leq |x| \leq 1 \end],
A-law expansion is given by the inverse function,
- [
The reason for this encoding is that the wide dynamic range of speech does not lend itself well to efficient linear digital encoding. A-law encoding effectively reduces the dynamic range of the signal, thereby increasing the coding efficiency and resulting in a signal-to-distortion ratio that is superior to that obtained by linear encoding for a given number of bits.
Comparison to μ-law
The A-law algorithm provides a slightly larger dynamic range than the mu-law at the cost of worse proportional distortion for small signals. By convention, A-law is used for an international connection if at least one country uses it.
Mu-law has a special feature that sound-pressures near zero are encoded as zero. This reduces noise during the silent periods of long-distance calls, and increases perceived quality. It also reduces storage requirements when mu-law samples are digitally compressed.
See also
External links
- [Waveform Coding Techniques] - Has details of implementation (but note that the A-law equation is incorrect)
- [A-Law and mu-Law Companding Implementations Using the TMS320C54x] (PDF)
- [A-law and μ-law realisation (on C)]
From Wikipedia, the Free Encyclopedia. Original article here. Support Wikipedia by contributing or donating.
All text is available under the terms of the GNU Free Documentation License See Wikipedia Copyrights for details.