Shift-register-based data transposition for cost-effective discrete cosine transform

Authors:
Shih-Chang Hsia;Szu-Hong Wang
Affiliations:
Department of Computer and Communication Engineering, National Kaohsiung First University of Science and Technology, Taiwan, R.O.C.;Department of Computer and Communication Engineering, National Kaohsiung First University of Science and Technology, Taiwan, R.O.C.
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
2007

Citing 2
Cited 1

H.263+: video coding at low bit rates

IEEE Transactions on Circuits and Systems for Video Technology
New cost-effective VLSI implementation of a 2-D discrete cosine transform and its inverse

IEEE Transactions on Circuits and Systems for Video Technology

A high performance video transform engine by using space-time scheduling strategy

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a cost-effective 2-D-discrete cosine transform (DCT) architecture based on the fast row/column decomposition algorithm. We propose a new schedule for 2-D-DCT computing to reduce the hardware cost. With this approach, the transposed memory can be simplified using shift-registers for the data transposition between two 1-D-DCT units. A special shift cell with MOS circuit is designed by using the energy transferring methodology. The memory size can be greatly reduced, and the address generator and its READ/WRITE control all can be saved. For an 8 × 8-block transformation, the number of transistors is only 4 k for the shift-register array. The maximum frequency of shift-operation can achieve about 120 MHz, when implemented by 0.35-µm technology.