A new proposed algorithm of arbitrary radix for the computation of the 2D DFT
Djamel Chikouche, Abdelghani Khellaf, Saad Bouguezel · International Journal for Numerical Methods in Engineering · 1999
In this paper, we propose a new approach for computing 2D FFT's that are suitable for implementation on a systolic array architecture. Our algorithm is derived in this paper from a Cooley decimation-in-time algorithm by using an appropriate indexing process. It is proved that the number of multiplications necessary to compute our proposed algorithm is significantly reduced while the number of additions remains almost identical to that of conventional 2D FFT's. Comparison results show the good performance of the proposed 2D FFT algorithm against the row-column FFT transform. Copyright © 1999 John Wiley & Sons, Ltd.