A-law algorithm

An A-law algorithm is a standard companding algorithm, used in European eight-bit PCM digital communications systems to optimize, i.e. modify, the dynamic range of an analog signal for digitizing. It is one of the two companding algorithms in the G.711 standard from ITU-T, the other being the similar μ-law, used in North America and Japan. For a given input x {\displaystyle x} , the equation for A-law encoding is as follows: F ( x ) = sgn ⁡ ( x ) { A | x | 1 + ln ⁡ ( A ) , | x | < 1 A , 1 + ln ⁡ ( A | x | ) 1 + ln ⁡ ( A ) , 1 A ≤ | x | ≤ 1 , {\displaystyle F(x)=\operatorname {sgn}(x){\begin{cases}{\dfrac {A|x|}{1+\ln(A)}},&|x|<{\dfrac {1}{A}},\\[1ex]{\dfrac {1+\ln(A|x|)}{1+\ln(A)}},&{\dfrac {1}{A}}\leq |x|\leq 1,\end{cases}}} where A {\displaystyle A} is the compression parameter. In Europe, A = 87.6 {\displaystyle A=87.6} . A-law expansion is given by the inverse function: F − 1 ( y ) = sgn ⁡ ( y ) { | y | ( 1 + ln ⁡ ( A ) ) A , | y | < 1 1 + ln ⁡ ( A ) , e − 1 + | y | ( 1 + ln ⁡ ( A ) ) A , 1 1 + ln ⁡ ( A ) ≤ | y | < 1. {\displaystyle F^{-1}(y)=\operatorname {sgn}(y){\begin{cases}{\dfrac {|y|(1+\ln(A))}{A}},&|y|<{\dfrac {1}{1+\ln(A)}},\\{\dfrac {e^{-1+|y|(1+\ln(A))}}{A}},&{\dfrac {1}{1+\ln(A)}}\leq |y|<1.\end{cases}}} 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.