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 CLNS. We observe that CLNS saves 9–12 bits in word-size for 256–1024 point FFTs compared to the fixed-point number system while producing comparable accuracy.
The consequence of the word-size advantage is that the number of full adders required for CLNS is significantly smaller than for an equivalent fixed-point implementation. The major cost of CLNS is the memory, which unlike conventional LNS, is addressed by both real and imaginary parts. Table-reduction techniques can mitigate this. The simplicity of the CLNS approach requires significantly fewer full adders, which pays for some or all of the extra memory. In applications needing the magnitude of the complex parts, such as a power spectrum, the CLNS approach can actually require less memory than the conventional approach.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
R.N. Bracewell, The Fourier Transform and Its Applications, 2nd ed., revised, New York: McGraw Hill, 1986, pp. 370-384.
R.W. Ramirez, The FFT: Fundamentals and Concepts, Englewood Cliffs, NJ: Prentice-Hall, 1985.
E.E. Swartzlander and A.G. Alexopoulos, "The Sign/Logarithm Number System," IEEE Trans. Comput., vol. C-24, 1975, pp. 1238-1242.
T. Stouraitis, "Logarithmic Number System Theory, Analysis, and Design," Ph.D. Dissertation, University of Florida, Gainesville, 1986.
E.E. Swartzlander et al., "Sign/Logarithm Arithmetic for FFT Implementation," IEEE Trans. Comput., vol. C-32, 1983, pp. 526-534.
W. Hongyuan and S.C. Lee, "Comment on 'Sign/Logarithm Arithmetic for FFT Implementation'," IEEE Trans. Comput., vol. C-35, 1986, pp. 482-484.
S.J. Kidd, "Implementation of the Sign-Logarithm Arithmetic FFT," Royal Signals and Radar Establishment Memorandum 3644, Malvern, 1983.
M.G. Arnold, T.A. Bailey, J.R. Cowles, and M.D. Winkel, "Arithmetic Co-Transformations in the Real and Complex Logarithmic Number Systems," IEEE Trans. Comput., vol. 47, no. 7, 1998, pp. 777-786.
D.M. Lewis, "Complex Logarithmic Number System Arithmetic Using High Radix Redundant CORDIC Algorithms," in Proc. 14th IEEE Symposium on Computer Arithmetic, Adelaide, Australia, April 1999, pp. 194-203.
V. Paliouras and T. Stouraitis, "Low Power Properties of the Logarithmic Number System," in Proc. 15th IEEE Symposium on Computer Arithmetic, Vail, Colorado, June 2001, pp. 229-236.
R. Mehmke, "Additionslogarithmen f¨ur Complexe Gr¨ossen," Zeitschrift f¨ur Mathematik und Physik, vol. 40, 1895, pp. 15-30.
M.L. Frey and F.J. Taylor, "A Table Reduction Technique for Logarithmically Architected Digital Filters," IEEE Trans. Acoust., Speech, Signal Proc., vol. ASSP-31, no. 3, 1985, pp. 718-719.
J.N. Mitchell, "Computer Multiplication and Division Using Binary Logarithms," IRE Transactions on Electronic Computers, vol. EC-11, 1962, pp. 512-517.
M. Arnold, T. Bailey, and J. Cowles, "Error Analysis of Kmetz/Maenner Algorithm," J. VLSI Signal Processing, vol. 33, 2002, pp. 37-53.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Arnold, M., Bailey, T., Cowles, J. et al. Fast Fourier Transforms Using the Complex Logarithmic Number System. The Journal of VLSI Signal Processing-Systems for Signal, Image, and Video Technology 33, 325–335 (2003). https://doi.org/10.1023/A:1022236132192
Published:
Issue Date:
DOI: https://doi.org/10.1023/A:1022236132192