On computing 2-D systolic algorithm for discrete cosine transform
M.H. Lee · IEEE Transactions on Circuits and Systems · 1990
A 2-D systolic array algorithm for the discrete cosine transform (DCT) is presented. It is based on the inverse discrete Fourier transform (DFT) version of the Goertzel algorithm via Horner's rule. This array requires N cells and multipliers, takes square root N+2 clock cycles to produce a complete N-point DCT, and is able to process a continuous stream of data sequences.>