Implementation of two-dimensional discrete cosine transform and its inverse

In this paper, the implementation of a unified 8 × 8 discrete cosine transform (DCT) and its inverse is described. First, the accuracy of the structure that has been reported earlier is analyzed with Matlab in order to have internal word length requirements for the implementation. Then, the structure is modeled as a data path structure with Synopsys Module Compiler. When synthesizing the model with 19-bit internal word length onto 0.11 μm CMOS technology, the resulting pipeline exhibits an operation frequency of 253 MHz and uses 40 000 equivalent gates. The latency for both transforms is 94 cycles. Finally, the comparison to another unified pipeline structure reveals up to 15% smaller estimated area.

[1]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[2]  Kuo-Hsing Cheng,et al.  The design and implementation of DCT/IDCT chip with novel architecture , 2000, 2000 IEEE International Symposium on Circuits and Systems. Emerging Technologies for the 21st Century. Proceedings (IEEE Cat No.00CH36353).

[3]  S.-F. Hsiao,et al.  New matrix formulation for two-dimensional DCT/IDCT computation and its distributed-memory VLSI implementation , 2002 .

[4]  Jari Nikara,et al.  Pipeline architecture for two-dimensional discrete cosine transform and its inverse , 2002, 9th International Conference on Electronics, Circuits and Systems.

[5]  Ieee Standards Board,et al.  IEEE standard specifications for the implementations of 8x8 inverse discrete cosine transform , 1991 .

[6]  Paul H. Siegel,et al.  Area-efficient architectures for the Viterbi algorithm. I. Theory , 1993, IEEE Trans. Commun..