Transition Encoding with Running XOR to Limit Error Propagation

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

In serial data communication, error propagation occurs when there is an error in the key value during transmission, causing incorrect decoding of all words coded with the key, which necessitates retransmission and reduces the transmission rate.

Innovation Solution

A transition encoder preprocesses the input data using a running XOR operation and applies a key value to generate coded words, allowing the receiver to decode by performing XOR operations on consecutive coded words, thereby limiting error propagation to at most two words.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Speed

If a key value is applied to encode all words in the data stream to ensure transition encoding, then transition frequency is improved, but error propagation increases causing all decoded words to be corrupted when a key error occurs

Engineering Contradiction:
Improvetransition frequencyVSAvoiderror propagation
Core Design Contradiction:
SpeedVSReliability

Solution Approach 1:

The patent segments the encoding process by applying the key value differently to different groups of words. Specifically, it divides the data stream into segments where the key is applied to even-positioned words and a different key (or no key) is applied to odd-positioned words. This segmentation prevents error propagation from affecting all decoded words, as an error in one key only impacts its associated segment rather than the entire data stream.

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

The patent applies local quality by using different encoding strategies for different positions or types of words within the data stream. Instead of uniformly applying the same key to all words, it varies the key application locally - for example, applying key value K1 to even-indexed words and K2 to odd-indexed words. This local differentiation ensures that transition encoding requirements are met while limiting the scope of error propagation to local segments only.

Inventive Principle:
Principle #3Local quality

2Reliability

If transition encoding is applied to ensure sufficient transitions for clock recovery, then clock recovery reliability is improved, but decoding complexity increases due to key value management

Engineering Contradiction:
Improveclock recoveryVSAvoiddecoding complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

The patent extracts the key value management complexity from the main decoding process by explicitly transmitting key values as separate overhead elements in the data stream. Instead of requiring the receiver to derive or track keys through complex state machines, the keys are extracted and transmitted openly, allowing the receiver to simply retrieve and apply them during decoding. This reduces decoding complexity while maintaining transition encoding benefits for reliable clock recovery.

Inventive Principle:
Principle #2Taking out (Extraction)

Solution Approach 2:

The patent introduces key values as intermediary elements that mediate between the original data and the encoded transmission stream. These intermediary keys serve as a bridge that simplifies the encoding/decoding relationship - the receiver uses these intermediary key values to systematically transform the encoded stream back to original data without needing to understand or track complex encoding states, thereby reducing decoding complexity while ensuring sufficient transitions.

Inventive Principle:
Principle #24Intermediary (Mediator)

Data Source

PatentUS11764805B2System and method for transition encoding with reduced error propagation
Publication Date: 2023.09.19 SAMSUNG DISPLAY CO LTD
  • US11764805B2 patent drawing
  • US11764805B2 patent drawing
  • US11764805B2 patent drawing

AI summary

A method of encoding input data includes receiving the input data that includes a plurality of input words including a first input word and a second input word, generating a plurality of converted words including a first converted word and a second converted word, the first converted word being based at least on the first input word, the second converted word being based on the first converted word and the second input word, identifying a key value based on the plurality of converted words, and generating a plurality of coded words based on the key value and the plurality of converted words.