Skip to main content
SpringerLink
Log in

A Survey of Reliability Issues Related to Approximate Circuits

  • Survey
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

As one of the most promising paradigms of integrated circuit design, the approximate circuit has aroused widespread concern in the scientific community. It takes advantage of the inherent error tolerance of some applications and relaxes the accuracy for reductions in area and power consumption. This paper aims to provide a comprehensive survey of reliability issues related to approximate circuits, which covers three concerns: error characteristic analysis, reliability and test, and reliable design involving approximate circuits. The error characteristic analysis is used to compare the outputs of the approximate circuit with those of its precise counterpart, which can help to find the most appropriate approximate design for a specific application in the large design space. With the approximate design getting close to physical realization, manufacturing defects and operational faults are inevitable; therefore, the reliability prediction and vulnerability test become increasingly important. However, the research on approximate circuit reliability and test is insufficient and needs more attention. Furtherly, although there is some existing work combining the approximate design with fault tolerant techniques, the reliability-enhancement approaches for approximate circuits are lacking.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Moore G E. Cramming more components onto integrated circuits. IEEE Solid-State Circuits Society Newsletter, 2006, 11(3): 33–35. https://doi.org/10.1109/N-SSC.2006.4785860.

    Article  Google Scholar 

  2. Dennard R H, Spampinato D P. Differential charge transfer sense amplifier. United States Patent 3949381. 1976-04-06.

  3. Liu G, Zhang Z R. Statistically certified approximate logic synthesis. In Proc. the 2017 IEEE/ACM International Conference on Computer-Aided Design, Nov. 2017, pp.344–351. https://doi.org/10.1109/ICCAD.2017.8203798.

  4. Chen C Y, Choi J, Gopalakrishnan K, Srinivasan V, Venkataramani S. Exploiting approximate computing for deep learning acceleration. In Proc. the 2018 Design, Automation & Test in Europe Conference & Exhibition, Mar. 2018, pp.821–826. https://doi.org/10.23919/DATE.2018.8342119.

  5. Han J, Orshansky M. Approximate computing: An emerging paradigm for energy-efficient design. In Proc. the 2013 IEEE European Test Symposium, May 2013. https://doi.org/10.1109/ETS.2013.6569370.

  6. Yazdanbakhsh A, Park J, Sharma H, Lotfi-Kamran P, Esmaeilzadeh H. Neural acceleration for GPU throughput processors. In Proc. the 48th International Symposium on Microarchitecture, Dec. 2015, pp.482–493. https://doi.org/10.1145/2830772.2830810.

  7. Samadi M, Jamshidi D A, Lee J, Mahlke S. Paraprox: Pattern-based appoximation for data parallel applications. In Proc. the 19th International Conference on Architectural Support for Programming Languages and Operating Systems, Feb. 2014, pp.35–50. https://doi.org/10.1145/2541940.2541948.

  8. Sidiroglou-Douskos S, Misailovic S, Hoffmann H, Rinard M. Managing performance vs accuracy trade-offs with loop perforation. In Proc. the 19th ACM SIGSOFT Symposium and the 13th European Conference on Foundations of Software Engineering, Sept. 2011, pp.124–134. https://doi.org/10.1145/2025113.2025133.

  9. Yang Z X, Jain A, Liang J H, Han J, Lombardi F. Approximate XOR/XNOR-based adders for inexact computing. In Proc. the 13th IEEE International Conference on Nanotechnology, Aug. 2013, pp.690–693. https://doi.org/10.1109/NANO.2013.6720793.

  10. Ramasamy M, Narmadha G, Deivasigamani S. Carry based approximate full adder for low power approximate computing. In Proc. the 7th International Conference on Smart Computing & Communications, Jun. 2019. https://doi.org/10.1109/ICSCC.2019.8843644.

  11. Liu W Q, Qian L Y, Wang C H, Jiang H L, Han J, Lombardi F. Design of approximate radix-4 booth multipliers for error-tolerant computing. IEEE Trans. Computers, 2017, 66(8): 1435–1441. https://doi.org/10.1109/TC.2017.2672976.

    Article  MathSciNet  MATH  Google Scholar 

  12. Cao T, Liu W Q, Zhu Y Y. Design of approximate Booth multipliers for error-tolerant computing. Microelectronics Computer, 2018, 35(7): 67-71. https://doi.org/10.19304/j.cnki.issn1000-7180.2018.07.014. (in Chinese)

    Article  Google Scholar 

  13. Liu Z H, Yazdanbakhsh A, Park T, Esmaeilzadeh H, Kim N S. SiMul: An algorithm-driven approximate multiplier design for machine learning. IEEE Micro, 2018, 38(4): 50–59. https://doi.org/10.1109/MM.2018.043191125.

    Article  Google Scholar 

  14. Ansari M S, Cockburn B F, Han J. An improved logarithmic multiplier for energy-efficient neural computing. IEEE Trans. Computers, 2021, 70(4): 614–625. https://doi.org/10.1109/TC.2020.2992113.

    Article  MathSciNet  MATH  Google Scholar 

  15. Gielen G, De Wit P, Maricau E, Loeckx J, Martín-Martínez J, Kaczer B, Groeseneken G, Rodríguez R, Nafría M. Emerging yield and reliability challenges in nanometer CMOS technologies. In Proc. the 2008 Conference on Design, Automation and Test in Europe, Mar. 2008, pp.1322–1327. https://doi.org/10.1145/1403375.1403694.

  16. Mohanram K, Touba N A. Partial error masking to reduce soft error failure rate in logic circuits. In Proc. the 18th IEEE Symposium on Defect and Fault Tolerance in VLSI Systems, Nov. 2003, pp.433–440. https://doi.org/10.1109/DFTVS.2003.1250141.

  17. Choudhury M R, Mohanram K. Low cost concurrent error masking using approximate logic circuits. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 2013, 32(8): 1163–1176. https://doi.org/10.1109/TCAD.2013.2250581.

    Article  Google Scholar 

  18. Choudhury M R, Mohanram K. Approximate logic circuits for low overhead, non-intrusive concurrent error detection. In Proc. the 2008 Conference on Design, Automation and Test in Europe, Mar. 2008, pp.903–908. https://doi.org/10.1145/1403375.1403593.

  19. Martin H, Entrena L, Dupuis S, Natale G D. A novel use of approximate circuits to thwart hardware Trojan insertion and provide obfuscation. In Proc. the 24th International Symposium on On-Line Testing and Robust System Design, Jul. 2018, pp.41–42. https://doi.org/10.1109/IOLTS.2018.8474077.

  20. Liang J H, Han J, Lombardi F. New metrics for the reliability of approximate and probabilistic adders. IEEE Trans. Computers, 2013, 62(9): 1760–1771. https://doi.org/10.1109/TC.2012.146.

    Article  MathSciNet  MATH  Google Scholar 

  21. Gebregiorgis A, Kiamehr S, Tahoori M B. Error propagation aware timing relaxation for approximate near threshold computing. In Proc. the 54th Annual Design Automation Conference, Jun. 2017, Article No. 77. https://doi.org/10.1145/3061639.3062240

  22. Yu C C, Hayes J P. Scalable and accurate estimation of probabilistic behavior in sequential circuits. In Proc. the 28th VLSI Test Symposium, Apr. 2010, pp.165–170. https://doi.org/10.1109/VTS.2010.5469586.

  23. Kulkarni P, Gupta P, Ercegovac M. Trading accuracy for power with an underdesigned multiplier architecture. In Proc. the 24th Internatioal Conference on VLSI Design, Jan. 2011, pp.346–351. https://doi.org/10.1109/VLSID.2011.51.

  24. Liu C, Han J, Lombardi F. An analytical framework for evaluating the error characteristics of approximate adders. IEEE Trans. Computers, 2015, 64(5): 1268–1281. https://doi.org/10.1109/TC.2014.2317180.

    Article  MathSciNet  MATH  Google Scholar 

  25. Jiang H L, Han J, Qiao F, Lombardi F. Approximate radix-8 booth multipliers for low-power and high-performance operation. IEEE Trans. Computers, 2016, 65(8): 2638–2644. https://doi.org/10.1109/TC.2015.2493547.

    Article  MathSciNet  MATH  Google Scholar 

  26. Roy A S, Biswas R, Dhar A S. On fast and exact computation of error metrics in approximate LSB adders. IEEE Trans. Very Large Scale Integration (VLSI) Systems, 2020, 28(4): 876–889. https://doi.org/10.1109/TVLSI.2020.2967149.

    Article  Google Scholar 

  27. Mrazek V, Hrbacek R, Vasicek Z, Sekanina L. EvoApprox8b: Library of approximate adders and multipliers for circuit design and benchmarking of approximation methods. In Proc. the 2017 Design, Automation & Test in Europe Conference & Exhibition, Mar. 2017, pp.258–261. https://doi.org/10.23919/DATE.2017.7926993.

  28. Biersack J P, Haggmark L G. A Monte Carlo computer program for the transport of energetic ions in amorphous targets. Nuclear Instruments and Methods, 1980, 174(1/2): 257–269. https://doi.org/10.1016/0029-554X(80)90440-1.

    Article  Google Scholar 

  29. Mazahir S, Hasan O, Hafiz R, Shafique M, Henkel J. Probabilistic error modeling for approximate adders. IEEE Trans. Computers, 2017, 66(3): 515–530. https://doi.org/10.1109/TC.2016.2605382.

    Article  MathSciNet  MATH  Google Scholar 

  30. Venkatesan R, Agarwal A, Roy K, Raghunathan A. MACACO: Modeling and analysis of circuits for approximate computing. In Proc. the 2011 IEEE/ACM International Conference on Computer-Aided Design, Nov. 2011, pp.667–673. https://doi.org/10.1109/ICCAD.2011.6105401.

  31. Bonnot J, Menard D, Desnos K. Fast kriging-based error evaluation for approximate computing systems. In Proc. the 2020 Design, Automation & Test in Europe Conference & Exhibition, Mar. 2020, pp.1384–1389. https://doi.org/10.23919/DATE48585.2020.9116320.

  32. Ayub M K, Hasan O, Shafique M. Statistical error analysis for low power approximate adders. In Proc. the 54th Annual Design Automation Conference, Jun. 2017, Article No. 75. https://doi.org/10.1145/3061639.3062319.

  33. Gupta V, Mohapatra D, Park S P, Raghunathan A, Roy K. IMPACT: Imprecise adders for low-power approximate computing. In Proc. the 2011 IEEE/ACM International Symposium on Low Power Electronics and Design, Aug. 2011, pp.409–414. https://doi.org/10.1109/ISLPED.2011.5993675.

  34. Gupta V, Mohapatra D, Raghunathan A, Roy K. Lowpower digital signal processing using approximate adders. IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, 2013, 32(1): 124–137. https://doi.org/10.1109/TCAD.2012.2217962.

    Article  Google Scholar 

  35. Shafique M, Ahmad W, Hafiz R, Henkel J. A low latency generic accuracy configurable adder. In Proc. the 52nd Annual Design Automation Conference, Jun. 2015, Article No. 86. https://doi.org/10.1145/2744769.2744778.

  36. Almurib H A F, Kumar T N, Lombardi F. Inexact designs for approximate low power addition by cell replacement. In Proc. the 2016 Design, Automation & Test in Europe Conference & Exhibition, Mar. 2016, pp.660–665. https://doi.org/10.3850/9783981537079_0042.

  37. Rezaalipour M, Rezaalipour M, Dehyadegari M, Bojnordi M N. AxMAP: Making approximate adders aware of input patterns. IEEE Trans. Computers, 2020, 69(6): 868–882. https://doi.org/10.1109/TC.2020.2968905.

    Article  MathSciNet  MATH  Google Scholar 

  38. Kahng A B, Kang S. Accuracy-configurable adder for approximate arithmetic designs. In Proc. the 49th Annual Design Automation Conference, Jun. 2012, pp.820–825. https://doi.org/10.1145/2228360.2228509.

  39. Kulkarni P, Gupta P, Ercegovac M D. Trading accuracy for power in a multiplier architecture. Journal of Low Power Electronics, 2011, 7(4): 490–501. https://doi.org/10.1166/jolpe.2011.1157.

    Article  Google Scholar 

  40. Lin C H, Lin I C. High accuracy approximate multiplier with error correction. In Proc. the 31st IEEE International Conference on Computer Design, Oct. 2013, pp.33–38. https://doi.org/10.1109/ICCD.2013.6657022.

  41. Maheshwari N, Yang Z X, Han J, Lombardi F. A design approach for compressor based approximate multipliers. In Proc. the 28th International Conference on VLSI Design, Jan. 2015, pp.209–214. https://doi.org/10.1109/VLSID.2015.41.

  42. Momeni A, Han J, Montuschi P, Lombardi F. Design and analysis of approximate compressors for multiplication. IEEE Trans. Computers, 2015, 64(4): 984–994. https://doi.org/10.1109/TC.2014.2308214.

    Article  MathSciNet  MATH  Google Scholar 

  43. Mazahir S, Hasan O, Hafiz R, Shafique M. Probabilistic error analysis of approximate recursive multipliers. IEEE Trans. Computers, 2017, 66(11): 1982–1990. https://doi.org/10.1109/TC.2017.2709542.

    Article  MathSciNet  MATH  Google Scholar 

  44. Sengupta D, Sapatnekar S S. FEMTO: Fast error analysis in multipliers through topological traversal. In Proc. the 2015 IEEE/ACM International Conference on Computer-Aided Design, Nov. 2015, pp.294–299. https://doi.org/10.1109/ICCAD.2015.7372583.

  45. Sunny A, Mathew B K, Dhanusha P B. Area efficient high speed approximate multiplier with carry predictor. Procedia Technology, 2016, 24: 1170–1177. https://doi.org/10.1016/j.protcy.2016.05.072.

    Article  Google Scholar 

  46. Kim M S, Del Barrio A A, Oliveira L T, Hermida R, Bagherzadeh N. Efficient Mitchell’s approximate log multipliers for convolutional neural networks. IEEE Trans. Computers, 2019, 68(5): 660–675. https://doi.org/10.1109/TC.2018.2880742.

    Article  MathSciNet  MATH  Google Scholar 

  47. Vasicek Z. Formal methods for exact analysis of approximate circuits. IEEE Access, 2019, 7: 177309–177331. https://doi.org/10.1109/ACCESS.2019.2958605.

    Article  Google Scholar 

  48. Froehlich S, GroBe D, Drechsler R. One method—All error-metrics: A three-stage approach for error-metric evaluation in approximate computing. In Proc. Design, Autom. Test Eur ConfExhib. (DATE), Mar. 2019, pp.284–287. https://doi.org/10.23919/DATE.2019.8715138.

  49. Soeken M, Große D, Chandrasekharan A, Drechsler R. BDD minimization for approximate computing. In Proc. the 21st Asia and South Pacific Design Automation Conference, Jan. 2016, pp.474–479. https://doi.org/10.1109/ASPDAC.2016.7428057.

  50. Wendler A, Keszocze O. A fast BDD minimization framework for approximate computing. In Proc. the 2020 Design, Automation & Test in Europe Conference & Exhibition, Mar. 2020, pp.1372–1377. https://doi.org/10.23919/DATE48585.2020.9116296.

  51. Froehlich S, Große D, Drechsler R. One method-all errormetrics: A three-stage approach for error-metric evaluation in approximate computing. In Proc. the 2019 Design, Automation & Test in Europe Conference & Exhibition, Mar. 2019, pp.284–287. https://doi.org/10.23919/DATE.2019.8715138.

  52. Chandrasekharan A, Soeken M, Große D, Drechsler R. Precise error determination of approximated components in sequential circuits with model checking. In Proc. the 53rd Annual Design Automation Conference, Jun. 2016, Article No. 129. https://doi.org/10.1145/2897937.2898069.

  53. Češka M, Matyaš J, Mrazek V, Sekanina L, Vasicek Z, Vojnar T. Approximating complex arithmetic circuits with formal error guarantees: 32-bit multipliers accomplished. In Proc. the 2017 IEEE/ACM International Conference on Computer-Aided Design, Nov. 2017, pp.416-423. https://doi.org/10.1109/ICCAD.2017.8203807.

  54. Anghel L, Benabdenbi M, Bosio A, Vatajelu E I. Test and reliability in approximate computing. In Proc. the 2017 International Mixed Signals Testing Workshop, Jul. 2017. https://doi.org/10.1109/IMS3TW.2017.7995210.

  55. Jiang J H, Lu G M, Wang Z. Methods for approximate adders reliability estimation based on PTM model. In Proc. the 23rd Pacific Rim International Symposium on Dependable Computing, Dec. 2018, pp.221–222. https://doi.org/10.1109/PRDC.2018.00038.

  56. Wang Z, Zhang G F, Ye J, Jiang J H, Li F Y, Wang Y. Accurate reliability analysis methods for approximate computing circuits. Tsinghua Science and Technology, 2022, 27(4): 729–740. https://doi.org/10.26599/TST.2020.9010032.

  57. Jiang J H, Wang T, Wang Z. Probability gate model based methods for approximate arithmetic circuits reliability estimation. CCF Trans. High Performance Computing, 2021, 3(2): 201–219. https://doi.org/10.1007/s42514-020-00058-1.

    Article  Google Scholar 

  58. Wang Z, Jiang J H, Wang T. Failure probability analysis and critical node determination for approximate circuits. Integration, 2019, 68: 122–128. https://doi.org/10.1016/j.vlsi.2019.05.008.

    Article  Google Scholar 

  59. Bosio A, Di Carlo S, Girard P, Sanchez E, Savino A, Sekanina L, Traiola M, Vasicek Z, Virazel A. Design, verification, test and in-field implications of approximate computing systems. In Proc. the 2020 IEEE European Test Symposium, May 2020. https://doi.org/10.1109/ETS48528.2020.9131557.

  60. Traiola M, Virazel A, Girard P, Barbareschi M, Bosio A. On the comparison of different ATPG approaches for approximate integrated circuits. In Proc. the 21st IEEE International Symposium on Design and Diagnostics of Electronic Circuits Systems, Apr. 2018, pp.85–90. https://doi.org/10.1109/DDECS.2018.00022.

  61. Chandrasekharan A, Eggersglüß S, Große D, Drechsler R. Approximation-aware testing for approximate circuits. In Proc. the 23rd Asia and South Pacific Design Automation Conference, Jan. 2018, pp.239–244. https://doi.org/10.1109/ASPDAC.2018.8297312.

  62. Traiola M, Virazel A, Girard P, Barbarcschi M, Bosio A. Investigation of mean-error metrics for testing approximate integrated circuits. In Proc. the 2018 IEEE International Symposium on Defect and Fault Tolerance in VLSI and Nanotechnology Systems, Oct. 2018. https://doi.org/10.1109/DFT.2018.8602939.

  63. Traiola M, Virazel A, Girard P, Barbareschi M, Bosio A. Testing approximate digital circuits: Challenges and opportunities. In Proc. the 19th IEEE Latin-American Test Symposium, Mar. 2018. https://doi.org/10.1109/LATW.2018.8349681.

  64. Wali I, Traiola M, Virazel A, Girard P, Barbareschi M, Bosio A. Towards approximation during test of integrated circuits. In Proc. the 20th IEEE International Symposium on Design and Diagnostics of Electronic Circuits & Systems, Apr. 2017, pp.28–33. https://doi.org/10.1109/DDECS.2017.7934574.

  65. Anghel L, Benabdenbi M, Bosio A, Traiola M, Vatajelu E I. Test and reliability in approximate computing. Journal of Electronic Testing, 2018, 34(4): 375–387. https://doi.org/10.1007/s10836-018-5734-9.

    Article  Google Scholar 

  66. Gebregiorgis A, Tahoori M B. Test pattern generation for approximate circuits based on Boolean satisfiability. In Proc. the 2019 Design, Automation & Test in Europe Conference & Exhibition, Mar. 2019, pp.1028–1033. https://doi.org/10.23919/DATE.2019.8714898.

  67. Traiola M, Virazel A, Girard P, Barbareschi M, Bosio A. A test pattern generation technique for approximate circuits based on an ILP-formulated pattern selection procedure. IEEE Trans. Nanotechnology, 2019, 18: 849–857. https://doi.org/10.1109/TNANO.2019.2923040.

    Article  Google Scholar 

  68. Traiola M, Virazel A, Girard P, Barbareschi M, Bosio A. Maximizing yield for approximate integrated circuits. In Proc. the 2020 Design, Automation & Test in Europe Conference & Exhibition, Mar. 2020, pp.810–815. https://doi.org/10.23919/DATE48585.2020.9116341.

  69. Sierawski B D, Bhuva B L, Massengill L W. Reducing soft error rate in logic circuits through approximate logic functions. IEEE Trans. Nuclear Science, 2006, 53(6): 3417–3421. https://doi.org/10.1109/TNS.2006.884352.

    Article  Google Scholar 

  70. Sánchez-Clemente A, Entrena L, García-Valderas M, López-Ongil C. Logic masking for SET mitigation using approximate logic circuits. In Proc. the 18th IEEE International On-Line Testing Symposium, Jun. 2012, pp.176–181. https://doi.org/10.1109/IOLTS.2012.6313868.

  71. Gomes I A C, Martins M, Kastensmidt F L, Reis A, Ribas R, Novalès S P. Methodology for achieving best trade-off of area and fault masking coverage in ATMR. In Proc. the 15th Latin American Test Workshop-LATW, Mar. 2014. https://doi.org/10.1109/LATW.2014.6841916.

  72. Gomes I A C, Martins M, Reis A, Kastensmidt F L. Using only redundant modules with approximate logic to reduce drastically area overhead in TMR. In Proc. the 16th Latin-American Test Symposium, Mar. 2015. https://doi.org/10.1109/LATW.2015.7102522.

  73. Deveautour B, Traiola M, Virazel A, Girard P. QAMR: An approximation-based fully reliable TMR alternative for area overhead reduction. In Proc. the 2020 IEEE European Test Symposium, May 2020. https://doi.org/10.1109/ETS48528.2020.9131574.

  74. Deveautour B, Traiola M, Virazel A, Girard P. Reducing overprovision of triple modular reduncancy owing to approximate computing. In Proc. the 27th IEEE International Symposium on On-Line Testing and Robust System Design, Jun. 2021. https://doi.org/10.1109/IOLTS52814.2021.9486699.

  75. Masadeh M, Aoun A, Hasan O, Tahar S. Highly-reliable approximate quadruple modular redundancy with approximation-aware voting. In Proc. the 32nd International Conference on Microelectronics, Dec. 2020. https://doi.org/10.1109/ICM50269.2020.9331771.

Download references

Author information

Authors and Affiliations

  1. College of Computer Science and Technology, Shanghai University of Electric Power, Shanghai, 200090, China

    Zhen Wang, Rong-Chen Xu & Jia-Cheng Chen

  2. College of Computer Science and Technology, Zhejiang University of Technology, Hangzhou, 310000, China

    Jie Xiao

Authors
  1. Zhen Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rong-Chen Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jia-Cheng Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Jie Xiao
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Jie Xiao.

Supplementary Information

ESM 1

(PDF 147 kb)

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Wang, Z., Xu, RC., Chen, JC. et al. A Survey of Reliability Issues Related to Approximate Circuits. J. Comput. Sci. Technol. 38, 273–288 (2023). https://doi.org/10.1007/s11390-023-2554-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-023-2554-x

Keywords

Search

Navigation