Cart (Loading....) | Create Account
Close category search window
 

On the Error-Free Realization of a Scaled DCT Algorithm and Its VLSI Implementation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Wahid, K.A. ; Calgary Univ., Calgary ; Dimitrov, V.S. ; Jullien, G.A.

This brief is concerned with the efficient and error-free implementation of the order-8 Linzer-Feig (L-F) scaled discrete cosine transform (sDCT). We present a novel 3-D algebraic integer encoding scheme which maps the transform basis functions (transcendental functions such as cosine and tangent) with integer values, so that the quantization errors can be minimized and the cross-multiplications (in the signal path) can be avoided. This scheme also allows the separable computation of a 2-D DCT in multiplication-free, fast, and efficient architectures with a process rate of 80 mega-samples/sec. The proposed scheme also reduces the latency and the power consumption compared to previously employed designs for DCT implementations.

Published in:

Circuits and Systems II: Express Briefs, IEEE Transactions on  (Volume:54 ,  Issue: 8 )

Date of Publication:

Aug. 2007

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.