Relationship between two algorithms for discrete cosine transform |
| |
Authors: | Wang Z. Jullien G.A. |
| |
Affiliation: | VLSI Res. Group, Windsor Univ., Ont., Canada; |
| |
Abstract: | ![]() Two contributions are made to the implementation of fast discrete cosine transform algorithms. The first uses Hadamard ordering to improve the regularity of the Lee fast cosine transform (FCT) algorithm for the discrete cosine transform (DCT). The second derives a close relationship between the Lee FCT and the recursive algorithm for the DCT.<> |
| |
Keywords: | |
|
|