Title :
Generalized multiplication-free arithmetic codes
Author :
Fu, Bin ; Parhi, Keshab K.
Author_Institution :
AT&T Bell Labs., Allentown, PA, USA
fDate :
5/1/1997 12:00:00 AM
Abstract :
Arithmetic coding is a highly efficient lossless source coding technique. Multiplication-free arithmetic coding algorithms provide an excellent tradeoff between operation complexity and coding performance. A whole family of multiplication-free arithmetic codes, which achieve the best coding efficiency and can be used for arbitrary size of alphabets, is derived. The complete tradeoff between the complexity of operations and compression performance of all the algorithms is presented
Keywords :
arithmetic codes; data compression; source coding; variable length codes; alphabet size; approximations; arithmetic coding algorithms; coding efficiency; coding performance; compression performance; generalized multiplication-free arithmetic codes; lossless source coding; operation complexity; rounding; truncation; variable-length source coding; Adaptive coding; Arithmetic; Decoding; Entropy; Huffman coding; Image coding; Performance analysis; Source coding; Statistics; Transform coding;
Journal_Title :
Communications, IEEE Transactions on
