From Wikipedia, the free encyclopedia
how does the a-law algorithm look like? What's the difference to the mu-law algorithm? --Abdull 17:08, 4 Apr 2005 (UTC)
equation
This needs finishing:
A-law expansion is then given by the inverse equation:
![{\displaystyle F^{-1}(y)={\begin{cases}{\operatorname {sgn}(y)|y|[1+\ln(A)]/A},&0\leq |y|<{1 \over 1+\ln(A)}\\\operatorname {sgn}(y)e^{|y|[1+ln(A)]-1)}/[A+A\ln(A)],&{1 \over 1+\ln(A)}\leq |y|\leq 1\end{cases}}}](/media/api/rest_v1/media/math/render/svg/1271f60aef305d7f2c0d1e7b59868119ce209e83)
It's not quite right. Check the external links and such. - Omegatron 15:12, May 24, 2005 (UTC)
