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: | |
|---|---|
| Format: | Thesis |
| Language: | English |
| Published: |
2015
|
| Subjects: | |
| Online Access: | http://psasir.upm.edu.my/id/eprint/56225/1/FK%202015%2039.pdf http://psasir.upm.edu.my/id/eprint/56225/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|