Scribd
Upload
8 views30 pages

00 Introduction

The document describes circuits for adding binary numbers. It explains that a half-adder circuit is used to add two binary digits and produce a sum and carry output. The sum is produced using an XOR gate, and the carry is produced using an AND gate. To add binary numbers with multiple digits, full-adder circuits are used that can add three binary digits - two inputs and a carry from the previous stage. The full-adder circuit extends the half-adder design to incorporate the third input.

Uploaded by

fatcode27
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
8 views30 pages

00 Introduction

The document describes circuits for adding binary numbers. It explains that a half-adder circuit is used to add two binary digits and produce a sum and carry output. The sum is produced using an XOR gate, and the carry is produced using an AND gate. To add binary numbers with multiple digits, full-adder circuits are used that can add three binary digits - two inputs and a carry from the previous stage. The full-adder circuit extends the half-adder design to incorporate the third input.

Uploaded by

fatcode27
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

∼

unless with added writing .


-
00
⇐

0
{ , , , , }

00
∈{ , , , , }
!{ , , , , }
{ }
-

a=b 3+5 3 # 5
ON = { , , , , . . .}
8
Z = {. . . , − , − , , , , . . .}
Q={ / | , " }
R
*t¥
O
x
Input
= -

function machine = sin( )


f (x) Output
Figure 1.3.1

fined by Formulas
ng function f from R to R is defined by the formula f (x) = x 2 for all real
- .

= {( , ) | an }
2 2 2 2
02 + 02 = 02 = 002 .
It follows that the circuit to be designed must have two outputs—one for t
binary digit (this is called the carry) and one for the right binary digit (this is
the sum). The carry output is 1 if both P and Q are 1; it is 0 otherwise. Thus th
can be produced using the AND-gate circuit that corresponds to the Boolean expr
P ∧ Q. The sum output is 1 if either P or Q, but not both, is 1. The sum can, the
be produced using a circuit that corresponds to the Boolean expression for exclus
(P ∨ Q) ∧ ∼(P ∧ Q). (See Example 2.4.3(a).) Hence, a circuit to add two binary
P and Q can be constructed as in Figure 2.5.1. This circuit is called a half-adder.

HALF-ADDER
Circuit Input/Output Table

P Q Carry S
P 1 1 1
OR
Q AND Sum 1 0 0
NOT
0 1 0
AND Carry
0 0 0
Figure 2.5.1 Circuit to Add P + Q, Where P and Q Are Binary Digits

Now consider the question of how to construct a circuit to add two binary in
each with more than one digit. Because the addition of two binary digits may re
a carry to the next column to the left, it may be necessary to add three binary d
, ,...,
.

-
÷
α ι σΣ
β κ τ
γΓ λΛ υΥ
δ∆ µ φΦ
ϵ ν χ
ζ ψΨ
η πΠ ωΩ
θΘ ρ

You might also like