loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
17th IEEE Symposium on Computer Arithmetic (ARITH'05)
Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization
Cape Cod, Massachusetts, USA
June 27-June 29
ISBN: 0-7695-2366-8
Khan Wahid, University of Calgary
Vassil Dimitrov, University of Calgary
Graham Jullien, University of Calgary
This paper presents a novel error-free (infinite-precision) architecture for the fast implementation of both 8 ? 8 2-D Discrete Cosine Transform and Inverse DCT. The architecture uses a new algebraic integer quantization of a 1-D radix-8 DCT that allows the separable computation of a 2-D 8 ? 8 DCT without any intermediate number representation conversions. This is a considerable improvement on previously introduced algebraic integer encoding techniques to compute both DCT and IDCT which eliminates the requirements to approximate the transformation matrix elements by obtaining their exact representations and hence mapping the transcendental functions without any errors. Using this encoding scheme, an entire 8 ? 8 1-D DCT-SQ (scalar quantization) algorithm can be implemented with only 24 adders. Apart from the multiplication-free nature, this new mapping scheme fits to this algorithm, eliminating any computational or quantization errors and resulting short-word-length and high-speed-design. 8 8 .. 8 8 .. 8 8 ..
Citation:
Khan Wahid, Vassil Dimitrov, Graham Jullien, "Error-Free Computation of 8x8 2-D DCT and IDCT Using Two-Dimensional Algebraic Integer Quantization," arith, pp.214-221, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), 2005
Usage of this product signifies your acceptance of the Terms of Use.