Sign/Logarithm Arithmetic for FFT Implementation
- 1 June 1983
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-32 (6) , 526-534
- https://doi.org/10.1109/tc.1983.1676274
Abstract
Sign/logarithm arithmetic is applicable to a variety of numerical applications where wide dynamic range and small wordsize are required. In this paper the basic sign/logarithm arithmetic operations required for signal processing (i.e., addition, subtraction, and multiplication) are reviewed, the computational errors are analyzed for FFT realization, and simulation results are presented which serve to verify the analysis. It is shown that the sign/logarithm approach provides improved arithmetic quantization error performance for a given word size over FFT's implemented with conventional fixed or floating point arithmetic, and that the sign/logarithm implementation is faster and less complex than conventional approaches.Keywords
This publication has 7 references indexed in Scilit:
- Error analysis of recursive digital filters implemented with logarithmic number systemsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1980
- The Sign/Logarithm Number SystemIEEE Transactions on Computers, 1975
- Effects of finite register length in digital filtering and the fast Fourier transformProceedings of the IEEE, 1972
- Digital filtering using logarithmic arithmeticElectronics Letters, 1971
- Generation of Products and Quotients Using Approximate Binary Logarithms for Digital Filtering ApplicationsIEEE Transactions on Computers, 1970
- Roundoff noise in floating point fast Fourier transform computationIEEE Transactions on Audio and Electroacoustics, 1969
- Computation of the Base Two Logarithm of Binary NumbersIEEE Transactions on Electronic Computers, 1965