Nonconcurrent error detection and correction in fault-tolerant discrete-time LTI dynamic systems

被引:23
作者
Hadjicostis, CN [1 ]
机构
[1] Coordinated Sci Lab, Urbana, IL 61801 USA
[2] Univ Illinois, Dept Elect & Comp Engn, Urbana, IL 61801 USA
来源
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-FUNDAMENTAL THEORY AND APPLICATIONS | 2003年 / 50卷 / 01期
基金
美国国家科学基金会;
关键词
ABFT; fault tolerance; fault-tolerant digital filters; linear time-invariant (LTI) dynamic systems; nonconcurrent error detection and correction; state variable descriptions; transient faults;
D O I
10.1109/TCSI.2002.807522
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper develops resource-efficient alternatives to modular redundancy for fault-tolerant discrete-time (DT) linear time-invariant (LTI) dynamic systems. The proposed method extends previous approaches that are based on embedding the state of a given DT LTI dynamic system into the redundant state-space of a DT LTI dynamic system of higher state dimension. These embeddings, as well as the embeddings studied in this paper, preserve the state evolution of the original system in some linearly encoded form and allow error detection and correction to be performed through concurrent parity checks (i.e., parity checks that are evaluated at the end of each time step). The novelty of the approach developed in this paper relies on carefully choosing the redundant dynamics of the fault-tolerant implementation in a way that allows parity checks to capture the evolution of errors in the system and, based on nonconcurrent parity checks (e.g., parity checks that are evaluated periodically), uniquely determine the initial value of each error, the time step at which it took place and the state variable it originally affected. The resulting error detection, identification, and correction procedures can be performed periodically and can significantly reduce the overhead, complexity and reliability requirements on the checking mechanism.
引用
收藏
页码:45 / 55
页数:11
相关论文
共 28 条
[11]   ALGORITHM-BASED FAULT TOLERANCE FOR MATRIX OPERATIONS [J].
HUANG, KH ;
ABRAHAM, JA .
IEEE TRANSACTIONS ON COMPUTERS, 1984, 33 (06) :518-528
[12]  
JOHNSON BW, 1989, DESIGN ANAL FAULT TO
[13]   FAULT-TOLERANT FFT NETWORKS [J].
JOU, JY ;
ABRAHAM, JA .
IEEE TRANSACTIONS ON COMPUTERS, 1988, 37 (05) :548-561
[14]  
JOU JY, 1986, P IEEE, V74, P732, DOI 10.1109/PROC.1986.13535
[15]  
KAILATH T., 1979, Linear systems
[16]  
Luenberger DG., 1979, Introduction to Dynamic Systems: Theory, Models, and Applications
[17]   REAL-NUMBER CODES FOR FAULT-TOLERANT MATRIX OPERATIONS ON PROCESSOR ARRAYS [J].
NAIR, VSS ;
ABRAHAM, JA .
IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (04) :426-435
[18]  
Oppenheim AV, 1999, DISCRETE TIME SIGNAL, V2nd
[19]  
Pradhan D. K., 1996, FAULT TOLERANT COMPU
[20]   Generalized Algorithm-Based Fault Tolerance: Error correction via Kalman estimation [J].
Redinbo, GR .
IEEE TRANSACTIONS ON COMPUTERS, 1998, 47 (06) :639-655