N. I. Cho and S. U. Lee (1991) proposed a fast algorithm for 2-D N*N DCT, where N=2/sup m/. It requires only half the number of multiplications of the conventional row-column approach. However, the signal flow graph for the postaddition stage seems very complicated and the order of the output index is seemingly irregular, because the postaddition stage was not based on the mathematical expressions. Consequently, derivation of the signal flow graph becomes complicated as the transform size increases. Systematic expressions for the postaddition stage of the algorithm that enable any N*N DCT to be implemented in a straightforward manner are provided here. The results show that the signal flow graph from input to output has a recursive structure in which the structure for smaller N reappears for larger N. However, the number of additions increases in the new signal flow graph at the expense of improving the regularity in the structure. >
[1]
Hsieh S. Hou.
A fast recursive algorithm for computing the discrete cosine transform
,
1987,
IEEE Trans. Acoust. Speech Signal Process..
[2]
Pierre Duhamel,et al.
Polynomial transform computation of the 2-D DCT
,
1990,
International Conference on Acoustics, Speech, and Signal Processing.
[3]
N. Cho,et al.
Fast algorithm and implementation of 2-D discrete cosine transform
,
1991
.
[4]
Ephraim Feig,et al.
New scaled DCT algorithms for fused multiply/add architectures
,
1991,
[Proceedings] ICASSP 91: 1991 International Conference on Acoustics, Speech, and Signal Processing.