This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Sign/Logarithm Arithmetic for FFT Implementation
June 1983 (vol. 32 no. 6)
pp. 526-534
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.
Index Terms:
spectral computation, Computer arithmetic, fast Fourier transform, number systems, signal processing, special purpose computers
Citation:
E.E., Jr. Swartzlander, D.V. Satish Chandra, H.T., Jr. Nagle, S.A. Starks, "Sign/Logarithm Arithmetic for FFT Implementation," IEEE Transactions on Computers, vol. 32, no. 6, pp. 526-534, June 1983, doi:10.1109/TC.1983.1676274
Usage of this product signifies your acceptance of the Terms of Use.