Generalized multiplication free arithmetic codes

Author

Fu, Bin ; Parhi, Keshab K.

Author_Institution

Dept. of Electr. Eng., Minnesota Univ., Minneapolis, MN, USA

Volume

1

fYear

1995

fDate

30 Apr-3 May 1995

Firstpage

437

Abstract

Arithmetic coding has become an important and efficient lossless compression technique for image coding. Multiplication free arithmetic coding algorithms provide excellent tradeoff between operation complexity and coding performance. This paper presents a whole family of multiplication free arithmetic codes which achieve the best coding efficiency and can be used for arbitrary size alphabets. This is accomplished by studying the effects of truncation and rounding in the sub-intervals for approximations. The complete tradeoff between the complexity of operations and compression performance of all the algorithms is presented. The conclusive study shows that there will be no more practical multiplication free arithmetic codes

Keywords

arithmetic codes; data compression; image coding; arbitrary size alphabets; coding efficiency; compression performance; image coding; lossless compression technique; multiplication free arithmetic codes; rounding; truncation; Adaptive coding; Arithmetic; Computed tomography; Contracts; Degradation; Entropy coding; Image coding; Performance analysis; Probability distribution; Very large scale integration;

fLanguage

English

Publisher

ieee

Conference_Titel

Circuits and Systems, 1995. ISCAS '95., 1995 IEEE International Symposium on

Conference_Location

Seattle, WA

Print_ISBN

0-7803-2570-2

Type

conf

DOI

10.1109/ISCAS.1995.521544

Filename

521544