C. N. Hadjicostis, Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems, Kluwer, 2002. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Finite-State Machine Embeddings for Non-Concurrent.. - Christoforos.. Self-citation (Hadjicostis) (Correct)
No context found.
C. N. Hadjicostis, Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems. Boston, Massachusetts: Kluwer Academic Publishers, 2002.
Non-Concurrent Error Detection and Correction in Fault-Tolerant .. - Hadjicostis (2002) Self-citation (Hadjicostis) (Correct)
No context found.
C. N. Hadjicostis, Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems. Boston, Massachusetts: Kluwer Academic Publishers, 2002.
Fault Protection of Digital Sequential Systems Using.. - Hadjicostis, Ernst (2004) Self-citation (Hadjicostis) (Correct)
No context found.
C. N. Hadjicostis, Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems. Boston, Massachusetts: Kluwer Academic Publishers, 2002.
Non-Concurrent Error Detection and Correction in Fault-Tolerant .. - Hadjicostis (2002) Self-citation (Hadjicostis) (Correct)
.... to fault tolerant computation, operates by replicating the computational system [27] A potentially more ecient approach to fault tolerance is the use of arithmetic coding [19] and algorithm based fault tolerance (ABFT) techniques [10, 12, 13, 24, 26] These approaches involve three main steps [8]: i) adding analytical redundancy into the representation of the input by using suitable input encodings; ii) performing a redundant operation on the encoded data in a way that allows for error detection and correction on the obtained, possibly faulty result; and (iii) decoding the corrected ....
....checks (e.g. checks that are performed periodically) thereby relaxing the stringent requirements on the reliability of the error corrector. In the rest of this section we establish the notation and mathematical preliminaries that will be used throughout the paper (more details can be found in [8, 7]) A DT LTI dynamic system S has a linear state evolution equation of the form q s [t 1] Aq s [t] Bx[t] 1) where t is the discrete time index, q s [t] is the state vector at time step t and x[t] is the input at time step t. We assume that q s [ is d dimensional, x[ is m dimensional, ....
[Article contains additional citation context not shown here]
C. N. Hadjicostis. Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems. Kluwer Academic Publishers, Boston, Massachusetts, 2002.
Non-Concurrent Error Detection and Correction in Fault-Tolerant .. - Hadjicostis (2002) Self-citation (Hadjicostis) (Correct)
....the numerous examples in communication and data storage applications [1, 14] these approaches have also been applied to computational systems to protect against transient or permanent hardware faults. Examples of such approaches include arithmetic coding and algorithm based fault tolerance (see [5] for a comprehensive overview of these techniques in combinational and dynamic systems) In this spirit, our previous work [4, 8] discussed fault tolerance in linear finite state machines (LFSMs) In that approach, by concurrently detecting and analyzing violations on an enforced state encoding, ....
....6 6 0 0 0 7 7 7 7 in GF (2) and is implemented using single bit memory elements and (2 input) XOR gates that are interconnected in a circuit with delay free paths of unit length. This guarantees that a fault in a single XOR gate or a single connection corrupts at most one state variable [5, 7]. Binary addition in GF (2) can be performed using 2 input XOR gates. 2 In order to protect a given LFSM S [with d state variables and state evolution as in Eq. 1) against corruptions of variables in its state vector, the approach in [4, 8] embeds it into a redundant LFSM H with state ....
[Article contains additional citation context not shown here]
C. N. Hadjicostis. Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems. Kluwer Academic Publishers, Boston, 2001.
Encoded Finite-State Machines for Non-Concurrent Error.. - Hadjicostis Self-citation (Hadjicostis) (Correct)
.... and algorithm based fault tolerance (ABFT) techniques [3, 4] In the same spirit, a number of researchers focused on protecting discrete time (DT) dynamic systems, including linear time invariant dynamic systems, linear finitestate machines (LFSMs) and arbitrary finite state machines (FSMs) see [5] for an overview of these techniques. These approaches achieve fault tolerance by mapping the state of a given DT dynamic system into the higher dimensional state space of a larger, redundant DT dynamic system, in a way that preserves the evolution and state of the original one while enabling an ....
C. N. Hadjicostis, Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems. Boston, Massachusetts: Kluwer Academic Publishers, 2002.
Self-Stabilizing Microprocessor - Analyzing and Overcoming.. - Dolev, Haviv (2004) (1 citation) (Correct)
No context found.
C. N. Hadjicostis, Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems, Kluwer, 2002.
Defect Tolerant Probabilistic Design Paradigm for.. - Jacome, He, de.. (Correct)
No context found.
C. N. Hadjicostis, Coding Approaches to Fault Tolerance in Combinational and Dynamic Systems, Kluwer Academic Publishers, 2001.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC