PMTR Coding for Low-Transition Data Without Error Propagation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Maximum transition run (MTR) codes increase power consumption and introduce error propagation when used in semiconductor systems, particularly when combined with error correction codes, and require faster clock frequencies, complicating timing closure.

Innovation Solution

The implementation of probability maximum transition run (PMTR) codes, which generate random bit sequences based on metrics to reduce consecutive transitions without introducing error propagation, using a PMTR modulator that selects bit sequences with lower transition run lengths and includes an index for demodulation, thereby avoiding the need for increased clock speeds.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Length of moving object

If MTR codes are used to limit consecutive transitions, then transition run length is reduced, but power consumption increases

Engineering Contradiction:
Improvetransition run lengthVSAvoidpower consumption
Core Design Contradiction:
Length of moving objectVSUse of energy by moving object

Solution Approach 1:

The patent changes the parameter of transition limitation from a strict maximum (MTR) to a probabilistic constraint (PMTR), where the likelihood of long transition runs is reduced without completely eliminating them. This allows the system to achieve transition control with lower power consumption by accepting occasional longer runs rather than enforcing strict limits on every transition sequence.

Inventive Principle:
Principle #35Parameter changes

2Length of moving object

If MTR codes are used to limit consecutive transitions, then transition run length is reduced, but error propagation is introduced

Engineering Contradiction:
Improvetransition run lengthVSAvoiderror propagation
Core Design Contradiction:
Length of moving objectVSReliability

Solution Approach 1:

Instead of applying full MTR constraint to all data bits, the patent applies PMTR selectively and probabilistically. The modulation code reduces transition runs for some bit sequences while allowing others to pass through with minimal modification, thereby reducing error propagation while still providing transition control where most beneficial.

Inventive Principle:
Principle #16Partial or excessive action

3Length of moving object

If MTR codes expand bit sequence length from k to n, then transition control is improved, but clock frequency must increase

Engineering Contradiction:
Improvetransition control capabilityVSAvoidclock frequency
Core Design Contradiction:
Length of moving objectVSSpeed

Solution Approach 1:

The patent changes the expansion ratio parameter from the traditional MTR n/k where n>k to a PMTR scheme that maintains or reduces the effective bit rate. By using probabilistic modulation with selective bit expansion only when necessary for transition control, the system avoids the need for proportionally higher clock frequencies while still achieving transition run limitation.

Inventive Principle:
Principle #35Parameter changes

Data Source

PatentUS8914705B1Probability maximum transition run codes
Publication Date: 2014.12.16 SK HYNIX MEMORY SOLUTIONS AMERICA INC
  • US8914705B1 patent drawing
  • US8914705B1 patent drawing
  • US8914705B1 patent drawing

AI summary

A plurality of random bit sequences is generated. Each of the random bit sequences is different and is based at least in part on an input bit sequence. A plurality of metrics corresponding to the plurality of random bit sequences is generated. The plurality of metrics is associated with one or more transition run lengths. One of the random bit sequences is selected based at least in part on the metrics. An output bit sequence is generated that includes the selected random bit sequence and an index associated with demodulating the selected random bit sequence.