Back to results
US 9,485,057 B2Granted
Vector signaling with reduced receiver complexity
AssigneeKandou Labs, S.A.
InventorAmin Shokrollahi
Life of this patent
Estimating the term…
Abstract
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.
Claims20
An apparatus comprising:
- a multi-wire bus configured to receive a set of N symbols of a codeword of a permutation-modulation (PM) code;
- first and second local sparse comparator units (SCUs), each local SCU comprising a respective set of M/2 graph-connected two-input comparators, wherein the first and second local SCUs are configured to receive a first N/2 symbols of the set of N symbols and a second N/2 symbols of the set of N symbols, respectively, and to generate a first M/2 fine codeword comparator outputs and a second M/2 fine codeword comparator outputs, respectively, wherein N is an even integer greater than 2 and M is an even integer 0<M<N*(N−1)/2;
- first and second arithmetic units, wherein the first and second arithmetic units are configured to receive the first N/2 symbols and the second N/2 symbols, respectively, and to generate respective first and second coarse codeword elements;
- and
- a global comparator unit comprising a two-input comparator, the global comparator unit configured to generate a coarse codeword comparator output based on a comparison between the first and second coarse codeword elements.
2 more elements
A method comprising:
- receiving a set of N symbols of a codeword of a permutation-modulation (PM) code via a multi-wire bus;
- receiving, at first and second local sparse comparator units (SCUs), a first N/2 symbols of the set of N symbols and a second N/2 symbols of the set of N symbols, respectively, and responsively generating, using respective first and second sets of M/2 graph-connected two-input comparators, a first M/2 fine codeword comparator outputs and a second M/2 fine codeword comparator outputs, respectively, wherein N is an even integer greater than 2 and M is an even integer 0<M<N*(N−1)/2;
- receiving, at first and second arithmetic units, the first N/2 symbols and the second N/2 symbols, respectively, and responsively generating respective first and second coarse codeword elements;
- and
- generating a coarse codeword comparator output based on a comparison between the first and second coarse codeword elements using a global comparator unit, the global comparator unit comprising a two-input comparator.
2 more elements
Dependencies are inferred from the claim text.