DocumentCode
3421932
Title
Quantized indexing: beyond arithmetic coding
Author
Tomic, Ratko V.
fYear
2006
fDate
28-30 March 2006
Lastpage
468
Abstract
Summary form only given. Quantized indexing (QI) is a fast and space-efficient form of enumerative (combinatorial) coding (EC). The arithmetic precision, execution time, table sizes and coding delay of EC are all reduced by a factor O(n) at a redundancy below log(e)/2g-1 bits/symbol (for n input symbols and a g-bit QI precision). Due to its tighter enumeration, QI redundancy is below that of arithmetic coding (AC). The relative compression gains increase for shorter outputs and for less predictable data. Simultaneously, QI is significantly faster than the fastest arithmetic coders, from factor 6 in high to over 200 in low entropy limit (´typically´ 10 to 20 times faster). These speedups are the result of using no coding operations on more probable symbol, fewer and simpler operations on less probable symbol and intrinsically cleaner division of labor between the coder and modeler
Keywords
arithmetic codes; data compression; arithmetic coding; coding delay; compression gains; enumerative coding; quantized indexing; Decoding; Delay effects; Entropy; Floating-point arithmetic; Indexing; Notice of Violation; Predictive models; Resilience; Source coding; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Data Compression Conference, 2006. DCC 2006. Proceedings
Conference_Location
Snowbird, UT
ISSN
1068-0314
Print_ISBN
0-7695-2545-8
Type
conf
DOI
10.1109/DCC.2006.70
Filename
1607311
Link To Document