期刊文献+

大规模FFT并行计算中二维SRAM的设计 被引量:3

The design of a two-dimension SRAM for parallel computing of large scale FFT
在线阅读 下载PDF
导出
摘要 FFT速度的提高是数字信号处理领域中的核心问题,并行流水计算是实现大规模FFT高速计算的基本技术.在分析了基二时间抽取算法并行计算时输入数据的地址特性后,提出了二维SRAM的设计,它突破了并行计算N点FFT时普通SRAM地址非线性变化的瓶颈,达到N个蝶形单元并行流畅读写计算数据的目的,并使得数据地址数量变少,生成简单.对一个8×8字单元,每个字16bit的二维SRAM进行设计仿真,可以验证其功能正确. The increase of FFT computing speed is the main subject in the realm of digital signal processing. Parallel computing and pipeline structure are the basic technologies to achieve high speed of large scale FFT computing. After analyzing the address of computing data in radix-2 decimation-in-time FFT algorithm, we design a two-dimension SRAM. The non-linear changing of data address, which is the bottleneck when using normal SRAM to compute an N-point FFT, can be removed. √N butterfly units in FFT can compute fluently in parallel. The amount of simplified data address can be decreased largely. An 8 by 8 words, 16 bits word length, two-dimension SRAM is designed and simulated, the function is verified .
出处 《中国科学院研究生院学报》 CAS CSCD 2008年第1期123-128,共6页 Journal of the Graduate School of the Chinese Academy of Sciences
关键词 FFT 基二时间抽取算法 二维SRAM 并行计算 FFT, radix-2 decimation-in-time FFT algorithm, two-dimension SRAM, parallel computing
  • 相关文献

参考文献8

  • 1James W Cooley,John W Tukey.An algorithm for the machine calculation of complex Fourier series.Math Computer,1965,19:297 - 301.
  • 2Bevan M Baas.An approach to low-power,high-performance,fast Fourier transform processor design:[Ph.D Thesis].USA:Stanford University,1999.
  • 3Pease MC.Organization of large scale fourier processors.J Assoc Comput,1969,16:474 - 482.
  • 4Ma Y.An effective memory addressing scheme for FFT processors.IEEE Transactions on Signal Processing,1999,47:907 - 911.
  • 5Ma Y,Wanhammar L.A hardware efficient control of memory addressing for high-performance FFT processors.IEEE Transactions on Signal Processing,2000,48:917 - 921.
  • 6谢应科,付博.数据全并行FFT处理器的设计[J].计算机研究与发展,2004,41(6):1022-1029. 被引量:7
  • 7刘劲,杨平华.PC—Cluster下的FFT并行算法分析[J].工程地球物理学报,2006,3(2):130-136. 被引量:2
  • 8高宁,施亮,侯卫华,于宗光.用于SRAM的低功耗位线结构[J].半导体技术,2006,31(12):935-937. 被引量:1

二级参考文献20

  • 1马余泰.FFT处理器无冲突地址生成方法[J].计算机学报,1995,18(11):875-880. 被引量:10
  • 2E Bidet, D Castelain, C Joanblanq, et al. A fast single-chip implementation of 8192 complex point FFT. IEEE Journal of Solid-State Circuits, 1995, 30(3): 300~305
  • 3Bevan M Baas. A low-power, high-performace, 1024-point FFT processor. IEEE Journal of Solid-State Circuits, 1999, 34 (3):380~ 387
  • 4J W Cooley, J W Tukey. An algorithm for the machine calculation of complex Fourier-series. Math Computer, 1965, 19:297~301
  • 5G L DeMuth. Algorithms for defining mixed radix FFT flow graphs. IEEE Trans on Acoustics, Speech and Signal Processing,1989, 37(9): 1349~1358
  • 6D Cohen. Simplified control of FFT hardware. IEEE Trans on Acoustics, Speech, Signal Processing, 1976, 24(12): 577~579
  • 7Marshall C Pease. Organization of large scale Fourier processors. J ACM, 1969, 16(3): 474~482
  • 8Bhabani P Sinha, Jayasree Dattagupta, Asish Sen. A cost effective FFT processor using memory segmentation. IEEE 1983 ISCAS,Newport Beach, CA, 1983
  • 9Yutai Ma. An effective memory addressing scheme for FFT processors. IEEE Trans on Signal Processing, 1999, 47(3): 907~911
  • 10Xie Yingke, Hou Zifeng, Han Chengde. A parallel conflict-free memory accessing for FFT algorithm. In: Proc of the 3rd Workshop on Advanced Parallel Processing Technologies. Beijing:Publishing House of Electronics Industry, 1999. 137~141

共引文献7

同被引文献27

引证文献3

二级引证文献5

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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