期刊文献+

3780点FFT处理器的算法研究

The Algorithm Study of the 3780-point FFT Processor
下载PDF
导出
摘要 提出了一种新的3780点FFT处理器的算法分解方式,该种分解方式能够减少一定的运算量和存储空间。同时采用了改进的同址顺序的素因子算法,运算量小,运算速度快,且程序结构规整,利于软、硬件实现。 This paper introduces a new decomposed way of algorithm in the design of a 3780-point FFT processor,which can reduce calculation complexity and storage space.It also adopts a modification prime factor algorithm which gives the output both in-place and in-order and saves operation and run time.In addition,the regular program structure of this proposed algorithm is more suitable for implementation in software and hardware.
出处 《中国传媒大学学报(自然科学版)》 2010年第4期21-24,共4页 Journal of Communication University of China:Science and Technology
关键词 3780点FFT 素因子算法 同址 顺序 3780-point FFT prime factor algorithm in-place in-order
  • 相关文献

参考文献4

  • 1Zhi - Xing Yang, Yu - Peng Hu, Chang - Yong Pan, Lin Yang. Design of a 3780 - point IFFT processor for TDS - OFDM [ J ] . IEEE Tran Broadcasting,2002,48 : 57 - 61.
  • 2RE布莱赫特.数字信号处理的快速算法[M].肖先赐,等,译.北京:科学出版社,1992.
  • 3Harvey F Silverman. An Introduction to Programming the Winograd Fourier Transform Algo- rithm(WFTA) [J]. IEEE Transactions On Acoustics, Speech, and Signal Processing, 1977, 25(2).
  • 4Sidney Burrus C, Eschenbacher P W. An In - Place, In - Order Prime Factor FFT Algorithm [ J]. IEEE Transactions on Acoustics, Speech, and Signal Processing, 1981,29 (4).

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部