Combining Restoring Array and Logarithmic Dividers into an Approximate Hybrid Design

This paper proposes a new design of an approximate hybrid divider (AXHD), which combines the restoring array and the logarithmic dividers to achieve an excellent tradeoff between accuracy and hardware performance. Exact restoring divider cells (EXDCrs) are used to generate the MSBs of the quotient for attaining a high accuracy; the other quotient digits are processed by a logarithmic divider as inexact scheme to improve figures of merit such as power consumption, area and delay. The proposed AXHD is evaluated and analyzed using error and hardware metrics. The proposed design is also compared with the exact restoring divider (EXDr) and previous approximate restoring dividers (AXDrs). The results show that the proposed design achieves very good performance in terms of accuracy and hardware; case studies for image processing also show the validity of the proposed designs.

[1]  Caro Lucas,et al.  Bio-Inspired Imprecise Computational Blocks for Efficient VLSI Implementation of Soft-Computing Applications , 2010, IEEE Transactions on Circuits and Systems I: Regular Papers.

[2]  Shih-Lien Lu.  Speeding Up Processing with Approximation Circuits , 2004, Computer.

[3]  Sherief Reda,et al.  A low-power dynamic divider for approximate applications , 2016, 2016 53nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[4]  Kaushik Roy,et al.  Approximate computing and the quest for computing efficiency , 2015, 2015 52nd ACM/EDAC/IEEE Design Automation Conference (DAC).

[5]  Kaushik Roy,et al.  Low-Power Digital Signal Processing Using Approximate Adders , 2013, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[6]  Kiamal Z. Pekmestzi,et al.  Approximate Multiplier Architectures Through Partial Product Perforation: Power-Area Tradeoffs Analysis , 2015, ACM Great Lakes Symposium on VLSI.

[7]  Zhi-Hui Kong,et al.  Design of Low-Power High-Speed Truncation-Error-Tolerant Adder and Its Application in Digital Signal Processing , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[8]  Fabrizio Lombardi,et al.  Design of Approximate Radix-4 Booth Multipliers for Error-Tolerant Computing , 2017, IEEE Transactions on Computers.

[9]  Fabrizio Lombardi,et al.  A Review, Classification, and Comparative Evaluation of Approximate Arithmetic Circuits , 2017, ACM J. Emerg. Technol. Comput. Syst..

[10]  Fabrizio Lombardi,et al.  On the Design of Approximate Restoring Dividers for Error-Tolerant Applications , 2016, IEEE Transactions on Computers.

[11]  Qiang Xu,et al.  Approximate Computing: A Survey , 2016, IEEE Design & Test.

[12]  Sherief Reda,et al.  DRUM: A Dynamic Range Unbiased Multiplier for approximate applications , 2015, 2015 IEEE/ACM International Conference on Computer-Aided Design (ICCAD).

[13]  Takafumi Aoki,et al.  High-radix parallel VLSI dividers without using quotient digit selection tables , 2000, Proceedings 30th IEEE International Symposium on Multiple-Valued Logic (ISMVL 2000).

[14]  Fabrizio Lombardi,et al.  Design of Approximate High-Radix Dividers by Inexact Binary Signed-Digit Addition , 2017, ACM Great Lakes Symposium on VLSI.

[15]  Tsin-Yuan Chang,et al.  A High-Accuracy Adaptive Conditional-Probability Estimator for Fixed-Width Booth Multipliers , 2012, IEEE Transactions on Circuits and Systems I: Regular Papers.

[16]  John N. Mitchell,et al.  Computer Multiplication and Division Using Binary Logarithms , 1962, IRE Trans. Electron. Comput..

[17]  Jie Han,et al.  Approximate computing: An emerging paradigm for energy-efficient design , 2013, 2013 18th IEEE European Test Symposium (ETS).

[18]  Behrooz Parhami,et al.  Computer arithmetic - algorithms and hardware designs , 1999 .

[19]  Fabrizio Lombardi,et al.  Design of Approximate Unsigned Integer Non-restoring Divider for Inexact Computing , 2015, ACM Great Lakes Symposium on VLSI.

[20]  Fabrizio Lombardi,et al.  New Metrics for the Reliability of Approximate and Probabilistic Adders , 2013, IEEE Transactions on Computers.