The ELS-coder: a rapid entropy coder

Author

Withers, D.

Author_Institution

Dept. of Math., US Naval Acad., Annapolis, MD

fYear

1997

fDate

25-27 Mar 1997

Firstpage

475

Abstract

Summary form only given. The ELS-coder is a new entropy-coding algorithm combining rapid encoding and decoding with near-optimum compression ratios. It can be combined with data-modeling methods to produce data-compression applications for text, images, or any type of digital data. Previous algorithms for entropy coding include Huffman coding, arithmetic coding, and the Q- and QM-coders, but all show limitations of speed or compression performance, so that new algorithms continue to be of interest. The ELS-coder, which uses no multiplication or division operations, operates more rapidly than traditional arithmetic coding. It compresses more effectively than Huffman coding (especially for a binary alphabet) and more effectively than the Q- or QM-coder except for symbol probabilities very close to zero or one

Keywords

data compression; decoding; entropy codes; image coding; ELS-coder; Huffman coding; Q-coder; QM-coder; arithmetic coding; compression performance; compression ratio; data compression; data modeling methods; decoding; digital data; entropy coder; entropy coding algorithm; image compression; images; symbol probabilities; text; Arithmetic; Decoding; Encoding; Entropy coding; Huffman coding; Image coding; Image converters; Measurement units; Table lookup; Transform coding;

fLanguage

English

Publisher

ieee

Conference_Titel

Data Compression Conference, 1997. DCC '97. Proceedings

Conference_Location

Snowbird, UT

ISSN

1068-0314

Print_ISBN

0-8186-7761-9

Type

conf

DOI

10.1109/DCC.1997.582144

Filename

582144