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...

पूर्ण विवरण

ग्रंथसूची विवरण

मुख्य लेखक:	Ahmed, Mohammed Kassim
स्वरूप:	थीसिस
भाषा:	अंग्रेज़ी
प्रकाशित:	2015
विषय:	Fourier transformations Field programmable gate arrays
ऑनलाइन पहुंच:	http://psasir.upm.edu.my/id/eprint/56225/1/FK%202015%2039.pdf