Skip to main content
Top

2019 | OriginalPaper | Chapter

Sliding Discrete Fourier Transform for 2D Signal Processing

Authors : Anita Kuchan, D. J. Tuptewar, Sayed Shoaib Anwar, Sachin P. Bandewar

Published in: Proceedings of the International Conference on ISMAC in Computational Vision and Bio-Engineering 2018 (ISMAC-CVB)

Publisher: Springer International Publishing

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

Discrete Fourier Transform (DFT) is the most frequently used method to determine the frequency contents of the digital signals. As DFT will take more time to implement, this paper gives the algorithm for the fast implementation of the DFT on the Two-Dimensional (2D) sliding windows. To fast implement DFT on the 2D sliding window, a 2D DFT (here 2D SDFT) algorithm is stated. The algorithm of the proposed 2D SDFT tries to compute current window’s DFT bins directly. It makes use of precalculated bins of earlier window. For a 2D input signal, sliding transform is being accelerated with the help of the proposed algorithm. The computational requirement of the said algorithm is found to be lowest among the existing ones. The output of discrete Fourier transform and sliding discrete Fourier transform algorithm at all pixel positions is observed to be mathematically equivalent

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

  • über 102.000 Bücher
  • über 537 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Maschinenbau + Werkstoffe
  • Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 390 Zeitschriften

aus folgenden Fachgebieten:

  • Automobil + Motoren
  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Elektrotechnik + Elektronik
  • Energie + Nachhaltigkeit
  • Maschinenbau + Werkstoffe




 

Jetzt Wissensvorsprung sichern!

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

  • über 67.000 Bücher
  • über 340 Zeitschriften

aus folgenden Fachgebieten:

  • Bauwesen + Immobilien
  • Business IT + Informatik
  • Finance + Banking
  • Management + Führung
  • Marketing + Vertrieb
  • Versicherung + Risiko




Jetzt Wissensvorsprung sichern!

Literature
1.
go back to reference Farhang-Boroujeny B, Gazor S (1994) Generalized sliding FFT and its application to implementation of block LMS adaptive filters. IEEE Trans Sig Process 42(3):532–538 Farhang-Boroujeny B, Gazor S (1994) Generalized sliding FFT and its application to implementation of block LMS adaptive filters. IEEE Trans Sig Process 42(3):532–538
3.
go back to reference Jacobsen E, Lyons R (2003) The sliding DFT. IEEE Sig Process Mag 20(2):74–80 Jacobsen E, Lyons R (2003) The sliding DFT. IEEE Sig Process Mag 20(2):74–80
4.
go back to reference Duda K (2010) Accurate, guaranteed stable, sliding discrete Fourier transform [DSP tips and tricks]. IEEE Sig Process Mag 27(6):124–127 Duda K (2010) Accurate, guaranteed stable, sliding discrete Fourier transform [DSP tips and tricks]. IEEE Sig Process Mag 27(6):124–127
5.
go back to reference Farhang-Boroujeny HB, Lim V (1992) A comment on the computational complexity of sliding FFT. IEEE Trans Circ Syst-II Analog Digital Sig Process 39(12):875–876 Farhang-Boroujeny HB, Lim V (1992) A comment on the computational complexity of sliding FFT. IEEE Trans Circ Syst-II Analog Digital Sig Process 39(12):875–876
6.
go back to reference Rosendo Maias JA, Exposito AG (1998) Efficient moving-window DFT algorithms. IEEE Trans Circ Syst -II: Analog Digital Sig Process 45(2):256–260 Rosendo Maias JA, Exposito AG (1998) Efficient moving-window DFT algorithms. IEEE Trans Circ Syst -II: Analog Digital Sig Process 45(2):256–260
7.
go back to reference Deng G, Ling A (1996) A running Walsh-Hadamard transform algorithm and its application to isotropic quadratic filter implementation. In: Proceedings of European signal processing conference (EUSIPCO) Deng G, Ling A (1996) A running Walsh-Hadamard transform algorithm and its application to isotropic quadratic filter implementation. In: Proceedings of European signal processing conference (EUSIPCO)
8.
go back to reference Mozafari B, Savoji MH (2007) An efficient recursive algorithm and an explicit formula for calculating update vectors of running Walsh Hadamard transform. In: Proceedings of IEEE 9th international symposium on signal processing and its applications (ISSPA) Mozafari B, Savoji MH (2007) An efficient recursive algorithm and an explicit formula for calculating update vectors of running Walsh Hadamard transform. In: Proceedings of IEEE 9th international symposium on signal processing and its applications (ISSPA)
9.
go back to reference Ben-Artzi G, Hel-Or H, Hel-Or Y (2007) The gray-code filter kernels. IEEE Trans Pattern Anal Mach Intell 29(3):382393CrossRef Ben-Artzi G, Hel-Or H, Hel-Or Y (2007) The gray-code filter kernels. IEEE Trans Pattern Anal Mach Intell 29(3):382393CrossRef
10.
go back to reference Ouyang W, Cham W-K (2010) Fast algorithm for Walsh Hadamard transform on sliding windows. IEEE Trans Pattern Anal Mach Intell 32(1):165–171 Ouyang W, Cham W-K (2010) Fast algorithm for Walsh Hadamard transform on sliding windows. IEEE Trans Pattern Anal Mach Intell 32(1):165–171
11.
go back to reference Jacobsen E, Lyons R (2004) An update to the sliding DFT. IEEE Signal Process Mag 21(1):110111CrossRef Jacobsen E, Lyons R (2004) An update to the sliding DFT. IEEE Signal Process Mag 21(1):110111CrossRef
12.
go back to reference Park C, Ko S (2014) The hopping discrete Fourier transform [sp tips and tricks]. IEEE Sig Process Mag 31(2):135–139 Park C, Ko S (2014) The hopping discrete Fourier transform [sp tips and tricks]. IEEE Sig Process Mag 31(2):135–139
13.
go back to reference Park C-S (2014) Recursive algorithm for sliding Walsh Hadamard transform. IEEE Trans Sig Process 62(11):28272836MathSciNet Park C-S (2014) Recursive algorithm for sliding Walsh Hadamard transform. IEEE Trans Sig Process 62(11):28272836MathSciNet
14.
go back to reference Banks K (2002) The Goertzel algorithm. Embed Syst Program Mag 15(9):3442 Banks K (2002) The Goertzel algorithm. Embed Syst Program Mag 15(9):3442
Metadata
Title
Sliding Discrete Fourier Transform for 2D Signal Processing
Authors
Anita Kuchan
D. J. Tuptewar
Sayed Shoaib Anwar
Sachin P. Bandewar
Copyright Year
2019
DOI
https://doi.org/10.1007/978-3-030-00665-5_126