CFP last date
20 March 2024
Reseach Article

Discrete Fourier Transform Analysis with Different Window Techniques Algorithm

by Bharti Thakur, Rajesh Mehra
International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 135 - Number 12
Year of Publication: 2016
Authors: Bharti Thakur, Rajesh Mehra
10.5120/ijca2016908525

Bharti Thakur, Rajesh Mehra . Discrete Fourier Transform Analysis with Different Window Techniques Algorithm. International Journal of Computer Applications. 135, 12 ( February 2016), 17-20. DOI=10.5120/ijca2016908525

@article{ 10.5120/ijca2016908525,
author = { Bharti Thakur, Rajesh Mehra },
title = { Discrete Fourier Transform Analysis with Different Window Techniques Algorithm },
journal = { International Journal of Computer Applications },
issue_date = { February 2016 },
volume = { 135 },
number = { 12 },
month = { February },
year = { 2016 },
issn = { 0975-8887 },
pages = { 17-20 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume135/number12/24100-2016908525/ },
doi = { 10.5120/ijca2016908525 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T23:35:36.114780+05:30
%A Bharti Thakur
%A Rajesh Mehra
%T Discrete Fourier Transform Analysis with Different Window Techniques Algorithm
%J International Journal of Computer Applications
%@ 0975-8887
%V 135
%N 12
%P 17-20
%D 2016
%I Foundation of Computer Science (FCS), NY, USA
Abstract

While designing the digital circuits in today’s world, the most desired factors are high performance, speed and cost. FFT is one of the most efficient ways to meet these requirements. In this paper, authors have discussed the DFT algorithm on periodic waveform using different window techniques using the FFT algorithm. This paper shows that the window techniques reduces the spectral leakage and a higher order DFT can be realized very easily using a lower order FFT. Different window techniques are used here on periodic waveforms and simulation is done using Matlab 2015.

References
  1. Rajesh Mehra, Pooja Kataria, ‘FPGA Based Area Efficient 64-point FFT Using MAC Algorithm’, International Journal of Electrical, Electronics and Telecommunication Engineering, vol.44, Issue.2 pp.1330-1337, ISSN: 2051-3240, october2013.
  2. Yazan Samir, Rozita Teymourzadeh “The Effect of the Digit Slicing Architecture on the FFT Butterfly” International Conference on Information Science, Signal Processing and Their Applications (ISSPA), pp.802-805, IEEE 2010.
  3. Xin Xiao, Erdal Oruklu and Jafar Saniie “Reduced Memory Architecture for CORDIC-based FFT” IEEE International Conference on Electronic Information Technology, pp.345-350, IEEE 2010.
  4. Yousri Ouerhani, Maher Jridi “Implementation Techniques of High-Order FFT into Low-Cost FPGA” International Midwest Symposium on Circuits and Systems (MWSCAS), pp.1-4, IEEE 2011.
  5. Earl E. Swartzlander, Hani H.M. Saleh “FFT Implementation with Fused Floating-Point Operations” IEEE Transaction On Computers, Volume No.61, Issue No.2, pp.312-317, February 2012.
  6. Muhammad Ahsan, Ehtsham Elahi, Waqas Ahmad Farooqi “Superscalar Power Efficient Fast Fourier Transform FFT Architecture” IEEE Transaction on Computers, Volume No.24, Issue No.31, pp.414-426, June 2011.
  7. Pooja Kataria, Rajesh Mehra, “Comparative Analysis of FFT Algorithm for different window techniques ” International Journal of Science, Engineering and Technology Research, volume 2, Issue 9, pp-1691-1695, September 2013
  8. Earl E. Swartzlander, Hani H.M. Saleh “FFT Implementation with Fused Floating-Point Operations” IEEE Transaction On Computers, Volume No.61, Issue No.2, pp.312-317, February 2012.
  9. Mathworks, “Users Guide Filter Design Toolbox 4”, 2007.
Index Terms

Computer Science
Information Sciences

Keywords

Fast Fourier Transform (FFT) Discrete Fourier Transform (DFT) Matlab.