[Paper Review] Boolean Logic with Fault Tolerant Coding

Barış Baykant Alagöz|ArXiv.org|Mar 24, 2009

Quantum Computing Algorithms and Architecture2 references3 citations

TL;DR

This paper proposes a fault-tolerant Boolean logic framework using three-bit Hamming codes to enable auto-recovery from single-bit errors without additional redundancy. By encoding logic operations in Hamming space, the method ensures error detection and correction, demonstrating that basic Boolean gates can be implemented with intrinsic fault tolerance using minimal coding overhead.

ABSTRACT

Error detectable and error correctable coding in Hamming space was researched to discover possible fault tolerant coding constellations, which can implement Boolean logic with fault tolerant property. Basic logic operators of the Boolean algebra were developed to apply fault tolerant coding in the logic circuits. It was shown that application of three-bit fault tolerant codes have provided the digital system skill of auto-recovery without need for designing additional-fault tolerance mechanisms.

Motivation & Objective

• To develop a fault-tolerant coding scheme for Boolean logic circuits that enables automatic error recovery.
• To investigate whether Hamming space coding can be applied to logic operations to achieve intrinsic fault tolerance.
• To demonstrate that three-bit codes can implement Boolean gates with built-in error detection and correction capability.
• To eliminate the need for separate fault-tolerance mechanisms by embedding error resilience directly into logic design.

Proposed method

• Encoding Boolean logic operations using three-bit Hamming codes to represent logic states.
• Mapping standard Boolean operators (AND, OR, NOT) to operations in Hamming space that preserve error-detection and correction properties.
• Using Hamming distance principles to detect and correct single-bit errors during logic computation.
• Designing logic circuits where input and output states are constrained to valid Hamming codewords to maintain fault tolerance.
• Verifying that logic operations remain functionally correct even when single-bit errors occur during computation.
• Demonstrating that no additional fault-tolerance hardware is required, as error resilience is inherent in the coding scheme.

Experimental results

Research questions

• RQ1 Can Boolean logic operations be implemented using fault-tolerant coding in Hamming space to achieve auto-recovery from errors?
• RQ2 What is the minimal code length required to enable both error detection and correction in logic circuits?
• RQ3 How can standard logic gates be redefined to operate within a Hamming-coded framework without external error-handling circuits?
• RQ4 To what extent does the use of three-bit codes preserve functional correctness under single-bit error conditions?
• RQ5 Can the proposed method eliminate the need for separate fault-tolerance mechanisms in digital systems?

Key findings

• Three-bit Hamming codes enable the implementation of basic Boolean logic gates with intrinsic fault tolerance.
• The method allows digital systems to auto-recover from single-bit errors without requiring additional fault-tolerance circuitry.
• Error detection and correction are achieved through the inherent properties of Hamming codes during logic computation.
• The coding scheme maintains functional correctness of logic operations even when single-bit errors occur in intermediate states.
• The approach demonstrates that fault tolerance can be embedded directly into logic design via coding, reducing system complexity.
• The results confirm that Hamming space coding provides a viable, minimal-overhead solution for fault-tolerant Boolean logic.