Comparison of Fourier transform algorithms with the help of ALGator system

Žiga Zorman (2017) Comparison of Fourier transform algorithms with the help of ALGator system. EngD thesis.

Preview

Abstract

At first we will explain the required mathematical knowledge which is crucial for the understanding of implemented algorithms in this thesis. Afterwards we will dive into five different implementations of Fourier transform and analyse their time complexity, number of complex additions and multiplications. Because of the integration in ALGator system all algorithms will be implemented in Java programming language. This system is intended to be used by the algorithm developers, because it offers very convenient implementation, effective testing and fast querying and analysis of the acquired results. We will compare decimation in time and decimation in frequency implementations of each algorithm and also its iterative and recursive forms. Testing data on which we will test our algorithms consist of the input data which needs to be transformed and correct transformation result. This way we will be able to verify the correctness of the algorithms as quickly as possible.

Item Type:

Thesis (EngD thesis)

Keywords:

Fourier transform, fast Fourier transform, discrete Fourier transform, complex numbers, N-th primitive root of unity, Bluestein's algorithm, radix-2, radix-4, split radix, ALGator

Number of Pages:

Language of Content:

Slovenian

Mentor / Comentors:

Name and Surname	ID	Function
doc. dr. Tomaž Dobravec	258	Mentor

Link to COBISS:

http://www.cobiss.si/scripts/cobiss?command=search&base=51012&select=(ID=1537378755)

Institution:

University of Ljubljana

Department:

Faculty of Computer and Information Science

Item ID:

3818

Date Deposited:

07 Mar 2017 09:13

Last Modified:

14 Mar 2017 10:49

URI:

http://eprints.fri.uni-lj.si/id/eprint/3818

Actions (login required)

View Item