Recursive algorithm for the realization of the discrete cosine transform

Lap Pui Chau; Wan Chi Siu

doi:10.1109/ISCAS.2000.857488

Recursive algorithm for the realization of the discrete cosine transform

Lap Pui Chau, Wan Chi Siu

The Hong Kong Polytechnic University

Research output: Journal article publication › Conference article › Academic research › peer-review

3 Citations (Scopus)

Abstract

Recursive algorithms have been found very effective for the realization using software and VLSI techniques. Recently, some recursive algorithms have been proposed for the realization of the discrete cosine transform (DCT). In this paper, an efficient recursive algorithm for the computation of the discrete cosine transform is proposed. By using some appropriate iterative techniques, the formulation of the arbitrary length forward discrete cosine transform (FDCT) and inverse discrete cosine transform (IDCT) can be effectively implemented by recursive equations, and the hardware complexity is further reduced as compared to approaches in the literature. The proposed algorithm is suitable for both software and VLSI implementations.

Original language	English
Pages (from-to)	V-529-V-532
Journal	Proceedings - IEEE International Symposium on Circuits and Systems
Volume	5
DOIs	https://doi.org/10.1109/ISCAS.2000.857488
Publication status	Published - May 2000
Event	Proceedings of the IEEE 2000 International Symposium on Circuits and Systems, ISCAS 2000 - Geneva, Switz, Switzerland Duration: 28 May 2000 → 31 May 2000

ASJC Scopus subject areas

Electrical and Electronic Engineering

More information

10.1109/ISCAS.2000.857488

Cite this

@article{1221c5262d39441c80e23288a2191c85,

title = "Recursive algorithm for the realization of the discrete cosine transform",

abstract = "Recursive algorithms have been found very effective for the realization using software and VLSI techniques. Recently, some recursive algorithms have been proposed for the realization of the discrete cosine transform (DCT). In this paper, an efficient recursive algorithm for the computation of the discrete cosine transform is proposed. By using some appropriate iterative techniques, the formulation of the arbitrary length forward discrete cosine transform (FDCT) and inverse discrete cosine transform (IDCT) can be effectively implemented by recursive equations, and the hardware complexity is further reduced as compared to approaches in the literature. The proposed algorithm is suitable for both software and VLSI implementations.",

author = "Chau, {Lap Pui} and Siu, {Wan Chi}",

year = "2000",

month = may,

doi = "10.1109/ISCAS.2000.857488",

language = "English",

volume = "5",

pages = "V--529--V--532",

journal = "Proceedings - IEEE International Symposium on Circuits and Systems",

issn = "0271-4310",

publisher = "IEEE",

note = "Proceedings of the IEEE 2000 International Symposium on Circuits and Systems, ISCAS 2000 ; Conference date: 28-05-2000 Through 31-05-2000",

}

TY - JOUR

T1 - Recursive algorithm for the realization of the discrete cosine transform

AU - Chau, Lap Pui

AU - Siu, Wan Chi

PY - 2000/5

Y1 - 2000/5

N2 - Recursive algorithms have been found very effective for the realization using software and VLSI techniques. Recently, some recursive algorithms have been proposed for the realization of the discrete cosine transform (DCT). In this paper, an efficient recursive algorithm for the computation of the discrete cosine transform is proposed. By using some appropriate iterative techniques, the formulation of the arbitrary length forward discrete cosine transform (FDCT) and inverse discrete cosine transform (IDCT) can be effectively implemented by recursive equations, and the hardware complexity is further reduced as compared to approaches in the literature. The proposed algorithm is suitable for both software and VLSI implementations.

AB - Recursive algorithms have been found very effective for the realization using software and VLSI techniques. Recently, some recursive algorithms have been proposed for the realization of the discrete cosine transform (DCT). In this paper, an efficient recursive algorithm for the computation of the discrete cosine transform is proposed. By using some appropriate iterative techniques, the formulation of the arbitrary length forward discrete cosine transform (FDCT) and inverse discrete cosine transform (IDCT) can be effectively implemented by recursive equations, and the hardware complexity is further reduced as compared to approaches in the literature. The proposed algorithm is suitable for both software and VLSI implementations.

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

U2 - 10.1109/ISCAS.2000.857488

DO - 10.1109/ISCAS.2000.857488

M3 - Conference article

AN - SCOPUS:0033699309

SN - 0271-4310

VL - 5

SP - V-529-V-532

JO - Proceedings - IEEE International Symposium on Circuits and Systems

JF - Proceedings - IEEE International Symposium on Circuits and Systems

T2 - Proceedings of the IEEE 2000 International Symposium on Circuits and Systems, ISCAS 2000

Y2 - 28 May 2000 through 31 May 2000

ER -

Recursive algorithm for the realization of the discrete cosine transform

Abstract

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this