Sign/Logarithm Arithmetic for FFT Implementation

Authors:
E. E. , Jr. Swartzlander;D. V. Satish Chandra;H. T. , Jr. Nagle;S. A. Starks
Affiliations:
TRW Defense Systems Group;-;-;-
Venue:
IEEE Transactions on Computers
Year:
1983

Citing 3
Cited 5

Computer Arithmetic

Computer Arithmetic
Generation of Products and Quotients Using Approximate Binary Logarithms for Digital Filtering Applications

IEEE Transactions on Computers
The Sign/Logarithm Number System

IEEE Transactions on Computers

Comments on "Sign/Logarithm Arithmetic for FFT Implementation"

IEEE Transactions on Computers
Translinear Analog Signal Processing: A Modular Approach to Large-Scale Analog Computation with Multiple-Input Translinear Elements

ARVLSI '99 Proceedings of the 20th Anniversary Conference on Advanced Research in VLSI
Information for Authors

IEEE Transactions on Computers
A Novel Cotransformation for LNS Subtraction

Journal of Signal Processing Systems
Design-for-testability and fault-tolerant techniques for FFT processors

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	14.99

Visualization

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.