Transition Encoding Codes With Low-Overhead Run-Length Limiting
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In serial data communication, existing methods require redundant bits for transition encoding to ensure frequent transitions, impacting transmission efficiency and complicating clock recovery at the receiver.
Innovation Solution
A method and system that use very-low-overhead and high-code-efficiency run-length-limited transition codes by base-converting input data packets from a higher base system to a lower base system, incrementing digits, and ensuring run-length limitations to facilitate efficient clock recovery.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If transition encoding is used to ensure frequent transitions for clock recovery, then clock recovery capability is improved, but transmission efficiency deteriorates due to redundant overhead bits
Solution Approach 1:
The patent changes the parameter of run-length limitation from conventional values to optimized values (e.g., limiting runs to at most 4 consecutive identical symbols), and modifies the encoding scheme from traditional transition encoding to a more efficient symbol-based encoding that achieves clock recovery with fewer overhead bits. This resolves the contradiction by finding optimal parameter values that balance reliability and productivity.
Solution Approach 2:
Instead of ensuring transitions in every symbol sequence (excessive action), the patent applies partial action by allowing limited runs of identical symbols (up to a specified limit) while still guaranteeing sufficient transitions for clock recovery. This partial approach reduces the number of required overhead bits while maintaining adequate clock recovery capability.
2Reliability
If redundant bits are added for transition encoding, then clock recovery is facilitated, but code efficiency deteriorates
Solution Approach 1:
The patent optimizes the run-length parameter to allow longer sequences of identical symbols compared to conventional encoding, thereby reducing the frequency of required transitions and the associated overhead bits. This parameter optimization directly improves code efficiency while maintaining sufficient clock recovery capability.
Solution Approach 2:
The patent applies partial action by not forcing transitions at every possible opportunity, but only when necessary to meet the run-length limitation criterion. This selective application of transition encoding reduces the number of redundant bits compared to exhaustive transition encoding schemes.
3Stability of the object's composition
If conventional transition encoding is used, then transitions are ensured regularly, but overhead increases impacting transmission efficiency
Solution Approach 1:
The patent changes the transition regularity parameter from strict periodic transitions to transitions governed by a probabilistic run-length limitation model. This allows more flexible and efficient encoding while maintaining sufficient transition regularity for clock recovery, thereby reducing overhead bits.
Solution Approach 2:
Instead of ensuring transitions in all possible cases (excessive action), the patent uses partial action by limiting transitions only when the run-length exceeds the specified threshold. This reduces the number of overhead bits while maintaining adequate transition regularity for reliable clock recovery.
Data Source
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.