首页> 外文期刊>IEEE transactions on circuits and systems . I , Regular papers >An Area Efficient 1024-Point Low Power Radix-22FFT Processor With Feed-Forward Multiple Delay Commutators
【24h】

An Area Efficient 1024-Point Low Power Radix-22FFT Processor With Feed-Forward Multiple Delay Commutators

机译:具有前馈多延迟换向器的面积有效的1024点低功耗Radix-2 2 FFT处理器

获取原文
获取原文并翻译 | 示例

摘要

Radix-n$2^{k}$ndelay feed-back and radix-K delay commutator are the most well-known pipeline architecture for FFT design. This paper proposes a novel radix-2n2nmultiple delay commutator architecture utilizing the advantages of the radix-2n2nalgorithm, such as simple butterflies and less memory requirement. Therefore, it is more hardware efficient when implementing parallelism for higher throughput using multiple delay commutators or feed-forward data paths. Here, we propose an improved input scheduling algorithm based upon memory to eliminate energy required to shift data along the delay lines. A 1024-point FFT processor with two parallel data paths is implemented in 65-nm CMOS process technology. The FFT processor occupies an area of 3.6 mmn2n, successfully operates in the supply voltage range from 0.4–1 V and the maximum clock frequency of 600 MHz. For low voltage, high performance applications, the processor is able to operate at 400 MHz and consumes 60.3 mW or 77.2 nJ/FFT generating 800 Msamples/s at 0.6 V supply.
机译:Radix-n <内联公式xmlns:mml =“ http://www.w3.org/1998/Math/MathML” xmlns:xlink =“ http://www.w3.org/1999/xlink”> $ 2 ^ {k} $ ndelay反馈和基数K延迟换向器是FFT设计中最著名的流水线架构。本文提出了一种新颖的基数2n 2 n多延迟换向器架构,利用基数2n的优点2nalgorithm,例如简单的蝴蝶和较少的内存需求。因此,使用多个延迟换向器或前馈数据路径实现更高吞吐量的并行性时,硬件效率更高。在这里,我们提出了一种基于存储器的改进的输入调度算法,以消除沿延迟线移动数据所需的能量。在65纳米CMOS工艺技术中实现了具有两个并行数据路径的1024点FFT处理器。 FFT处理器的面积为3.6 mmn 2 n,可以在0.4-1 V的电源电压范围内以及600 MHz的最大时钟频率下成功运行。对于低电压,高性能应用,该处理器能够以400 MHz的频率运行,消耗60.3 mW或77.2 nJ / FFT,并在0.6 V电源下产生800 Msamples / s。

著录项

相似文献

  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号