Unified Mitchell-based Approximation for Efficient Logarithmic Conversion Circuit
- 9 June 2014
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 64 (00189340) , 1
Abstract
This paper presents a novel method named the Unified Mitchell-based Approximation (UMA) to obtain an optimized Mitchell-based logarithmic conversion circuit for any desired conversion accuracy up to 14 bits. UMA is the first method that is able to obtain a conversion circuit when a specific accuracy is required. In this work, we studied and analyzed five design parameters and their impact on accuracy and hardware merits. We formulate the hardware model of the error correction circuit in the conversion circuit for performance evaluation. Given an accuracy requirement, the proposed method explores the design space of the five design parameters. As the design space is theoretically huge, we propose constraints for the range of the parameter values and develop a systematical search algorithm for exploring the design space. UMA is able to obtain an area-delay product optimized circuit for each of the conversion accuracies achieved by the existing Mitchell-based designs. Synthesis results in 90 nm CMOS technology show that the circuits obtained are comparable or better than the existing Mitchell-based designs with the same accuracy objective. Nine of the fifteen circuits obtained achieve better area-delay product by more than 50 percent. In addition, UMA is able to obtain circuits for any accuracy from 4 to 14 bits, while the best accuracy achieved by the existing Mitchell-based methods is less than 12 bits.Keywords
This publication has 31 references indexed in Scilit:
- A VLSI Efficient Programmable Power-of-Two Scaler for $\{2^{n}-1,2^{n},2^{n}+1\}$ RNSIEEE Transactions on Circuits and Systems I: Regular Papers, 2012
- A Memory-Efficient Tables-and-Additions Method for Accurate Computation of Elementary FunctionsIEEE Transactions on Computers, 2012
- A Fast Hardware Approach for Approximate, Efficient Logarithm and Antilogarithm ComputationsIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2008
- Enhancing parallel-prefix structures using carry-save notation2008
- Multipartite table methodsIEEE Transactions on Computers, 2005
- Diminished-one modulo 2/sup n/+1 adder designIEEE Transactions on Computers, 2002
- The Symmetric Table Addition Method for Accurate Function ApproximationJournal of Signal Processing Systems, 1999
- Parallel Prefix ComputationJournal of the ACM, 1980
- Computation of the Base Two Logarithm of Binary NumbersIEEE Transactions on Electronic Computers, 1965
- Computer Multiplication and Division Using Binary LogarithmsIEEE Transactions on Electronic Computers, 1962