Prime factor algorithm of discrete cosine transform

Prime factor fast algorithms are computationally efficient for various discrete transforms. However, they generally need an index mapping process to convert one-dimensional input sequence into a two-dimensional array, which results in a substantially computational overhead and an irregular computational structure. This letter attempts to minimize the computation overhead by a simple and general mapping procedure.