Bitwise comparator for selecting two smallest numbers from a set of numbers
AssigneeMarvell International Ltd.
InventorEngling Yeo
Life of this patent
Estimating the term…
Loading patent…
AssigneeMarvell International Ltd.
InventorEngling Yeo
Estimating the term…
A group of numbers from which the smallest and second-smallest are to be selected are compared in a cascaded tree. Each comparison stage will select the smallest number from two numbers output by the previous stage, into which four numbers are input. The second-smallest number is one of the other three inputs to the previous stage and, as before, all bits of the second-smallest number will not be known until the smallest number is determined. However, because at each stage of the determination, the next stage is reached because the bit values being examined are the same, those bit values of the second-smallest number (and indeed of the smallest number) are known ahead of the final determination of the smallest number. Accordingly, one can begin to output bits of the second-smallest number (as well as of the smallest number) even before that final determination.
A method for determining, from among four values represented by four signals input to a circuit, where a first two of said four values have been compared to determine a first minimum and a first maximum and a second two of said four values have been compared to determine a second minimum and a second maximum, which of said four values is a minimum value and which of said four values is a next-to-minimum value, said method comprising:
A method for determining, from among a group of values represented by a group of signals input to a circuit, which value in said group of values is a minimum value and which value in said group of values is a next-to-minimum value, said method comprising:
A low-density parity check decoder comprising:
A low-density parity check decoder comprising:
Dependencies are inferred from the claim text.