Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.5555/1870926.1871113acmconferencesArticle/Chapter ViewAbstractPublication PagesdateConference Proceedingsconference-collections
research-article

RALF: reliability analysis for logic faults: an exact algorithm and its applications

Published: 08 March 2010 Publication History

Abstract

Reliability analysis for a logic circuit is one of the primary tasks in fault-tolerant logic synthesis. Given a fault model, it quantifies the impact of faults on the full-chip fault rate. We present RALF, an exact algorithm for calculating the reliability of a logic circuit. RALF is based on the compilation of a circuit to deterministic decomposable negation normal form (d-DNNF), a representation for Boolean formulas that can be more succinct than BDDs. Our algorithm can solve a large set of MCNC benchmark circuits within 5 minutes, enabling an optimality study of Monte Carlo simulation, a popular estimation method for reliability analysis, on real benchmark circuits. Our study shows that Monte Carlo simulation with a small set of random vectors generally has a high fidelity for the computation of full-chip fault rates and the criticality of single gates. While we focus on reliability analysis, RALF can also be used to efficiently locate random pattern resistant faults. This can be used to identify where methods other than random simulation should be used for accurate criticality calculations and where to enhance the testability of a circuit.

References

[1]
S. Krishnaswamy, S. M. Plaza, I. L. Markov, and J. P. Hayes, "Enhancing design robustness with reliability-aware resynthesis and logic simulation," in Proc. Int. Conf. on Computer Aided Design, 2007.
[2]
K. Parker and E. McCluskey, "Probabilistic treatment of general combinational networks," IEEE Transactions on Computers, vol. C-24, pp. 668--670, 1975.
[3]
S. Krishnaswamy, G. F. Viamontes, I. L. Markov, and J. P. Hayes, "Probabilistic transfer matrices in symbolic reliability analysis of logic circuits," ACM Trans. on Design Automation of Electronic Systems, vol. 13, 2008.
[4]
P. K. Samudrala, J. Ramos, and S. Katkoori, "Selective triple modular redundancy (STMR) based single-event upset (SEU) tolerant synthesis for FPGAs," IEEE Transactions on Nuclear Science, vol. 51, pp. 2957--2969, 2004.
[5]
Y. Hu, Z. Feng, R. Majumdar, and L. He, "Robust FPGA resynthesis based on fault tolerant boolean matching," in Proc. Int. Conf. on Computer Aided Design, 2008.
[6]
B. Zhang, W.-S. Wang, and M. Orshansky, "FASER: Fast analysis of soft error susceptibility for cell-based designs," in ISQED, pp. 755--760, 2006.
[7]
T. Rejimon and S. Bhanja, "An accurate probalistic model for error detection," in VLSI Design, pp. 717--722, 2005.
[8]
A. Abdollahi, "Probabilistic decision diagrams for exact probabilistic analysis," in Proc. Int. Conf. on Computer Aided Design, pp. 266--272, 2007.
[9]
A. Darwiche, "Decomposable negation normal form," Journal of the ACM, vol. 48, p. 2001, 2001.
[10]
S. Yang, "Logic synthesis and optimization benchmarks, version 3.0," tech. rep., Microelectronics Center of North Carolina (MCNC), 1991.
[11]
N. A. Touba and E. J. McCluskey, "Automated logic synthesis of random pattern testable circuits," in International Testing Conference, 1994.
[12]
S. Krishnaswamy, I. Markov, and J. Hayes, "Improving testability and soft-error resilience through retiming," in Proc. Design Automation Conf, 2009.
[13]
A. Darwiche, "A compiler for deterministic, decomposable negation normal form," in In Proc. AAAI '02, 2002.
[14]
R. Bryant, "Graph-based algorithms for boolean function manipulation," IEEE Trans. on Computers, vol. C-35, no. 8, pp. 677--691, Aug. 1986.
[15]
"ABC: A system for sequential synthesis and verification," in http://www.eecs.berkeley.edu/alanmi/abc/.

Cited By

View all
  • (2013)SEU fault evaluation and characteristics for SRAM-based FPGA architectures and synthesis algorithmsACM Transactions on Design Automation of Electronic Systems (TODAES)10.1145/2390191.239020418:1(1-18)Online publication date: 16-Jan-2013
  • (2011)Mitigating FPGA interconnect soft errors by in-place LUT inversionProceedings of the International Conference on Computer-Aided Design10.5555/2132325.2132458(582-586)Online publication date: 7-Nov-2011

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
DATE '10: Proceedings of the Conference on Design, Automation and Test in Europe
March 2010
1868 pages
ISBN:9783981080162

Sponsors

  • EDAA: European Design Automation Association
  • ECSI
  • EDAC: Electronic Design Automation Consortium
  • SIGDA: ACM Special Interest Group on Design Automation
  • The IEEE Computer Society TTTC
  • The IEEE Computer Society DATC
  • The Russian Academy of Sciences: The Russian Academy of Sciences

Publisher

European Design and Automation Association

Leuven, Belgium

Publication History

Published: 08 March 2010

Check for updates

Qualifiers

  • Research-article

Conference

DATE '10
Sponsor:
  • EDAA
  • EDAC
  • SIGDA
  • The Russian Academy of Sciences
DATE '10: Design, Automation and Test in Europe
March 8 - 12, 2010
Germany, Dresden

Acceptance Rates

Overall Acceptance Rate 518 of 1,794 submissions, 29%

Upcoming Conference

DATE '25
Design, Automation and Test in Europe
March 31 - April 2, 2025
Lyon , France

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 31 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2013)SEU fault evaluation and characteristics for SRAM-based FPGA architectures and synthesis algorithmsACM Transactions on Design Automation of Electronic Systems (TODAES)10.1145/2390191.239020418:1(1-18)Online publication date: 16-Jan-2013
  • (2011)Mitigating FPGA interconnect soft errors by in-place LUT inversionProceedings of the International Conference on Computer-Aided Design10.5555/2132325.2132458(582-586)Online publication date: 7-Nov-2011

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media