A fast input reordering algorithm for the discrete cosine transform
Athanassios N. Skodras · 1992
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.>