Abstract
In this paper, we propose a new approach for computing multidimensional Cooley-Tukey FFT‘s that is suitable for implementation on a variety of multiprocessor architectures. Our algorithm is derived in this paper from a Cooley decimation-in-time algorithm by using an appropriate indexing process and the tensor product properties. 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 Multidimensional FFT‘s (MFFT). Comparison results show the powerful performance of the proposed MFFT algorithm against the row-column FFT transform when data dimension M is large. Furthermore, this algorithm, presented in a simple matrix form, will be much easier to implement in practice. Connections of the proposed approach with well-known DFT algorithms are included in this paper and many variations of the proposed algorithm are also pointed out.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
