Fast discrete cosine transform algorithm for systolic arrays
Jonathan S. Ward, B.J. Stanier · Electronics Letters · 1983
A fast algorithm for an N-point discrete cosine transform (DCT) is derived from a 4N-point Winograd Fourier transform algorithm (WFTA). This algorithm, which has the same form as Winograd's Fourier transform and convolution algorithms, is suitable for a high-speed implementation using one-bit systolic arrays.