DocumentCode
3289263
Title
A Q-Coder algorithm with carry free addition
Author
Cena, Gianluca ; Montuschi, Paolo ; Ciminiera, Luigi ; Sanna, Andrea
Author_Institution
Dipartimento di Autom. e Inf., Politecnico di Torino, Italy
fYear
1997
fDate
6-9 Jul 1997
Firstpage
282
Lastpage
290
Abstract
The Q-Coder algorithm is a very efficient compression technique for bi-level images based on the arithmetic coding. The paper presents a new and fast version of the Q-Coder algorithm in which the carry-propagated adders have been replaced by carry-save adders. In this way, all the additions can be performed with a delay time of a single fill adder, independently of the length of the operands. The compression method is faster than the traditional Q-Coder algorithm with an almost unnoticeable increasing of the hardware requirements
Keywords
adders; data compression; digital arithmetic; image coding; Q-Coder algorithm; arithmetic coding; bi-level images; carry free addition; carry-propagated adders; carry-save adders; compression technique; delay time; hardware requirements; operands; single fill adder; Arithmetic; Decoding; Delay effects; Encoding; Hardware; Huffman coding; Image coding; State estimation; Statistics; Streaming media;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Arithmetic, 1997. Proceedings., 13th IEEE Symposium on
Conference_Location
Asilomar, CA
ISSN
1063-6889
Print_ISBN
0-8186-7846-1
Type
conf
DOI
10.1109/ARITH.1997.614906
Filename
614906
Link To Document