Efficient input-reordering algorithms for fast DCT
作者： A.N. Skodras , A.G. Constantinides
DOI: 10.1049/EL:19911222
关键词:
摘要: The non-in-place input mapping and the subsequent bit-reversal stage for computation of fast discrete cosine transform (DCT) are studied. redundancies associated with these algorithms identified three reordering proposed. These new result in fewer data transfers by a factor N, reduced storage requirements N/2 an average speed increase 37%.
harvard.edu
sci-hub.se 参考文章(5)
Vladimir Britanak, Patrick Yip, K. R. Rao, Discrete Cosine Transform: Algorithms, Advantages, Applications ,(1990)
Hou, The Fast Hartley Transform Algorithm IEEE Transactions on Computers. ,vol. 36, pp. 147- 156 ,(1987) , 10.1109/TC.1987.1676877
M. Narasimha, A. Peterson, On the Computation of the Discrete Cosine Transform IEEE Transactions on Communications. ,vol. 26, pp. 934- 936 ,(1978) , 10.1109/TCOM.1978.1094144
D.M.W. Evans, A second improved digit-reversal permutation algorithm for fast transforms IEEE Transactions on Acoustics, Speech, and Signal Processing. ,vol. 37, pp. 1288- 1291 ,(1989) , 10.1109/29.31278
R.R. Oehler, M.W. Blasgen, IBM RISC System/6000: architecture and performance IEEE Micro. ,vol. 11, pp. 14- 17 ,(1991) , 10.1109/40.87565