<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META http-equiv=Content-Type content="text/html; charset=iso-8859-1">
<META content="MSHTML 6.00.5730.11" name=GENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=#ffffff>
<DIV><FONT face=Arial size=2>I'm a bit puzzled, also, having implemented ulaw
and alaw in an embedded application. Each can be done with a 16 Kbyte
table in about 0 time with no errors. There are probably tricks
that will cut the table down by 2 or 4 X for a small cost in CPU
cycles. The inverse requires 256 16 bit words. I thought ulaw and
alaw were pretty much no brainers. I don't know of any gottchas. Why
anyone with more that a few K bytes of total system memory would even consider
anything other than a lookup table is beyond me.</FONT></DIV>
<DIV><FONT face=Arial size=2></FONT> </DIV>
<DIV><FONT face=Arial size=2>Wilton</FONT></DIV>
<DIV><FONT face=Arial size=2></FONT> </DIV></BODY></HTML>