Parallel implementation of prime-factor discrete cosine transform on the orthogonal multiprocessor

The authors propose parallel implementation of prime-factor discrete cosine transform (DCT) on the orthogonal-multiprocessor (OMP) architecture when the transform size N can be decomposed into two mutually prime members N=N₁N ₂. The implementation shows that the existing prime-factor DCT algorithm can be mapped easily on the OMP architecture without modification. The proposed algorithms include input index mapping, summation, scaling, adjust rotation, and output index mapping. The time complexity of the algorithm is O(N₁+N₂ ) on a J processor OMP, where J is the maximum dimension of Winograd-Hartley scaling matrices