By Topic

Analysis of complex LNS FFTs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Arnold, M. ; Dept. of Comput. Sci., Wyoming Univ., Laramie, WY, USA ; Bailey, T. ; Cowles, J. ; Walter, C.

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

Published in:

Signal Processing Systems, 2001 IEEE Workshop on

Date of Conference: