QAMR: an Approximation-Based Fully Reliable TMR Alternative for Area Overhead Reduction

In the last decade, Approximate Computing has become a trend topic for several error tolerant applications. In this context, the use of such paradigm for reducing the area and power cost of conventional fault tolerant schemes (i.e. Triple Modular Redundancy) has been investigated recently. Unfortunately, existing solutions cannot ensure the same level of reliability compared to conventional TMR. In this paper, we propose a novel fully robust approximation-based solution suitable for safety-critical applications that can reduce the cost compared to conventional TMR structures. This solution is based on the use of four approximate modules with an overall smaller area overhead compared to a TMR made of three precise modules. The main constraint is that, for a given output of the precise module, at least three approximate modules (among four) can feed the voter with the same output. In order to build our Quadruple Approximate Modular Redundancy (QAMR) structure, we use a simple and random process whose goal is to remove different outputs with the corresponding fan-in logic from each approximate module in such a way that the above constraint is satisfied. The majority voter and its mode of operation remains the same as in the TMR. To validate our approach, we conducted experiments and results demonstrate that it is possible to achieve the fault tolerance of a full TMR approach while reducing the area overhead up to 24.28%.

[1]  Zdenek Vasícek,et al.  Role of circuit representation in evolutionary design of energy-efficient approximate circuits , 2018, IET Comput. Digit. Tech..

[2]  Andrew B. Kahng,et al.  Accuracy-configurable adder for approximate arithmetic designs , 2012, DAC Design Automation Conference 2012.

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

[4]  Ajay Joshi,et al.  Neural network-based accelerators for transcendental function approximation , 2014, GLSVLSI '14.

[5]  S. Yang,et al.  Logic Synthesis and Optimization Benchmarks User Guide Version 3.0 , 1991 .

[6]  Mayler G. A. Martins,et al.  Using only redundant modules with approximate logic to reduce drastically area overhead in TMR , 2015, 2015 16th Latin-American Test Symposium (LATS).

[7]  Malgorzata Chrzanowska-Jeske,et al.  Semiconductor Devices in Harsh Conditions , 2016 .

[8]  L.W. Massengill,et al.  Reducing Soft Error Rate in Logic Circuits Through Approximate Logic Functions , 2006, IEEE Transactions on Nuclear Science.

[9]  Mario García-Valderas,et al.  Logic masking for SET Mitigation Using Approximate Logic Circuits , 2012, 2012 IEEE 18th International On-Line Testing Symposium (IOLTS).

[10]  Anand Raghunathan,et al.  Quality configurable reduce-and-rank for energy efficient approximate computing , 2015, 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE).

[11]  Puneet Gupta,et al.  Trading Accuracy for Power with an Underdesigned Multiplier Architecture , 2011, 2011 24th Internatioal Conference on VLSI Design.

[12]  Mayler G. A. Martins,et al.  Exploring the use of approximate TMR to mask transient faults in logic with low area overhead , 2015, Microelectron. Reliab..

[13]  Sparsh Mittal,et al.  A Survey of Techniques for Approximate Computing , 2016, ACM Comput. Surv..