A novel systolic array implementation of DCT, DWT and DFT

A novel systolic array architecture for computing discrete orthogonal transforms (such as the discrete cosine transform (DCT), the discrete W transform (DWT), or the discrete Fourier transform (DFT)) is proposed. The systolic algorithm is based on the FFCT proposed by Vetterli and Nussbaumer (1984) and the recursive equation of trigonometric functions. The author presents the processing elements based on a special butterfly computation and describes the systolic array implementations for computing DCT, DWT and DFT respectively. All these computations can be fulfilled in the real domain. It is argued that because of a high degree of simplicity, regularity, suitability and concurrency inherent to these designs, their VLSI implementation will be cost effective.<>