Flexible Word-Size Transition Encoder Without Bit Padding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing transition encoding methods often require specific word sizes that do not align with byte-sized data, necessitating bit padding or additional alignment hardware, increasing complexity and cost.
Innovation Solution
A transition encoder that encodes input data with a flexible word size and run-length limit, using a subset of bits as group IDs to organize words into groups, determine a coding key value, and apply XOR operations to ensure frequent transitions, eliminating the need for bit padding and alignment hardware.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of manufacture
If existing transition encoding methods use fixed word sizes, then encoding can be simplified, but byte-sized data requires bit padding or alignment hardware increasing complexity and cost
Solution Approach 1:
The patent changes the parameter of word size from fixed to flexible, allowing the encoder to adapt to any input data size including byte-sized data without requiring bit padding or alignment hardware. This is achieved by dynamically adjusting the encoding parameters based on the actual input data characteristics.
Solution Approach 2:
The transition encoder is designed to handle multiple data sizes and formats universally, eliminating the need for separate alignment hardware for different data types. The encoder can process byte-sized data, variable-length data, and other formats using the same core encoding mechanism.
2Ease of manufacture
If bit padding is used to align data, then fixed word size encoding can be applied, but overhead increases and efficiency decreases
Solution Approach 1:
The patent eliminates the need for bit padding by changing the encoding approach to accommodate variable data sizes directly. The encoder adjusts its internal parameters to match the actual input data length, thereby avoiding the addition of redundant padding bits and reducing overall data overhead.
Solution Approach 2:
The patent extracts and eliminates the unnecessary bit padding component from the encoding process. By removing this redundant element, the system achieves more efficient data transmission without sacrificing the ability to handle fixed or variable word sizes.
3Reliability
If transition encoding ensures frequent transitions, then clock recovery is improved, but encoding complexity increases
Solution Approach 1:
The patent employs dynamic encoding strategies that adapt to the input data characteristics. The encoder dynamically adjusts transition patterns based on the actual data being encoded, ensuring sufficient transitions for reliable clock recovery while avoiding unnecessary complexity through adaptive rather than rigid encoding rules.
Solution Approach 2:
The encoding algorithm dynamically changes parameters such as transition density and encoding depth based on the input data properties. This allows the system to maintain reliable clock recovery across different data types and sizes without requiring a uniformly complex encoding approach for all cases.
Applied Scientific Principles
This section explains which scientific principles are used to turn an abstract innovation direction into a practical engineering solution.
Function Achieved in This Case
Simplifies transmitter/receiver design and reduces system cost by allowing byte-sized data encoding with any run-length limit, without adding overhead, and enabling efficient clock recovery.
Implementation Method 1
determining a key value based on the pre bits, the groupID bits, and the post bits of one of the plurality of input words corresponding to the key group; and generating a plurality of coded words based on the key value and the plurality of input words
Data Source
Figure 1A
Figure 1B~2
Figure 3
AI summary
A method of encoding input data includes identifying an input packet of the input data, the input packet including a plurality of input words, each of the input words including pre bits, groupID bits, and post bits, organizing the plurality of input words into a plurality of groups based on groupID bits of the plurality of input words, identifying a key group of the plurality of groups based on a number of input words in each of the plurality of groups, determining a key value based on the pre bits, the groupID bits, and the post bits of one of the plurality of input words corresponding to the key group, and generating a plurality of coded words based on the key value and the plurality of input words.