Pipeline processor for fast architecture oriented regular DCT-IDCT algorithm
David Akopian, Jaakko T. Astola · 2002
New architecture oriented regular algorithms are proposed for the discrete cosine transform (DCT), used in DSP problems, with a simple data shuffling pattern similar to the Cooley-Tukey FFT algorithm. One can easily extend many of parallel FFT approaches for these algorithms. The only pipeline structure with logN-1 arithmetic units and transform time of order O(N) is considered. It is simpler than the known pipeline structures.