A Hardware-Efficient Logarithmic Multiplier with Improved Accuracy
Mohammad Saeed Ansaria, Bruce F. Cockburnb and Jie Hanc
University of Alberta Edmonton, AB, Canada
aansari2@ualberta.ca
bcockburn@ualberta.ca
cjhan8@ualberta.ca
ABSTRACT
Logarithmic multipliers take the base-2 logarithm of the operands and perform multiplication by only using shift and addition operations. Since computing the logarithm is often an approximate process, some accuracy loss is inevitable in such designs. However, the area, latency, and power consumption can be significantly improved at the cost of accuracy loss. This paper presents a novel method to approximate log2N that, unlike the existing approaches, rounds N to its nearest power of two instead of the highest power of two smaller than or equal to N. This approximation technique is then used to design two improved 16×16 logarithmic multipliers that use exact and approximate adders (ILM-EA and ILM-AA, respectively). These multipliers achieve up to 24.42% and 9.82% savings in area and power-delay product, respectively, compared to the state-of-the-art design in the literature with similar accuracy. The proposed designs are evaluated in the Joint Photographic Experts Group (JPEG) image compression algorithm and their advantages over other approximate logarithmic multipliers are shown.
Keywords: Approximate computing, Logarithmic multiplier, Hardware-efficient multiplier, JPEG image compression.
