Title :
A fast input reordering algorithm for the discrete cosine transform
Author_Institution :
Dept. of Electr. Eng., Imperial Coll. of Sci., Technol. & Med., London, UK
Abstract :
The non-in-place input mapping and the subsequent bit-reversal stage, for the computation of the fast discrete cosine transform, are time and space consuming. A new fast in-place input reordering algorithm is proposed, which results in fewer data transfers by a factor of N , less storage requirements by a factor of N and a speedup of well over 30%. The actual speedup depends on the exact sequence length and on machine architecture and software
Keywords :
algorithm theory; discrete cosine transforms; data transfers; discrete cosine transform; fast input reordering algorithm; storage requirements; Application software; Biomedical imaging; Biomedical signal processing; Computer architecture; Discrete cosine transforms; Educational institutions; Fast Fourier transforms; Signal mapping; Signal processing algorithms; Space technology;
Conference_Titel :
Acoustics, Speech, and Signal Processing, 1992. ICASSP-92., 1992 IEEE International Conference on
Conference_Location :
San Francisco, CA
Print_ISBN :
0-7803-0532-9
DOI :
10.1109/ICASSP.1992.226660
