Patent · US Expired

Binary parallel computing arrangement for additions or subtractions

US3947671A · kind A · utility

7Cited by
0References
8Claims
0Family size

Assignee

Inventors

Key dates

Filing dateJun 23, 1975
Grant dateMar 30, 1976
Priority date
Expiry dateJun 23, 1995

Classification

  • Technology area (CPC G)Physics
  • CPC primaryG06F7/5052
  • WIPO fieldComputer technology
  • WIPO sectorElectrical engineering

Abstract

A parallel adder with sequential carry ripple is subdivided into sections. Detector circuits are distributed over the various digit positions of the adder. Each detector circuit receives the digit pairs of the input operands of at least one adder position. The detection circuits indicate the beginning or the end of a carry ripple chain by testing the condition "both input digits zero or both input digits one". Via a coder, the output signals of the detection circuits are combined in the form of group indicating signals, each of which corresponds to a predetermined distance between the digit positions. By means of the group indicating signals a clock circuit is controlled in such a manner that the operating time is limited to the time required for carry rippling.

Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.