Analysis of complex LNS FFTs

Author

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

Author_Institution

Dept. of Comput. Sci., Wyoming Univ., Laramie, WY, USA

fYear

2001

fDate

6/23/1905 12:00:00 AM

Firstpage

58

Lastpage

69

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

Keywords

digital arithmetic; error analysis; fast Fourier transforms; CLNS; ROM; complex LNS FFTs; complex numbers; complex-logarithmic number system; error analysis; fast Fourier transform; fixed-point number system; log/polar coordinates; logarithmic number system; radix-two FFT; rectangular fixed-point representation; roots of unity; simulation results; special-purpose DSP hardware; word-size; Analytical models; Concurrent computing; Energy consumption; Error analysis; Fast Fourier transforms; Fixed-point arithmetic; Flexible printed circuits; Floating-point arithmetic; Hardware; Read only memory;

fLanguage

English

Publisher

ieee

Conference_Titel

Signal Processing Systems, 2001 IEEE Workshop on

Conference_Location

Antwerp

ISSN

1520-6130

Print_ISBN

0-7803-7145-3

Type

conf

DOI

10.1109/SIPS.2001.957331

Filename

957331