U.S. patents available from 1976 to present.
U.S. patent applications available from 2005 to present.

High speed digital computing system

Patent 5132921 Issued on July 21, 1992. Estimated Expiration Date: Icon_subject November 13, 2009. Estimated Expiration Date is calculated based on simple USPTO term provisions. It does not account for terminal disclaimers, term adjustments, failure to pay maintenance fees, or other factors which might affect the term of a patent.

Patent References

3519810

3535502

3700875

Binary adder
Patent #: 4052604
Issued on: 10/04/1977
Inventor: Maitland ,   et al.

Integrated digital multiplier circuit using current mode logic
Patent #: 4215418
Issued on: 07/29/1980
Inventor: Muramatsu

High speed multiplier using carry-save/propagate pipeline with sparse carries
Patent #: 4228520
Issued on: 10/14/1980
Inventor: Letteney ,   et al.

One-bit full adder circuit
Patent #: 4449197
Issued on: 05/15/1984
Inventor: Henry ,   et al.

Digital arithmetic unit having shortened processing time and a simplified structure
Patent #: 4675837
Issued on: 06/23/1987
Inventor: Ulbrich ,   et al.

Data processing system with an arithmetic logic unit having improved carry look ahead
Patent #: 4677584
Issued on: 06/30/1987
Inventor: Steck

CMOS full adder circuit
Patent #: 4689763
Issued on: 08/25/1987
Inventor: Fang

More ...

Inventors

Application

No. 434612 filed on 11/13/1989

US Classes:

708/701, Bipolar junction transistor only or combined with Field-Effect Transistor708/708Carry-save adders

Examiners

Primary: LaRoche, Eugene R.
Assistant: Lee, Benny

Attorney, Agent or Firm

Foreign Patent References

  • 214836 EP. 03/13/1987
  • 3524797 DE. 01/13/1987
  • 86/04699 WO. 08/13/1986
  • 1191906 SU 11/13/1985

International Class

G06F 007/50

Abstract

A digital computing system comprises first, second, third, fourth, fifth, and sixth multi-bit binary signal sources and first and second binary adders. Each binary adder has a plurality of parallel stages equal in number to the bits of the signals. Each stage of each adder has a first full adder and a second full adder. Each full adder has an addend input, an augend input, a carry input, a sum output, and a carry output. In the first adder, the first source is connected to the addend input of the first full adder, the second source is connected to the augend input of the first full adder, the third source is connected to the carry input of the first full adder, the sum output of the first full adder is connected to the addend input of the second full adder, the carry output of the first full adder is connected to the carry input of the next higher order stage of the second full adder, and the fourth source is connected to the augend input of the second full adder. The full adders are implemented with low-level, non-saturating, bipolar differential logic circuitry, which greatly reduces the power dissipation at high data processing speeds. The circuitry is physically laid out on an integrated circuit chip so the stages within an adder are contiguous to each other in bit order and/or the corresponding stages of different adders are aligned with each other.

Other References

  • Shen, D. T. et al., "4-2 Carry-Save Adder Implementation Using Send Circuits", IBM Technical Disclosure Bulletin; vol. 20, No. 9; Feb. 1978; pp. 3594-3597
  • Weinberger, A.; "4-2 Carry-Save Adder Module"; IBM Technical Disclosure Bulletin; vol. 23, No. 8; Jan. 1981; pp. 3811-3814
  • Beraud, J. P. et al., "High Speed Accumulator"; IBM Technical Disclosure Bulletin; vol. 17, No. 1; Jun. 1974; pp. 118-11
PatentsPlus Images
Enhanced PDF formats
loading...
PatentsPlus: add to cart
PatentsPlus: add to cartSearch-enhanced full patent PDF image
$9.95more info
PatentsPlus: add to cart
PatentsPlus: add to cartIntelligent turbocharged patent PDFs with marked up images
$16.95more info
 
Sign InRegister
Username  
Password   
forgot password?