| 大规模FFT并行计算中2维SRAM的设计 |
| |
| 作者姓名： | 王润泽 王颖 杨栋毅 |
| |
| 作者单位： | 中国科学院研究生院计算与通信工程学院，北京 100049 |
| |
| 摘 要： | FFT速度的提高是数字信号处理领域中的核心问题，并行流水计算是实现大规模FFT高速计算的基本技术。在分析了基2时间抽取算法并行计算时输入数据的地址特性后，本文提出了2维SRAM的设计，它突破了并行计算N点FFT时普通SRAM地址非线性变化的瓶颈，达到 个蝶形单元并行流畅读写计算数据的目的，并使得数据地址数量变少，生成简单。本文对一个8×8字单元，每个字16比特的2维SRAM进行设计仿真，可以验证其功能正确。
|
| 关 键 词： | FFT 基2 时间抽取算法 2维SRAM 并行计算 |
The Design of a Two-dimension SRAM for Parallel Computing of Large Scale FFT |
| |
| Authors: | Wang Run-ze Wang Ying Yang Dong-yi |
| |
| Institution: | College of Computing and Communication Engineering, Graduate University of Chinese Academy of Sciences, Beijing 100049, China |
| |
| Abstract: | 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. 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. |
| |
| Keywords: | |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |
