prikaz prve stranice dokumenta Programiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala
Access restricted to students and staff of home institution
undergraduate thesis
Programiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala
2021. urn:nbn:hr:179:720945
Batinić, Gordana
University of Split
Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture
Department of Electronics and Computing

Cite this document

Batinić, G. (2021). Programiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala (Undergraduate thesis). Retrieved from https://urn.nsk.hr/urn:nbn:hr:179:720945

Batinić, Gordana. "Programiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala." Undergraduate thesis, University of Split, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, 2021. https://urn.nsk.hr/urn:nbn:hr:179:720945

Batinić, Gordana. "Programiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala." Undergraduate thesis, University of Split, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, 2021. https://urn.nsk.hr/urn:nbn:hr:179:720945

Batinić, G. (2021). 'Programiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala', Undergraduate thesis, University of Split, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, accessed 31 March 2023, https://urn.nsk.hr/urn:nbn:hr:179:720945

Batinić G. Programiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala [Undergraduate thesis]. Split: University of Split, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture; 2021 [cited 2023 March 31] Available at: https://urn.nsk.hr/urn:nbn:hr:179:720945

G. Batinić, "Programiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala", Undergraduate thesis, University of Split, Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture, Split, 2021. Available at: https://urn.nsk.hr/urn:nbn:hr:179:720945

Please login to the repository to save this object to your list.
Metadata
TitleProgramiranje algoritma brze Fourierove transformacije (FFT) i primjena u frekvencijskoj analizi diskretnih signala
Title (english)Programming of the fast Fourier transformation (FFT) algorithm and it’s applications in frequency analysis of discrete signals
AuthorGordana Batinić
MentorTamara Grujić (mentor)
GranterUniversity of Split
Faculty of Electrical Engineering, Mechanical Engineering and Naval Architecture
(Department of Electronics and Computing)
Split
Defense date and country2021-09-17, Croatia
Scientific / art field,
discipline and subdiscipline		TECHNICAL SCIENCES
Computing
Abstract
U današnjem vremenu gotovo je nemoguće zamisliti život bez tehnologije, kao i samu tehnologiju bez brze Fourierove transformacije (FFT-a). Od GPS-a, obrade signala pa do množenja polinoma velikih stupnjeva (odnosno, konvolucije), FFT se pronalazi u različitim područjima znanosti, stoga je tema ovog rada algoritam brze Fourierove transformacije i njegova implementacija. Osim toga, predstavljaju se pojmovi koji upotpunjuju razumijevanje algoritma, kao i sam postupak kojim se dolazi do navedenog algoritma. Također je predstavljena razlika između klasične implementacije DFT-a i brze Fourierove transformacje. Dan je C++ kod za računanje FFT-a i na primjerima je objašnjeno izvršavanje algoritma. Ovim radom se nastoji predstaviti značaj kao i korisnost brze Fourierove transformacije.
Abstract (english)
In today’s day and age, it’s almost impossible to imagine our lives without technology, but even more so technology as we know it without the fast Fourier transform (FFT). From GPS, signal processing, to large polynomial multiplication (convolution), FFT can be found in many aplications throughout different fields of science, which is why the premise of this work is the fast Fourier transform algorithm and it’s applications. Besides the algorithm, this work encompasses the terms and concepts associated with the FFT, as well as the steps needed to develop the algorithm. In addition to that, the difference between the DFT and FFT is demonstrated through an example. A C++ program is provided which calculates the FFT on some given examples. The idea of this work is to present the utility and importance of the FFT algorithm.
Keywords
Keywords (english)
Languagecroatian
URN:NBNurn:nbn:hr:179:720945
Study programmeTitle: Computing
Study programme type: university
Study level: undergraduate
Academic / professional title: sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva (sveučilišni/a prvostupnik/ prvostupnica (baccalaureus/baccalaurea) inženjer/inženjerka računarstva)
Type of resourceText
File originBorn digital
Access conditionsAccess restricted to students and staff of home institution
Terms of useLicence In copyright icon
Created on2021-12-02 09:06:08