loading...
A Q-Coder Algorithm with Carry Free Addition
Asilomar, CA March 06-March 09
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ARITH.1997.61490613th IEEE Symposium on Computer Arith ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Gianluca Cena, Politecnico di Torino
Paolo Montuschi, Politecnico di Torino
Luigi Ciminiera, Politecnico di Torino
Andrea Sanna, Politecnico di Torino
The Q-Coder algorithm is a very efficient compression technique for bi-level images based on the arithmetic coding. This 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 full adder, independently of the length of the operands. Our compression method is faster than the traditional Q-Coder algorithm with an almost unnoticeable increasing of the hardware requirements.
Index Terms:
arithmetic coding, image compression
Citation:
Gianluca Cena, Paolo Montuschi, Luigi Ciminiera, Andrea Sanna, "A Q-Coder Algorithm with Carry Free Addition," arith, pp.282, 13th IEEE Symposium on Computer Arithmetic (ARITH-13 '97), 1997
Usage of this product signifies your acceptance of the Terms of Use.