Minimizing Error and VLSI Complexity in the Multiplication-Free Approximation of Arithmetic Coding

Two new algorithms for performing arithmetic coding without employing multiplication are presented. The first algorithm, suitable for an alphabet of arbitrary size, reduces the worst case normalized excess length to under 0.8%

• Type: Conference
• Year: 1993
• Where: DCC
• Authors: Gennady Feygin, P. Glenn Gulak, Paul Chow
• Keywords: Arbitrary Size, Arithmetic Coding, Computer Graphics, DCC 1993