Condensed recursive structures for computing multi-dimensional DCT with arbitrary length

Che Hong Chen, Bin-Da Liu, Jar-Ferr Yang

Research output: Contribution to journalArticle

Abstract

In this paper, the efficient recursive structure for computing arbitrary length M-dimensional (M-D) discrete cosine transform (DCT) is proposed. The M-D DCT are first converted into condensed one-dimensional DCT and discrete sine transform (DST) with a regular preprocess procedure. Using Chebyshev polynomials, the recursive filters for condensed 1-D DCT/DST are then derived to compute M-D DCT without involving any data transposition. The proposed structure requires fewer recursive loops than the traditional 1-D recursive structures, which are realized in M passes and (M-1) data transposition by the so-called row-column approach. With advantages of fewer recursive loops and no transposition memory, the proposed structures attain more accurate results and less power consumption than the existed ones, which are realized in the row-column approach. With regular and modular features, the proposed recursive M-D DCT structure is suitable for VLSI implementation.

Original languageEnglish
JournalProceedings - IEEE International Symposium on Circuits and Systems
Volume3
Publication statusPublished - 2004

Fingerprint

Discrete cosine transforms
Electric power utilization
Polynomials
Data storage equipment

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{2774c1c097a246f78e9e151b95c200a8,
title = "Condensed recursive structures for computing multi-dimensional DCT with arbitrary length",
abstract = "In this paper, the efficient recursive structure for computing arbitrary length M-dimensional (M-D) discrete cosine transform (DCT) is proposed. The M-D DCT are first converted into condensed one-dimensional DCT and discrete sine transform (DST) with a regular preprocess procedure. Using Chebyshev polynomials, the recursive filters for condensed 1-D DCT/DST are then derived to compute M-D DCT without involving any data transposition. The proposed structure requires fewer recursive loops than the traditional 1-D recursive structures, which are realized in M passes and (M-1) data transposition by the so-called row-column approach. With advantages of fewer recursive loops and no transposition memory, the proposed structures attain more accurate results and less power consumption than the existed ones, which are realized in the row-column approach. With regular and modular features, the proposed recursive M-D DCT structure is suitable for VLSI implementation.",
author = "Chen, {Che Hong} and Bin-Da Liu and Jar-Ferr Yang",
year = "2004",
language = "English",
volume = "3",
journal = "Proceedings - IEEE International Symposium on Circuits and Systems",
issn = "0271-4310",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Condensed recursive structures for computing multi-dimensional DCT with arbitrary length

AU - Chen, Che Hong

AU - Liu, Bin-Da

AU - Yang, Jar-Ferr

PY - 2004

Y1 - 2004

N2 - In this paper, the efficient recursive structure for computing arbitrary length M-dimensional (M-D) discrete cosine transform (DCT) is proposed. The M-D DCT are first converted into condensed one-dimensional DCT and discrete sine transform (DST) with a regular preprocess procedure. Using Chebyshev polynomials, the recursive filters for condensed 1-D DCT/DST are then derived to compute M-D DCT without involving any data transposition. The proposed structure requires fewer recursive loops than the traditional 1-D recursive structures, which are realized in M passes and (M-1) data transposition by the so-called row-column approach. With advantages of fewer recursive loops and no transposition memory, the proposed structures attain more accurate results and less power consumption than the existed ones, which are realized in the row-column approach. With regular and modular features, the proposed recursive M-D DCT structure is suitable for VLSI implementation.

AB - In this paper, the efficient recursive structure for computing arbitrary length M-dimensional (M-D) discrete cosine transform (DCT) is proposed. The M-D DCT are first converted into condensed one-dimensional DCT and discrete sine transform (DST) with a regular preprocess procedure. Using Chebyshev polynomials, the recursive filters for condensed 1-D DCT/DST are then derived to compute M-D DCT without involving any data transposition. The proposed structure requires fewer recursive loops than the traditional 1-D recursive structures, which are realized in M passes and (M-1) data transposition by the so-called row-column approach. With advantages of fewer recursive loops and no transposition memory, the proposed structures attain more accurate results and less power consumption than the existed ones, which are realized in the row-column approach. With regular and modular features, the proposed recursive M-D DCT structure is suitable for VLSI implementation.

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

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

M3 - Article

AN - SCOPUS:4344578213

VL - 3

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

SN - 0271-4310

ER -