An Efficient and Accurate Logarithmic Multiplier Based on Operand Decomposition

Logarithmic Number Systems (LNS) offer a viable alternative in terms of area, delay and power to binary number systems for multiplication and division operations in signal processing. The Mitchell Algorithm (MA) proposed in [9], is a simple and low cost approach commonly used for logarithmic multiplication. However, the method involves high error due to piecewise straight line approximation of the logarithm curve. Several methods have been proposed in the literature for improving the accuracy of Mitchell's Algorithm. In this paper, we propose a new method for improving the accuracy of MA using Operand Decomposition (OD). The OD process decreases the number of bits with the value of `1' in the multiplicands and reduces the amount of approximation. The proposed method decreases the error percentage of the Mitchell Algorithm by 44.7% on the average. Since the proposed method does not require any correction term it can be used in combination with other methods for improving the ...

• Type: Conference
• Year: 2006
• Where: VLSID
• Authors: Venkataraman Mahalingam, N. Ranganathan
• Keywords: Computer Architecture, Logarithmic Multiplication, Logarithmic Number Systems, Mitchell Algorithm, VLSID 2006