Abstract
A new fast algorithm is presented for multidimensional DFT in this paper. This algorithm is derived based on an interesting coding technique for multidimensional integral point, named the technique vector coding. And called the algorithm VCFFT (vector coding fast Fourier transform). Since the VC-FFT is the extension of Cooley-Tukey algorithm from one-dimensional to multidimensional, its structure of program is simple as Cooley-Tukey FFT, and significantly reduces multiplications and recursive stages.
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.
