周国昌, 张立新. 基于RCSIMD的8192点FFT并行算法研究[J]. 微电子学与计算机, 2011, 28(4): 167-170,175.
引用本文: 周国昌, 张立新. 基于RCSIMD的8192点FFT并行算法研究[J]. 微电子学与计算机, 2011, 28(4): 167-170,175.
ZHOU Guo-chang, ZHANG Li-xin. Research of 8192 Point FFT Parallel Algorithm Based on RCSIMD[J]. Microelectronics & Computer, 2011, 28(4): 167-170,175.
Citation: ZHOU Guo-chang, ZHANG Li-xin. Research of 8192 Point FFT Parallel Algorithm Based on RCSIMD[J]. Microelectronics & Computer, 2011, 28(4): 167-170,175.

基于RCSIMD的8192点FFT并行算法研究

Research of 8192 Point FFT Parallel Algorithm Based on RCSIMD

  • 摘要: 文中提出了一种基于RCSIMD体系结构的8192点FFT的并行算法.该并行算法将8192数据分成连续64块, 每块128个连续数据 (存储在可重构处理元的局部存储器), 采用RCSIMD可重构处理阵列完成块倒位序变换, 块内只进行逻辑上的倒位序变换 (倒位序过程隐含在配置数据中).这种数据存储和倒位序处理方法可以充分利用处理阵列通信网络和处理单元的能力.

     

    Abstract: Based on researching of the parallel of FFT algorithm and combined with architecture characteristic of RCSIMD, one 8192 point FFT mapping algorithm is proposed in this paper.The mapping algorithm partitions 64 data blocks and each data block contains 128 sequential datum (being stored in local memory of RPU).Reconfigurable processing array (RPA) performs the shuffling and reordering operation for the data blocks and bit-reversed operations among of data block are not executed by data remove (being performed by the reconfiguration data).Performances of the communication networking and reconfigurable processing unit (RPU) can be exerted by this data storing schedule and bit-reversed method.

     

/

返回文章
返回