Hexadecimal Digital Root Error Detection Circuit

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional error detection methods fail to reliably verify the integrity of data within processor registers and results of operations in advanced high-speed computer processors, leading to potential data corruption and system crashes, and existing fault-tolerant methods are costly and resource-intensive.

Innovation Solution

Employing hexadecimal digital roots (HDRs) for fast verification of register operations and moves, utilizing combinatorial logic to compute HDRs in a single clock cycle, allowing for high-speed error detection with minimal impact on processor resources.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional error detection methods (parity bits, checksums, ECC) are used, then data integrity is improved, but device complexity and resource overhead increase significantly

Engineering Contradiction:
Improvedata integrityVSAvoidresource overhead
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent extracts only the essential error detection capability by using a simplified checksum method that operates on a subset of data bits rather than requiring full ECC codes or parity bits for all data. This selective extraction of error detection function reduces the overhead while maintaining reliability for the most critical error cases.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent employs a lightweight checksum mechanism that requires minimal computational resources and can be rapidly computed and discarded, unlike expensive ECC schemes. The checksum serves as a disposable, low-cost verification layer that provides adequate protection without the heavy resource burden of more complex error correction codes.

Inventive Principle:
Principle #27Cheap short-living objects (Disposable)

2Reliability

If fault-tolerant computing systems with redundancy schemes are implemented, then system reliability is improved, but processing speed and productivity decrease

Engineering Contradiction:
Improvesystem reliabilityVSAvoidprocessing speed
Core Design Contradiction:
ReliabilityVSProductivity

Solution Approach 1:

The patent applies partial error detection by using checksums on selected critical fields rather than implementing full redundancy schemes across all data. This partial action approach provides sufficient reliability for the most error-prone operations without the complete overhead of triple modular redundancy or other extensive fault-tolerant mechanisms, thus preserving processing speed.

Inventive Principle:
Principle #16Partial or excessive action

3Reliability

If comprehensive error detection and correction schemes are applied to all data, then data integrity is improved, but processing time and duration increase

Engineering Contradiction:
Improvedata integrityVSAvoidprocessing time
Core Design Contradiction:
ReliabilityVSDuration of action of moving object

Solution Approach 1:

The patent applies error detection with local quality by focusing checksum verification on specific critical data fields and operations rather than uniformly applying comprehensive error detection to all data. This selective approach maintains data integrity for the most vulnerable operations while minimizing the processing time overhead by skipping less critical data paths.

Inventive Principle:
Principle #3Local quality

Data Source

PatentUS7412475B1Error detecting arithmetic circuits using hexadecimal digital roots
Publication Date: 2008.08.12 ORACLE AMERICAN INC
  • US7412475B1 patent drawing
  • US7412475B1 patent drawing
  • US7412475B1 patent drawing

AI summary

Embodiments of the invention are directed to circuits and techniques for computer processor register integrity checking employing digital roots, and hexadecimal digital roots (HDRs) in particular, to validate the results of arithmetic operations and register moves. These circuits thus provide extra confidence that register operations were correctly executed. A hexadecimal digital root is computed for the result of each register computation and compared to the results of the same computation performed on the HDRs of the operands. The hexadecimal digital root approach may be simply implemented with standard combinatoric logic. Validation is accomplished in a single clock cycle so that there is no added system delay or latency. The circuits and methods described herein have comparatively little impact on processor real estate.