Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length

Che‐Hong Chen

doi:10.1109/TCSI.2005.852935

Return

Condensed recursive structures for computing multidimensional DCT/IDCT with arbitrary length

2005-09-01

PRE

Che‐Hong Chen

Bin-Da Liu

Jar‐Ferr Yang

DOI：10.1109/TCSI.2005.852935

Original

Original request for help

Save

Abstract

En 中文

In this paper, efficient recursive structures for computing arbitrary length M-dimensional (M-D) discrete cosine transform (DCT) and its inverse DCT (IDCT) are proposed. The M-D DCT and IDCT are first converted into condensed one-dimensional (1-D) DCT and discrete sine transform (DST) with a regular preprocessing procedure. The recursive filters for condensed 1-D DCT/DST are then derived by using Chebyshev polynomials to compute M-D DCT/IDCT without data transposition. The proposed structures require fewer recursive loops than 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 traditional row-column structures. The proposed recursive M-D DCT/IDCT structures are suitable for very large-scale integration implementation due to regular and modular features.

Keywords:

discrete cosine transform (DCT)

fast algorithm

inverse DCT (IDCT)

multidimensional signal processing

recursive structure

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.