A-law algorithm

related topics
{system, computer, user}
{math, number, function}
{rate, high, increase}

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 μ-law algorithm used in North America and Japan.

For a given input x, the equation for A-law encoding is as follows,

where A is the compression parameter. In Europe, A = 87.7; the value 87.6 is also used.

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 μ-law algorithm provides a slightly larger dynamic range than the A-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.

See also

External links

Full article ▸

related documents
Input
Foobar
Yacc
Common Intermediate Language
Dia (software)
Typed link
Small-C
Java Development Kit
Longitudinal redundancy check
Numbering plan
Common Language Runtime
ObjectPAL
UnrealScript
Grid network
Name server
BIND
Steelman language requirements
UMSDOS
SuperMemo
Data stream
Andrew Tridgell
ABC (programming language)
CORC
Djbdns
Binary symmetric channel
ANSI C
Galeon
Java Transaction API
Shotgun debugging
XBasic