Enhanced reliability of finite-state machines in FPGA through efficient fault detection and correction

被引:25
|
作者
Tiwari, A [1 ]
Tomko, KA
机构
[1] SUN Micro Syst, Sunnyvale, CA 94086 USA
[2] Univ Cincinnati, Dept Elect & Comp Engn & Comp Sci, Cincinnati, OH 45219 USA
关键词
fault tolerant FPGA design; FSM reliability; single event upset (SEU); soft errors;
D O I
10.1109/TR.2005.853438
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
SRAM based FPGA are subjected to ion radiation in many operating environments. Following the current trend of shrinking device feature size & increasing die area, newer FPGA are more susceptible to radiation induced errors. Single event upsets (SEU), (also known as soft-errors) account for a considerable amount of radiation induced errors. SEU are difficult to detect & correct when they affect memory-elements present in the FPGA, which are used for the implementation of finite state machines (FSM). Conventional practice to improve FPGA design reliability in the presence of soft-errors is through configuration memory scrubbing, and through component redundancy. Configuration memory scrubbing, although suitable for combinatorial logic in an FPGA design, does not work for sequential blocks such as FSM. This is because the state-bits stored in flip-flops (FF) are variable, and change their value after each state transition. Component redundancy, which is also used to mitigate soft-errors, comes at the expense of significant area overhead, and increased power consumption compared to nonredundant designs. In this paper, we propose an alternate approach to implement the FSM using synchronous embedded memory blocks to enhance the runtime reliability without significant increase in power consumption. Experiments conducted on various benchmark FSM show that this approach has higher reliability, lower area overhead, and consumes less power compared to a component redundancy technique.
引用
收藏
页码:459 / 467
页数:9
相关论文
共 50 条
  • [41] SIMULATING CHAOTIC BEHAVIOR WITH FINITE-STATE MACHINES
    BINDER, PM
    JENSEN, RV
    PHYSICAL REVIEW A, 1986, 34 (05) : 4460 - 4463
  • [42] PROVING PROPERTIES OF A RING OF FINITE-STATE MACHINES
    SUZUKI, I
    INFORMATION PROCESSING LETTERS, 1988, 28 (04) : 213 - 214
  • [43] Structured fault-detection and diagnosis using finite-state automaton
    Ramkumar, KB
    Philips, P
    Presig, HA
    Ho, WK
    Lim, KW
    IECON '98 - PROCEEDINGS OF THE 24TH ANNUAL CONFERENCE OF THE IEEE INDUSTRIAL ELECTRONICS SOCIETY, VOLS 1-4, 1998, : 1667 - 1672
  • [44] SPECIFICATION AND SYNTHESIS OF COMMUNICATING FINITE-STATE MACHINES
    BELHADJ, H
    GERBAUX, L
    BERTRAND, MC
    SAUCIER, G
    IFIP TRANSACTIONS A-COMPUTER SCIENCE AND TECHNOLOGY, 1993, 22 : 91 - 102
  • [45] THE CONCATENATION AND PARTITIONING OF LINEAR FINITE-STATE MACHINES
    SUN, X
    KONTOPIDI, E
    SERRA, M
    MUZIO, J
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1995, 78 (05) : 809 - 839
  • [46] On a class of optimal abstractions of finite-state machines
    Oikonomou, KN
    FORMAL METHODS IN SYSTEM DESIGN, 1996, 8 (03) : 195 - 220
  • [47] Collapsing ε-loops in weighted finite-state machines
    Johnson, J. Howard
    FINITE-STATE METHODS AND NATURAL LANGUAGE PROCESSING, 2006, 4002 : 110 - 119
  • [48] LOWER BOUNDS ON THE AREA OF FINITE-STATE MACHINES
    FOSTER, MJ
    GREENBERG, RI
    INFORMATION PROCESSING LETTERS, 1989, 30 (01) : 1 - 7
  • [49] Encoded finite-state machines for non-concurrent error detection and identification
    Hadjicostis, CN
    PROCEEDINGS OF THE 2003 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOL III: GENERAL & NONLINEAR CIRCUITS AND SYSTEMS, 2003, : 858 - 861
  • [50] A UNIFIED APPROACH TO THE DEADLOCK DETECTION PROBLEM IN NETWORKS OF COMMUNICATING FINITE-STATE MACHINES
    PENG, WX
    PURUSHOTHAMAN, S
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 531 : 243 - 252