Title :
High efficiency, multiplication free approximation of arithmetic coding
Author :
Chevion, Dan ; Karnin, Ehud D. ; Walach, Eugene
Author_Institution :
IBM Sci. & Technol., Haifa, Israel
Abstract :
An alternative procedure for reducing the computational complexity, which is applicable to both binary and multialphabet arithmetic coding, is described and its performance analysed with respect to the small increase in code length
Keywords :
computational complexity; data compression; encoding; binary arithmetic coding; code length; computational complexity; efficiency; multialphabet arithmetic coding; multiplication free approximation; performance; Arithmetic; Cities and towns; Computer architecture; Encoding; Entropy; Hardware; Iterative decoding; Registers;
Conference_Titel :
Data Compression Conference, 1991. DCC '91.
Conference_Location :
Snowbird, UT
Print_ISBN :
0-8186-9202-2
DOI :
10.1109/DCC.1991.213372
