GB1468342A - Adder or priority-determining circuits for computers - Google Patents

Adder or priority-determining circuits for computers

Info

Publication number
GB1468342A
GB1468342A GB4476372A GB4476372A GB1468342A GB 1468342 A GB1468342 A GB 1468342A GB 4476372 A GB4476372 A GB 4476372A GB 4476372 A GB4476372 A GB 4476372A GB 1468342 A GB1468342 A GB 1468342A
Authority
GB
United Kingdom
Prior art keywords
stage
carry
cmos
logic
adder
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired
Application number
GB4476372A
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Hawker Siddeley Dynamics Ltd
Original Assignee
Hawker Siddeley Dynamics Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Hawker Siddeley Dynamics Ltd filed Critical Hawker Siddeley Dynamics Ltd
Priority to GB4476372A priority Critical patent/GB1468342A/en
Priority to NL7401039A priority patent/NL7401039A/xx
Priority to FR7402479A priority patent/FR2215654B3/fr
Priority to DE19742404145 priority patent/DE2404145A1/en
Publication of GB1468342A publication Critical patent/GB1468342A/en
Expired legal-status Critical Current

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F7/00Methods or arrangements for processing data by operating upon the order or content of the data handled
    • G06F7/38Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation
    • G06F7/48Methods or arrangements for performing computations using exclusively denominational number representation, e.g. using binary, ternary, decimal representation using non-contact-making devices, e.g. tube, solid state device; using unspecified devices
    • G06F7/50Adding; Subtracting
    • G06F7/501Half or full adders, i.e. basic adder cells for one denomination
    • G06F7/503Half or full adders, i.e. basic adder cells for one denomination using carry switching, i.e. the incoming carry being connected directly, or only via an inverter, to the carry output under control of a carry propagate signal

Landscapes

  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Engineering & Computer Science (AREA)
  • Computational Mathematics (AREA)
  • Mathematical Analysis (AREA)
  • Pure & Applied Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Computing Systems (AREA)
  • Mathematical Optimization (AREA)
  • General Engineering & Computer Science (AREA)
  • Logic Circuits (AREA)

Abstract

1468342 Adder and priority circuits HAWKER SIDDELEY DYNAMICS Ltd 5 March 1974 [28 Jan 1973] 44763/72 Heading G4A In a multistage binary parallel adder or priority resolving network each stage includes a complementary metal oxide semi-conductor (CMOS) transmission gate to propagate a signal rapidly to the succeeding stage. Adder.-A three stage complementing adder is shown, Fig. 1. CMOS gate 108 transmits the stage carry input to the carry output when the bit inputs to the stage (x, y) differ and CMOS gate 107 transmits an internally generated carry by the NAND of the bit inputs when these inputs are the same. Further CMOS gates 113, 114 generate SUM from the true and inverse carry inputs to the stage, formed by inverters 14, 15, in accordance with whether the stage bit inputs are the same or different, the equivalence, non- equivalence, and NAND outputs 104-106 being generated by CMOS logic 103 (not described). The Specification states that the carry propagating CMOS gates may be provided to transmit "block carry" signals between blocks in a block carry adder. Priority circuit.-Respective flip-flops produce Q=1 outputs when their request inputs are set. A CMOS gate 108, Fig. 3, in each stage propagates a logic "1" input 109 to the next stage unless Q = 1 in the stage whereupon logic "0" is propagated by CMOS gate 107. Whenever logic "0" is propagated, logic "0" is propagated to all succeeding stages. Each stage output is the AND combination of the propagated input to the stage and the stage Q output so that only the highest priority set request input results in a logic "1" output.
GB4476372A 1973-01-28 1973-01-28 Adder or priority-determining circuits for computers Expired GB1468342A (en)

Priority Applications (4)

Application Number Priority Date Filing Date Title
GB4476372A GB1468342A (en) 1973-01-28 1973-01-28 Adder or priority-determining circuits for computers
NL7401039A NL7401039A (en) 1973-01-28 1974-01-25
FR7402479A FR2215654B3 (en) 1973-01-28 1974-01-25
DE19742404145 DE2404145A1 (en) 1973-01-28 1974-01-26 BINARY PARALLEL LOADING

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
GB4476372A GB1468342A (en) 1973-01-28 1973-01-28 Adder or priority-determining circuits for computers

Publications (1)

Publication Number Publication Date
GB1468342A true GB1468342A (en) 1977-03-23

Family

ID=10434644

Family Applications (1)

Application Number Title Priority Date Filing Date
GB4476372A Expired GB1468342A (en) 1973-01-28 1973-01-28 Adder or priority-determining circuits for computers

Country Status (4)

Country Link
DE (1) DE2404145A1 (en)
FR (1) FR2215654B3 (en)
GB (1) GB1468342A (en)
NL (1) NL7401039A (en)

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
DE2647982A1 (en) * 1976-10-22 1978-04-27 Siemens Ag LOGICAL CIRCUIT ARRANGEMENT IN INTEGRATED MOS CIRCUIT TECHNOLOGY
US4254471A (en) * 1978-04-25 1981-03-03 International Computers Limited Binary adder circuit
DE3035631A1 (en) * 1980-09-20 1982-05-06 Deutsche Itt Industries Gmbh, 7800 Freiburg BINARY MOS PARALLEL ADDER

Also Published As

Publication number Publication date
FR2215654A1 (en) 1974-08-23
FR2215654B3 (en) 1976-11-19
NL7401039A (en) 1974-07-30
DE2404145A1 (en) 1974-09-05

Similar Documents

Publication Publication Date Title
US4601007A (en) Full adder
US3932734A (en) Binary parallel adder employing high speed gating circuitry
US4682303A (en) Parallel binary adder
US4831578A (en) Binary adder
GB1052400A (en)
JPS6159014B2 (en)
US5343418A (en) Three-to-two carry save adder cell
US3202806A (en) Digital parallel function generator
GB1468342A (en) Adder or priority-determining circuits for computers
GB963429A (en) Electronic binary parallel adder
US4860242A (en) Precharge-type carry chained adder circuit
US4873660A (en) Arithmetic processor using redundant signed digit arithmetic
US4827444A (en) Carry skip-ahead circuit for Manchester-type adder chain
GB1333645A (en) Divider circuits
McCluskey Logical design theory of NOR gate networks with no complemented inputs
GB1280392A (en) High-speed parallel binary adder
GB914014A (en) Parallel digital adder system
GB1171266A (en) Arithmetic and Logic Circuits, e.g. for use in Computing
JPS6010910A (en) Latch circuit array
GB1037802A (en) Arithmetic circuit
US3249747A (en) Carry assimilating system
US2933252A (en) Binary adder-subtracter with command carry control
US4449197A (en) One-bit full adder circuit
GB1131958A (en) Binary adder
US3548182A (en) Full adder utilizing nor gates

Legal Events

Date Code Title Description
PS Patent sealed
435 Patent endorsed 'licences of right' on the date specified (sect. 35/1949)
732 Registration of transactions, instruments or events in the register (sect. 32/1977)
PCNP Patent ceased through non-payment of renewal fee