2D FFT without using 1D FFT A PREPRINT


Authors : Vamshi Kumar Kurva.

Volume/Issue : Volume 4 - 2019, Issue 6 - June

Google Scholar : https://goo.gl/DF9R4u

Scribd : https://bit.ly/2Xka20z

Abstract : FFT for multi-dimensional input is usually obtained by applying FFT on each dimension. FFT algorithm has an asymptotic complexity of O (N log N ). 2D FFT is especially important in the areas of image processing. Here we propose a new technique which can directly be applied on 2D image without using 1D FFT on rows and columns. It extends the concept of FFT to two dimensions. This too has an asymptotic complexity of O(N log N ).

Keywords : Fourier Transform, DFT, FFT, 2D-FFT.

FFT for multi-dimensional input is usually obtained by applying FFT on each dimension. FFT algorithm has an asymptotic complexity of O (N log N ). 2D FFT is especially important in the areas of image processing. Here we propose a new technique which can directly be applied on 2D image without using 1D FFT on rows and columns. It extends the concept of FFT to two dimensions. This too has an asymptotic complexity of O(N log N ).

Keywords : Fourier Transform, DFT, FFT, 2D-FFT.

Video Explanation for Published paper

Never miss an update from Papermashup

Get notified about the latest tutorials and downloads.

Subscribe by Email

Get alerts directly into your inbox after each post and stay updated.
Subscribe
OR

Subscribe by RSS

Add our RSS to your feedreader to get regular updates from us.
Subscribe