By Topic

High-throughput VLSI architectures for the 1-D and 2-D discrete cosine transforms

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

2 Author(s)
Chin-Liang Wang ; Inst. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Chang-Yu Chen

This paper presents a linear systolic array and a 2-D systolic array for computing the 1-D N-point and 2-D N×N-point discrete cosine transforms (DCT's), respectively. The 1-D DCT array is constructed by using the Chebyshev polynomial to generate the transform kernel values recursively. The 2-D DCT array is based on the row-column decomposition but involves no matrix transposition problems, where the row and column transforms are evaluated similarly to the 1-D DCT. These architectures are highly regular, modular, and thus very suitable for VLSI implementation. Also, each of them has an efficiency of 100% and a throughput rate of one transform per N cycles. As compared to existing related systems, the proposed 1-D DCT array achieves the same time complexity with either much fewer I/O channels or a higher degree of regularity, while the proposed 2-D DCT array possesses better time complexity and regularity with an increase in chip area and I/O channels

Published in:

Circuits and Systems for Video Technology, IEEE Transactions on  (Volume:5 ,  Issue: 1 )