The Community for Technology Leaders
Green Image
Issue No. 11 - Nov. (2013 vol. 62)
ISSN: 0018-9340
pp: 2196-2209
Ioannis Kouretas , University of Patras, Patras
Charalambos Basetas , University of Patras, Patras
Vassilis Paliouras , University of Patras, Patras
ABSTRACT
This paper presents techniques for low-power addition/subtraction in the logarithmic number system (LNS) and quantifies their impact on digital filter VLSI implementation. The impact of partitioning the look-up tables required for LNS addition/subtraction on complexity, performance, and power dissipation of the corresponding circuits is quantified. Two design parameters are exploited to minimize complexity, namely the LNS base and the organization of the LNS word. A roundoff noise model is used to demonstrate the impact of base and word length on the signal-to-noise ratio of the output of finite impulse response (FIR) filters. In addition, techniques for the low-power implementation of an LNS multiply accumulate (MAC) units are investigated. Furthermore, it is shown that the proposed techniques can be extended to cotransformation-based circuits that employ interpolators. The results are demonstrated by evaluating the power dissipation, complexity and performance of several FIR filter configurations comprising one, two or four MAC units. Simulations of placed and routed VLSI LNS-based digital filters using a 90-nm 1.0 V CMOS standard-cell library reveal that significant power dissipation savings are possible by using optimized LNS circuits at no performance penalty, when compared to linear fixed-point two's-complement equivalents.
INDEX TERMS
Table lookup, Complexity theory, Power dissipation, Organizations, Adders, Finite impulse response filter,FIR, Logarithmic number system, computer arithmetic, digital filter
CITATION
Ioannis Kouretas, Charalambos Basetas, Vassilis Paliouras, "Low-Power Logarithmic Number System Addition/Subtraction and Their Impact on Digital Filters", IEEE Transactions on Computers, vol. 62, no. , pp. 2196-2209, Nov. 2013, doi:10.1109/TC.2012.111
262 ms
(Ver 3.3 (11022016))