Design and implementation of real data fast fourier transform processor on field programmable gates array
The Fast Fourier Transform (FFT) is an efficient method to achieve the Discrete Fourier Transform (DFT) with less number of operations. FFT utilizes the symmetry property in the DFT to calculate the output. For input length of N=2m, FFT requires only Nlog2N multiplications instead of the N2 multipli...
Saved in:
Main Author: | Ahmed, Mohammed Kassim |
---|---|
Format: | Thesis |
Language: | English |
Published: |
2015
|
Online Access: | http://psasir.upm.edu.my/id/eprint/56225/1/FK%202015%2039RR.pdf http://psasir.upm.edu.my/id/eprint/56225/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Fast fourier transform processor implementation for high inputs on field programmable gates array
by: Ali Abbas, Zaid
Published: (2018) -
Fast fourier transform module for implementation in Nios II embedded processor
by: Ahmed, Hisham Azhari
Published: (2008) -
Design of an advanced encryption standard crypto-processor core for field programmable gate array implementation
by: Ismail, Mohd. Izuan
Published: (2006) -
Design and implementation of 16 bit DSP core processor using field programmable gate array (FPGA)
by: Abdul Rahman, Abdul Aziz
Published: (2003) -
Pipelined fast Fourier transform (FFT) processor power optimization
by: Mohd Hassan, Siti Lailatul, et al.
Published: (2019)