A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
New 2/sup n/ discrete cosine transform algorithm using recursive filter structure
1995 International Conference on Acoustics, Speech, and Signal Processing
Preserved Fulltext
It is always desirable to look for more efficient algorithms for the realization of the discrete cosine transform (DCT). In this paper, we generalize a formulation for converting a lcngth-2" DCT into n groups of equations, then apply a novel technique for its implementation. The sizes of the groups are 2", for m = 11-1, .._., 0. While their structures are extremely regular. Tlie realization can then be converted into the simplest recursive filter form, which is of particularly simple for
doi:10.1109/icassp.1995.480445
dblp:conf/icassp/SiuCC95
fatcat:tgs63djtnbg6nogh2nrygv7mye