An efficient systolic array design for the discrete sine transform
E. Ramakrishnan, Nam Ling · 2002
A two-dimensional systolic array is designed for the 1-D Discrete Sine Transform (DST). The implementation of the DST is carried out by defining the 1-D DST in terms of the Discrete Fourier Transform (DFT). A 1-D array is initially designed for the DFT by utilizing Goertzel's algorithm which requires N processors with a computation time of O(N). The 1-D array for the DST is designed by adding additional computational elements to the 1-D DFT array. A 2-D array for the DST is designed by partitioning the indices of the input data. The 2-D array achieves a speedup of O(/spl radic/N) for the N-point DST when compared to the computation time for the 1-D systolic array without increasing the number of processors.>