By Topic

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
$33 $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)

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:

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