Κατεύθυνση Ηλεκτρονικός Αυτοματισμός (Η/Α, με πρόσθετη εξειδίκευση στην Πληροφορική και στα πληροφοριακά συστήματα)
Library of the School of Science

2018-10-01

2018

Tzimas-Liosatos Georgios

Διονύσιος Ρεΐσης, Αναπληρωτής Καθηγητής, Φυσικής, ΕΚΠΑ

Παράλληλη Επεξεργασία Fourier για βάσεις δυνάμεις του 2

English
Greek

Parallel Fourier Computation for power of 2 radices

Fast Fourier Transform (FFT) is an algorithm for the efficient computation of Discreate Fourier Transform (DFT).
FFT converts a signal from time domain to a representation in the frequency domain and vice versa, achieving computational complexity of O(N\log{N}), instead of Ο(Ν^2) of the DFT.
This thesis presents an in-place addressing technique with parallel memory accessing without using intermediate stages of storing and loading.
This technique permutes the data tuples at storing, achieving small space complexity for memory and address generation circuit.
It can implements architectures supporting continuous flow of data, for single-radices and mixed-radices.
The resulting architectures, of the addressing technique, were designed in register-transfer level in VHDL, implemented for FPGA and finally they were tested using the appropriate simulation tools.

Science

Fourier, FFT, VHDL, FPGA

Yes

2

Yes

13

89

File access is restricted only to the intranet of UoA.

https://pergamos.lib.uoa.gr/uoa/dl/object/2800180