Index mapping for prime factor algorithm of discretecosine transform
Guoan Bi · Electronics Letters · 1999
Prime factor fast algorithms are computationally efficient for various discrete transforms. However, they generally need an index mapping process to convert a one-dimensional input sequence into a two-dimensional array, which results in a substantial computational overhead and an irregular computational structure. The author attempts to minimise the computational overhead by a simple and general mapping procedure.