By Topic

Nonconcurrent error detection and correction in fault-tolerant linear finite-state machines

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Hadjicostis, C.N. ; Dept. of Electr. & Comput. Eng., Univ. of Illinois, Urbana, IL, USA

In this paper, we construct fault-tolerant linear finite-state machines (LFSMs) in which error detection and correction can be performed nonconcurrently (e.g., periodically). More specifically, by jointly choosing the state encoding constraints and the redundant dynamics of the fault-tolerant LFSM, we enable an external checker to detect and identify errors due to past faults based on the current, possibly corrupted state of the LFSM. The paper presents systematic constructions of fault-tolerant LFSMs based on a characterization of nonconcurrent error detection/correction in terms of state encoding constraints and redundant dynamics. In particular, we develop a scheme that uses Bose-Chaudhuri-Hocquenghem (BCH) coding and obtains fault-tolerant LFSMs that require 2D additional state variables and have the ability to correct up to D errors in any state variable at any time step in the time interval consisting of the latest N time steps of operation. The construction uses the minimum possible number of additional state variables and requires an error detecting/correcting mechanism with computational complexity that is only linear in N.

Published in:

Automatic Control, IEEE Transactions on  (Volume:48 ,  Issue: 12 )