Transition Encoding via Base Conversion for Clock Recovery
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing serial data communication systems face inefficiencies due to the need for redundant bits to ensure frequent transitions in data streams, impacting transmission efficiency and complicating clock recovery at the receiver.
Innovation Solution
A transition encoding method that converts data packets into a lower base system, ensuring transitions in every digit while minimizing overhead, allowing efficient clock recovery with minimal computational complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If transition encoding is used to ensure frequent transitions in data streams, then clock recovery is improved, but transmission efficiency deteriorates due to redundant overhead bits
Solution Approach 1:
The patent changes the parameter of base system representation from conventional base-2 to lower base systems (base-(2q-2) or base-(2q-4)), which fundamentally alters how data is encoded. This parameter change enables the encoding scheme to achieve transition requirements with minimal or no overhead, resolving the contradiction between reliable clock recovery and transmission efficiency.
Solution Approach 2:
The patent segments the encoding process into two distinct parts: transition encoding (ensuring frequent transitions for clock recovery) and data compression (removing redundancy). By separating these functions, the patent achieves both reliable clock recovery and high transmission efficiency, as the transition encoding operates on compressed data with minimal additional overhead.
2Speed
If redundant bits are added to ensure sufficient transitions, then transitions frequency is improved, but code efficiency deteriorates
Solution Approach 1:
Instead of adding redundant bits to conventional binary representations to ensure transitions, the patent inverts the approach by representing data in lower base systems from the outset. This inversion naturally produces frequent transitions without requiring additional redundant bits, thereby maintaining code efficiency while achieving the desired transitions frequency for clock recovery.
3Reliability
If complex transition encoding algorithms are used, then transition reliability is improved, but computational complexity deteriorates
Solution Approach 1:
The patent extracts the transition encoding function from complex algorithmic processing and implements it through simple arithmetic operations in lower base systems. By taking out the complexity and replacing it with straightforward base conversion and increment operations, the patent achieves reliable transitions while minimizing computational complexity at both encoder and decoder.
Data Source
Figure 1A
Figure 1B~2
Figure 3
AI summary
A method of encoding input data includes dividing the input data into a plurality of data packets, an input packet of the plurality of data packets including a plurality of digits in a first base system, base-converting the input packet from the first base system to generate a base-converted packet including a plurality of converted digits in a second base system, the second base system having a base value lower than that of the first base system, and incrementing the converted digits to generate a coded packet for transmission through a communication channel.