无存储访问冲突的基2×K并行FFT架构
Parallel Radix-2×K FFT Architecture with Conflict-Free Parallel Memory Accessing
-
摘要: 提出了一种无存储访问冲突的基2×K并行FFT架构.该架构通过并行地址产生算法,使K个基2蝶形运算单元同时读取或写入所需的2 K个操作数,达到平均每周期完成K个基2蝶式运算的处理能力.与已有的并行FFT架构相比,新架构地址产生电路简单,并且对于不同的K值,并行地址产生模块结构相同.在资源消耗方面,不考虑旋转因子,N点FFT处理器只需要3 N/2个存储单元.Abstract: Parallel Radix-2×K FFT processing architecture,which can achieve conflict-free parallel memory access,are proposed.According to the conflict-free memory access algorithm,K2-radix butterfly can realize parallel accessing 2 K operands,and the processing speed of FFT was improved Ktimes.Compare with other parallel FFT architecture,the parallel address produce module of the innovative architecture is uniform,so the architecture has good scalability.
下载:
