首页> 外文学位 >An approach to low-power, high-performance, fast Fourier transform processor design.
【24h】

An approach to low-power, high-performance, fast Fourier transform processor design.

机译:一种低功耗,高性能,快速傅立叶变换处理器设计的方法。

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

摘要

The Fast Fourier Transform (FFT) is one of the most widely used digital signal processing algorithms. While advances in semiconductor processing technology have enabled the performance and integration of FFT processors to increase steadily, these advances have also caused the power consumed by processors to increase as well. This power increase has resulted in a situation where the number of potential FFT applications limited by maximum power budgets—not performance—is significant and growing.; We present the cached-FFT algorithm which explicitly caches data from main memory using a much smaller and faster memory. This approach facilitates increased performance and, by reducing communication energy, increased energy-efficiency.; Spiffee is a 1024-point, single-chip, 460,000-transistor, 40-bit complex FFT processor designed to operate at very low supply voltages. It employs the cached-FFT algorithm which enables the design of a well-balanced, nine-stage pipeline. The processor calculates a complex radix-2 butterfly every cycle and contains unique hierarchical-bitline SRAM and ROM memories which operate well in both standard and low supply voltage, low threshold-voltage environments. The processor's substrate and well nodes are connected to chip pads, accessible for biasing to adjust transistor thresholds.; Spiffee has been fabricated in a standard 0.7 μm (Lpoly = 0.6 μm) CMOS process and is fully functional on its first fabrication. At a supply voltage of 1.1 V, Spiffee calculates a 1024-point complex FFT in 330 μsec, while dissipating 9.5 mW—resulting in an adjusted energy-efficiency more than 16 times greater than that of the previously most efficient FFT processor. At a supply voltage of 3.3 V, it operates at 173 MHz—a clock rate 2.6 times faster than the previously fastest.
机译:快速傅立叶变换(FFT)是使用最广泛的数字信号处理算法之一。半导体处理技术的进步使FFT处理器的性能和集成度稳步提高,但这些进步也导致处理器消耗的功率也随之增加。功率的增加导致了这样一种情况,即潜在的FFT应用的数量受到最大功率预算(而不是性能)的限制,并且这种数量在不断增长。我们提出了 cached-FFT 算法,该算法使用更小,更快的内存显式缓存来自主内存的数据。这种方法有助于提高性能,并通过减少通信能量来提高能效。 Spiffee 是一个1024点,单芯片,460,000晶体管,40位复数FFT处理器,设计用于在非常低的电源电压下运行。它采用了高速缓存FFT算法,可以设计一个均衡的九级流水线。该处理器在每个周期计算一个复杂的基数2的蝴蝶,并包含独特的 hierarchical-bitline SRAM和ROM存储器,它们在标准和低电源电压,低阈值电压环境中均能良好运行。处理器的基板和阱节点连接到芯片焊盘,可通过偏置来调整晶体管阈值。 Spiffee采用标准的0.7μm( L poly = 0.6μm)CMOS工艺制造,并且在其首次制造时就具有完整的功能。在1.1 V的电源电压下,Spiffee可以在330μsec内计算出1024点的复数FFT,而耗散9.5 mW,因此调整后的能效比以前最高效的FFT处理器高16倍以上。电源电压为3.3 V时,它的工作频率为173 MHz,时钟速率比以前最快的时钟速率快2.6倍。

著录项

  • 作者

    Baas, Bevan Marcel.;

  • 作者单位

    Stanford University.;

  • 授予单位 Stanford University.;
  • 学科 Engineering Electronics and Electrical.; Mathematics.
  • 学位 Ph.D.
  • 年度 1999
  • 页码 168 p.
  • 总页数 168
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 无线电电子学、电信技术;数学;
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号