Sparse Comparator Decoding for Vector Signaling Receivers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The complexity and power consumption of multi-wire communication systems increase significantly due to the large number of differential comparators required to receive group-encoded signals, making them impractical for applications with more than a few inputs.
Innovation Solution
The use of a Sparse Comparator Unit (SCU) that employs a graph optimization method to select a subset of comparators, reducing the number of comparators needed while ensuring sufficient information for unique code word determination, by combining vector signaling codes and designing sub-codes that are decodable with fewer comparators.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If group-encoded signals are used to convey more information, then communication efficiency is improved, but the number of differential comparators required increases significantly
Solution Approach 1:
The patent extracts only the essential comparison operations needed to decode the code space. Instead of using all possible differential comparators (n²), the invention identifies and implements only the subset of comparators required to uniquely determine transmitted code words, removing redundant comparison operations while maintaining decoding capability.
Solution Approach 2:
The patent applies partial action by implementing fewer than the complete set of n² differential comparators. The invention determines that a partial set of comparators is sufficient to decode the transmitted signals by exploiting the structure of the code space and the redundancy inherent in group-encoded signaling.
2Measurement precision
If more differential comparators are used to receive group-encoded signals, then code word detection accuracy is improved, but power consumption increases
Solution Approach 1:
The patent extracts only the essential comparison operations needed for accurate code word detection. By identifying the minimal set of comparators that provide sufficient information to uniquely determine transmitted code words, the invention eliminates redundant power-consuming operations while maintaining detection accuracy.
Solution Approach 2:
The patent changes the parameter of comparator quantity from the conventional n² to a reduced subset. This parameter change is achieved through code-space analysis that identifies which specific comparator operations are necessary for accurate decoding, transforming the system from using all possible comparisons to using only the essential ones.
3Quantity of substance
If the number of wires is increased to transmit more bits, then communication capacity is improved, but the number of comparators grows quadratically
Solution Approach 1:
The patent extracts the essential comparison operations from the full n² set of differential comparators. By analyzing the code space structure and the information theory requirements for decoding, the invention identifies and retains only the subset of comparators necessary to handle increased wire counts and communication capacity without quadratic growth in complexity.
Solution Approach 2:
The patent transitions from a quadratic relationship (n² comparators for n wires) to a linear or sub-quadratic relationship by exploiting the structured code space. The invention uses code-word mapping and graph optimization to reduce the comparator requirement from O(n²) to O(n) or O(n log n), changing the dimensional relationship between wire count and comparator count.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
Methods and apparatuses are described to determine subsets of vector signaling codes capable of detection by smaller sets of comparators than required to detect the full code. The resulting lower receiver complexity allows systems utilizing such subset codes to be less complex and require less power.