Parametrizable behavioral IP module for a data-localized low-power FFT

1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461) Pub Date : 1900-01-01 DOI:10.1109/SIPS.1999.822370

E. Brockmeyer, C. Ghez, J. D'Eer, F. Catthoor, H. de Man

引用次数: 8

Abstract

FFTs are important modules in embedded telecom systems, many of which require low-power real-time implementations. This paper describes a technique for aggressively localizing data accesses in a (inverse) fast Fourier transformation at the source code level. The global I/O functionality is not modified and neither is the bit-true arithmetic behavior. Typically 20 to 50% of the background memory accesses can be saved. A heavily parametrizable solution is proposed which leads to a family of power optimized algorithm codes. Moreover, efficient coding details for specific instances are shown.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

数据局部化低功耗FFT的可参数化行为IP模块

fft是嵌入式电信系统中的重要模块，其中许多需要低功耗实时实现。本文描述了一种在源代码级(逆)快速傅立叶变换中积极定位数据访问的技术。全局I/O功能没有被修改，位真算术行为也没有被修改。通常可以节省20%到50%的后台内存访问。提出了一种高度可参数化的解决方案，从而产生了一系列功率优化算法代码。此外，还展示了针对特定实例的高效编码细节。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

1999 IEEE Workshop on Signal Processing Systems. SiPS 99. Design and Implementation (Cat. No.99TH8461)

自引率

0.00%

发文量

期刊最新文献

Efficient FFT implementation using digit-serial arithmetic VLSI implementation issues of TURBO decoder design for wireless applications A new image encryption algorithm and its VLSI architecture Implementation of the discrete cosine transform and its inverse by recursive structures A high-speed CORDIC algorithm and architecture for DSP applications