An efficient radix-two algorithm to compute the 2D Fourier transform
Djamel Chikouche, Nourredine Amardjia, R.E. Bekka · 2005
Abstract:- In this paper, we propose a new approach for computing 2D FFT's that are suitable for implementation on a systolic array architectures. 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 shows the powerful performance of the new 2D FFT algorithm against the row-column FFT transform