Efficient recursive structures for forward and inverse discrete cosine transform

Che Hong Chen, Bin Da Liu, Jar Ferr Yang, Jiun Lung Wang

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

In this paper, efficient architectures for realizing the recursive discrete cosine transform (DCT) and the recursive inverse DCT (IDCT) are proposed. By respectively folding the inputs of the DCT and the outputs of the IDCT, efficient formulations of the DCT and IDCT are derived to construct the transform kernels. The data throughput per transformation is twice that of the existing methods by spending only half of the computational cycles used by the single folding algorithms. To further improve efficiency, the double folding recursive architectures of the DCT and IDCT are developed. The computational cycles of the DCT are half of the single folding method, and the data throughput of the IDCT is twice that of the single folding method. The regular and modular properties of the proposed recursive architectures are suitable for very large scale integration (VLSI) implementation. With high throughput advantage, the proposed structures could be implemented with less power consumption, which could be applied to low rate video in mobile and portable information appliances.

Original languageEnglish
Pages (from-to)2665-2669
Number of pages5
JournalIEEE Transactions on Signal Processing
Volume52
Issue number9
DOIs
Publication statusPublished - 2004 Sep 1

Fingerprint

Discrete cosine transforms
Throughput
VLSI circuits
Electric power utilization

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Electrical and Electronic Engineering

Cite this

Chen, Che Hong ; Liu, Bin Da ; Yang, Jar Ferr ; Wang, Jiun Lung. / Efficient recursive structures for forward and inverse discrete cosine transform. In: IEEE Transactions on Signal Processing. 2004 ; Vol. 52, No. 9. pp. 2665-2669.
@article{781e404911fa4bc0beafd0b822744afd,
title = "Efficient recursive structures for forward and inverse discrete cosine transform",
abstract = "In this paper, efficient architectures for realizing the recursive discrete cosine transform (DCT) and the recursive inverse DCT (IDCT) are proposed. By respectively folding the inputs of the DCT and the outputs of the IDCT, efficient formulations of the DCT and IDCT are derived to construct the transform kernels. The data throughput per transformation is twice that of the existing methods by spending only half of the computational cycles used by the single folding algorithms. To further improve efficiency, the double folding recursive architectures of the DCT and IDCT are developed. The computational cycles of the DCT are half of the single folding method, and the data throughput of the IDCT is twice that of the single folding method. The regular and modular properties of the proposed recursive architectures are suitable for very large scale integration (VLSI) implementation. With high throughput advantage, the proposed structures could be implemented with less power consumption, which could be applied to low rate video in mobile and portable information appliances.",
author = "Chen, {Che Hong} and Liu, {Bin Da} and Yang, {Jar Ferr} and Wang, {Jiun Lung}",
year = "2004",
month = "9",
day = "1",
doi = "10.1109/TSP.2004.831911",
language = "English",
volume = "52",
pages = "2665--2669",
journal = "IEEE Transactions on Signal Processing",
issn = "1053-587X",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "9",

}

Efficient recursive structures for forward and inverse discrete cosine transform. / Chen, Che Hong; Liu, Bin Da; Yang, Jar Ferr; Wang, Jiun Lung.

In: IEEE Transactions on Signal Processing, Vol. 52, No. 9, 01.09.2004, p. 2665-2669.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Efficient recursive structures for forward and inverse discrete cosine transform

AU - Chen, Che Hong

AU - Liu, Bin Da

AU - Yang, Jar Ferr

AU - Wang, Jiun Lung

PY - 2004/9/1

Y1 - 2004/9/1

N2 - In this paper, efficient architectures for realizing the recursive discrete cosine transform (DCT) and the recursive inverse DCT (IDCT) are proposed. By respectively folding the inputs of the DCT and the outputs of the IDCT, efficient formulations of the DCT and IDCT are derived to construct the transform kernels. The data throughput per transformation is twice that of the existing methods by spending only half of the computational cycles used by the single folding algorithms. To further improve efficiency, the double folding recursive architectures of the DCT and IDCT are developed. The computational cycles of the DCT are half of the single folding method, and the data throughput of the IDCT is twice that of the single folding method. The regular and modular properties of the proposed recursive architectures are suitable for very large scale integration (VLSI) implementation. With high throughput advantage, the proposed structures could be implemented with less power consumption, which could be applied to low rate video in mobile and portable information appliances.

AB - In this paper, efficient architectures for realizing the recursive discrete cosine transform (DCT) and the recursive inverse DCT (IDCT) are proposed. By respectively folding the inputs of the DCT and the outputs of the IDCT, efficient formulations of the DCT and IDCT are derived to construct the transform kernels. The data throughput per transformation is twice that of the existing methods by spending only half of the computational cycles used by the single folding algorithms. To further improve efficiency, the double folding recursive architectures of the DCT and IDCT are developed. The computational cycles of the DCT are half of the single folding method, and the data throughput of the IDCT is twice that of the single folding method. The regular and modular properties of the proposed recursive architectures are suitable for very large scale integration (VLSI) implementation. With high throughput advantage, the proposed structures could be implemented with less power consumption, which could be applied to low rate video in mobile and portable information appliances.

UR - http://www.scopus.com/inward/record.url?scp=4344700039&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=4344700039&partnerID=8YFLogxK

U2 - 10.1109/TSP.2004.831911

DO - 10.1109/TSP.2004.831911

M3 - Article

AN - SCOPUS:4344700039

VL - 52

SP - 2665

EP - 2669

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

SN - 1053-587X

IS - 9

ER -