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:
| 主要作者: | |
|---|---|
| 格式: | Thesis |
| 语言: | English |
| 出版: |
2015
|
| 主题: | |
| 在线阅读: | http://psasir.upm.edu.my/id/eprint/56225/1/FK%202015%2039.pdf http://psasir.upm.edu.my/id/eprint/56225/ |
| 标签: |
添加标签
没有标签, 成为第一个标记此记录!
|