Discrete cosine and sine transforms: regular algorithms and pipeline architectures

Authors:
Jari A. Nikara;Jarmo H. Takala;Jaakko T. Astola
Affiliations:
Department of Information Technology, Tampere University of Technology, Tampere, Finland;Department of Information Technology, Tampere University of Technology, Tampere, Finland;Department of Information Technology, Tampere University of Technology, Tampere, Finland
Venue:
Signal Processing
Year:
2006

Citing 9
Cited 1

Fast discrete sine transform algorithms

Signal Processing
A Block Processing Unit in a Single-Chip MPEG-2 Video Encoder LSI

Journal of VLSI Signal Processing Systems - Special issue on the 1997 IEEE workshop on signal processing systems (SiPS): design and implementation
A Serial-Parallel Architecture for Two-Dimensional Discrete Cosine and Inverse Discrete Cosine Transforms

IEEE Transactions on Computers
Pipeline architecture for 8/spl times/8 discrete cosine transform

ICASSP '00 Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06
Architecture-oriented regular algorithms for discrete sine andcosine transforms

IEEE Transactions on Signal Processing
One- and two-dimensional constant geometry fast cosine transformalgorithms and architectures

IEEE Transactions on Signal Processing
Constant geometry algorithm for discrete cosine transform

IEEE Transactions on Signal Processing
A cost-effective architecture for 8×8 two-dimensional DCT/IDCT using direct method

IEEE Transactions on Circuits and Systems for Video Technology
A 100 MHz 2-D 8×8 DCT/IDCT processor for HDTV applications

IEEE Transactions on Circuits and Systems for Video Technology

Computer Generation of Hardware for Linear Digital Signal Processing Transforms

ACM Transactions on Design Automation of Electronic Systems (TODAES)

Quantified Score

Hi-index	0.08

Visualization

Abstract

In this paper, regular fast algorithms for discrete cosine transform (DCT) and discrete sine transform (DST) of types II-IV are proposed and mapped onto pipeline architectures. The algorithms are based on the factorization of transform matrices described earlier by Wang. The regular structures of the algorithms are advantageous when mapping them onto hardware although such algorithms do not reach the theoretical lower bound on multiplicative complexity. Instead, the algorithms lend themselves for vertical mapping resulting in area-efficient pipeline structures. A unified pipeline architecture supporting both the DCT-II and its inverse is implemented with data path synthesis for proving the feasibility and estimating the performance. The latency of an ASIC implementation is 94 cycles while operating at 250 MHz frequency.