A Refined Fast 2-D Discrete Cosine Transform Algorithm
Resource
IEEE Trans. on Signal Processing, vol.47, No.3, pp.904-907
Journal
IEEE Trans. on Signal Processing
Journal Volume
vol.47
Journal Issue
No.3
Pages
904-907
Date Issued
1999-03
Date
1999-03
Author(s)
Huang, Y.M.
Abstract
In this correspondence, an index permutation-based fast two-dimensional discrete cosine transform (2-D DCT) algorithm is presented. It is shown that the N × N 2-D DCT, where N = 2m, can be computed using only N 1-D DCT's and some post additions. Index Terms - Discrete cosine transform, fast algorithms, index permutation. © 1999 IEEE.
Other Subjects
Algorithms; Computational complexity; Cosine transforms; Discrete cosine transforms (DCT); Digital signal processing
Type
journal article