Fast binary counters based on symmetric stacking and methods for same
AssigneeThe Research Foundation for The State University of New York
InventorsChristopher FRITZ, Adly T. Fam
Life of this patent
Estimating the term…
Loading patent…
AssigneeThe Research Foundation for The State University of New York
InventorsChristopher FRITZ, Adly T. Fam
Estimating the term…
In this paper, binary stackers and counters are presented. In an embodiment, a counter uses 3-bit stacking circuits which group the T bits together, followed by a symmetric method to combine pairs of 3-bit stacks into 6-bit stacks. The bit stacks are then converted to binary counts, producing 6:3 and 7:3 Counter circuits with no XOR gates on the critical path. This avoidance of XOR gates results in faster designs with efficient power and area utilization. In VLSI simulations, the presently-disclosed counters were 30% faster and at consumed at least 20% less power than existing parallel counters. Additionally, using the presently-disclosed counter in existing Counter Based Wallace tree multiplier architectures reduces latency and improves efficiency in terms of power-delay product for 64-bit and 128-bit multipliers.
A method of stacking a 2b-bit binary vector, comprising:
A 2b-bit stacking circuit, comprising:
A method of counting a 6-bit binary vector, comprising:
A 6:3 counter, comprising:
A method of counting a 7-bit binary vector, comprising:
Dependencies are inferred from the claim text.