Sciweavers

DCC   1993 Data Compression Conference
Wall of Fame | Most Viewed DCC-1993 Paper
DCC
1993
IEEE
14 years 3 months ago
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 wo...
Gennady Feygin, P. Glenn Gulak, Paul Chow
Disclaimer and Copyright Notice
Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.
IdReadViewsTitleStatus
1Download preprint from source102
2Download preprint from source95
3Download preprint from source90
4Download preprint from source82