Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code

Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code

Citation Author(s):
Tiago Davi
Curi Busarello
Federal University of Santa Catarina
Submitted by:
Tiago Davi Curi...
Last updated:
Mon, 07/15/2019 - 16:00
DOI:
10.21227/nq40-z057
Data Format:
Links:
License:
Dataset Views:
87
Share / Embed Cite

CATEGORIES

KEYWORDS

Abstract: 

The DFT and FFT are used mainly to obtain the amplitude of a harmonic component from a periodic signal containing several harmonics. For instance, it is desired to know the 180 Hz harmonic amplitude from a signal. Then, the DFT and FFT are the best choices to do that.

This report presents how to implement DFT and FFT by means of simplified blocks, which are sine, cosine, sum, square, etc. It is easy to find on the internet the DFT and FFT performed in C-code. Actually, the DFT and FFT are almost always performed in C-code mainly because its modularity. However, DFT and FFT in C-code are exhaustive for those who want to learn how the DFT and FFT work. Here, the objective is to present a step-by-step way to implement DFT and FFT. An 8-point DFT and FFT is presented using simplified blocks.

The simulation used in this report is freely available on http://busarello.prof.ufsc.br/

Instructions: 

See the attached file.

Dataset Files

You must be an IEEE Dataport Subscriber to access these files. Login or subscribe now. Sign up to be a Beta Tester and receive a coupon code for a free subscription to IEEE DataPort!

Embed this dataset on another website

Copy and paste the HTML code below to embed your dataset:

Share via email or social media

Click the buttons below:

facebooktwittermailshare
[1] Tiago Davi Curi Busarello, "Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code", IEEE Dataport, 2019. [Online]. Available: http://dx.doi.org/10.21227/nq40-z057. Accessed: Aug. 24, 2019.
@data{nq40-z057-19,
doi = {10.21227/nq40-z057},
url = {http://dx.doi.org/10.21227/nq40-z057},
author = {Tiago Davi Curi Busarello },
publisher = {IEEE Dataport},
title = {Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code},
year = {2019} }
TY - DATA
T1 - Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code
AU - Tiago Davi Curi Busarello
PY - 2019
PB - IEEE Dataport
UR - 10.21227/nq40-z057
ER -
Tiago Davi Curi Busarello. (2019). Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code. IEEE Dataport. http://dx.doi.org/10.21227/nq40-z057
Tiago Davi Curi Busarello, 2019. Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code. Available at: http://dx.doi.org/10.21227/nq40-z057.
Tiago Davi Curi Busarello. (2019). "Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code." Web.
1. Tiago Davi Curi Busarello. Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code [Internet]. IEEE Dataport; 2019. Available from : http://dx.doi.org/10.21227/nq40-z057
Tiago Davi Curi Busarello. "Understanding Discrete Fourier Transform (DFT) and Fast Fourier Transform (FFT). Simulation and Digital Implementation by means of blocks, not C-code." doi: 10.21227/nq40-z057