High-speed multiplier having carry-save adder circuit

Boots – shoes – and leggings

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

364757, 364784, 364754, G06F 752, G05F 750

Patent

active

047529059

ABSTRACT:
A high-speed multiplier adapted to VLSI with a regularly arranged structure having a reduced number of addition stages. There is provided a carry save adder circuit wherein a time difference is imparted to signals input to full adders, in order to eliminate extra wait time in the signal propagation. That is, a carry signal of a full adder of two stages over is input with a speed increase of 1/2T.sub.FA.

REFERENCES:
patent: 4153938 (1979-05-01), Ghest et al.
patent: 4215419 (1980-07-01), Majerski
patent: 4293922 (1981-10-01), Davio et al.
patent: 4523210 (1985-06-01), Kregness
patent: 4545028 (1985-10-01), Ware
patent: 4549280 (1985-10-01), Schomburg
patent: 4571701 (1986-02-01), LeRouge
patent: 4575812 (1986-03-01), Kloker et al.
J. Iwamura et al., "A CMOS/SOS Multiplier", IEEE ISSCC Digest of Technical Papers, Feb. 1984, pp. 92-93.
M. Mano, "Computer System Architecture", Prentice-Hall, Inc., 1982, pp. 18-21.
D. Agrawal, "High-Speed Arithmetic Arrays", IEEE Trans. on Computers, vol. C-28, No. 3, Mar. 1979, pp. 215-224.

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 multiplier having carry-save adder circuit 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 multiplier having carry-save adder circuit, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and High-speed multiplier having carry-save adder circuit will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-933600

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