Low-Overhead Transition Encoding to Eliminate All-Zero and All-One Words
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In electronic data communications, clock recovery processes fail when data run lengths exceed a certain length due to insufficient transitions, leading to issues in synchronizing communications between senders and receivers.
Innovation Solution
The implementation of a system that encodes original data into encoded data packets, ensuring no words are all-zeroes or all-ones, thereby guaranteeing a limited run length and ensuring transitions occur regularly, using a processing circuit to identify and encode data based on absent values as encoder values D1 and D2, and transmitting these values along with the encoded data.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If data is transmitted without encoding, then transmission overhead is minimized, but clock recovery fails when run length exceeds a certain length
Solution Approach 1:
The patent applies parameter changes by modifying the data representation parameters - specifically transforming q-bit words through a one-to-one mapping function that changes the value distribution while maintaining the same bit width. This allows the encoded data to satisfy run-length constraints without increasing the fundamental data width, thus improving clock recovery reliability while keeping the encoding relatively simple.
Solution Approach 2:
The patent implements preliminary action by pre-defining a mapping relationship between original q-bit values and encoded q-bit values based on two selected encoder values D1 and D2. This pre-established mapping is stored in lookup tables, allowing the encoding to be performed efficiently without complex real-time calculations, thereby reducing encoding complexity while ensuring reliable clock recovery.
2Reliability
If encoding is performed to limit run length, then transitions are ensured for clock recovery, but data overhead increases due to encoder values
Solution Approach 1:
The patent applies partial action by transmitting only a portion of the information needed for full encoding - specifically, only two encoder values D1 and D2 are transmitted as overhead, while the actual encoding mapping is derived from these two values. This partial transmission approach ensures transition guarantees through the encoded data while minimizing overhead by not transmitting the complete mapping table.
Solution Approach 2:
The patent extracts the essential encoding information into just two representative values D1 and D2, which are then transmitted as overhead. The complete mapping relationship is implicitly defined by these two extracted values, allowing the receiver to reconstruct the full mapping without transmitting all possible mappings. This extraction approach reduces data overhead while maintaining transition guarantees.
3Reliability
If q-bit words are encoded using a one-to-one mapping, then all-zero and all-ones words are eliminated, but encoding and decoding complexity increases
Solution Approach 1:
The patent implements preliminary action by pre-computing and storing the one-to-one mapping relationship in lookup tables during system initialization or manufacturing. The mapping tables are generated based on the selected encoder values D1 and D2, allowing both encoding and decoding operations to be performed by simple table lookups rather than complex calculations during data transmission, thus reducing operational complexity while maintaining run-length limitations.
Solution Approach 2:
The patent uses copying by creating a predefined mapping table that copies the transformation relationship from the original value space to the encoded value space. Once the mapping table is established, both encoding (original to encoded) and decoding (encoded to original) operations simply copy values between tables, eliminating the need for complex computational logic during operation and reducing device complexity.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
A processing circuit configured to: receive original data; partition the original data into a plurality of original q-bit words; assemble a data packet including N original q-bit words from the plurality of original q-bit words; identify a first encoder value and a second encoder value that are absent from the values of the N original q-bit words; encode the N original q-bit words based on a one-to-one mapping from q-bit original values to q-bit encoded values based on the first encoder value and the second encoder value to generate N encoded q-bit payload words, the N encoded q-bit payload words being free of words that are all-zeroes and free of words that are all-ones; generate a key representing the first encoder value and the second encoder value; and transmit the key and the N encoded q-bit payload words.