High speed BiCMOS conditional sum adder

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

307446, G06F 750, H03K 1902

Patent

active

051630206

ABSTRACT:
An N-bit conditional sum adder 8 includes first and second conditional sum adders 10a and 10b. Each of the adders may be built from a plurality of one-bit conditional sum adders 110. In one embodiment, each one-bit adder 110 comprises a XNOR gate 50, a XOR gate 52, a NAND gate 54 and a NOR gate 56. The carry outputs CO.sub.a and CO.sub.b of the first conditional sum adder 10.sub.a are coupled to BiCMOS drivers 12 and 14 which in turn are coupled to the select inputs of a plurality of multiplexers 16 and 18. The multiplexers may be CMOS multiplexers built from transmission gates.

REFERENCES:
patent: 4678943 (1987-07-01), Uragami et al.
patent: 4689503 (1987-08-01), Suzuki et al.
patent: 4918640 (1990-04-01), Heimsch et al.
patent: 4937480 (1990-06-01), Higuchi et al.
patent: 5047976 (1991-09-01), Goto et al.
Rothermel et al., "Realization of Transmission-Gate Conditional-Sum (TGCS) Adders with Low Latency Time", IEEE Journal of Solid-State Circuits, vol. 24, No. 3, Jun. 1989, pp. 558-561.
J. Sklansky, "Conditional-Sum Addition Logic", IRE Transactions on Electronic Computers , Jun. 1960, pp. 226-231.
Gallia et al, "BiCMOS ASIC for High Performance Systems", pp. 1-4 May 1990.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

High speed BiCMOS conditional sum adder does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with High speed BiCMOS conditional sum adder, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High speed BiCMOS conditional sum adder will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-2299766

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.