Analysis of complex LNS FFTs

2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578) Pub Date : 2001-09-26 DOI:10.1109/SIPS.2001.957331

M. Arnold, T. Bailey, J. Cowles, C. Walter

引用次数: 6

Abstract

The complex-logarithmic number system (CLNS), which represents each complex point in log/polar coordinates, may be practical to implement the fast Fourier transform (FFT). The roots of unity needed by the FFT have exact representations in CLNS and do not require a ROM. We present an error analysis and simulation results for a radix-two FFT that compares a rectangular fixed-point representation of complex numbers to the CLNS. We observe that the CLNS saves 9-12 bits in word-size for 256-1024 point FFTs compared to the fixed-point number system while producing comparable accuracy.

查看原文

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

本刊更多论文

复杂 LNS FFT 分析

复对数系统（CLNS）以对数/极坐标表示每个复点，可用于实现快速傅立叶变换（FFT）。FFT 所需的合一根在 CLNS 中有精确的表示，不需要 ROM。我们介绍了弧度为 2 的 FFT 的误差分析和仿真结果，并将复数的矩形定点表示与 CLNS 进行了比较。我们发现，在 256-1024 点 FFT 中，CLNS 比定点数系统节省了 9-12 比特的字长，同时精度相当。

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

求助全文

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

来源期刊

2001 IEEE Workshop on Signal Processing Systems. SiPS 2001. Design and Implementation (Cat. No.01TH8578)

自引率

0.00%

发文量

期刊最新文献

A real-time HDTV video decoder A multi-level block priority based instruction caching scheme for multimedia processors Reliable low-power multimedia communication systems Design of Viterbi decoders with in-place state metric update and hybrid traceback processing Index-based RNS DWT architectures for custom IC designs