INDEX

1.
2.
3.
4.
5.
6.

Obtain a precise circuit specification

Boolen algebra
Combination of gate
Development of a truth table
Identifying the minterms
corresponding to each row in the table.
Conclusions

Boolean algebra & circuits

Boolean algebra is used to model
electronic circuitry
Each input & output of electronic
device can be thought of as a member
of the set {0,1}
Electronic devices made up of circuits
Each circuit can be designed using
rules of Boolean algebra

Combinations of gates
Combinational circuits can be constructed using
combinations of inverters, OR gates, and AND gates
In such circuit combinations, some gates may share
inputs
Output from a gate may be used as input by
another element

Adders

Logic circuits can be used to carry out addition of two

positive integers from their binary expansions
Such circuits form the basis of computer arithmetic
Half adder: a circuit that takes 2 bits as input, outputting
a sum bit and a carry bit; a half adder is a multiple
output circuit
A full adder computes the sum and carry bits when 2 bits
and a carry are added

What is Full Adder?

A full adder is a circuit that computes the sum of three bits
and gives a two-bit answer.
A circuit for adding two 16-bit numbers can be built from 16
full-adder circuits. Each full-adder does one column of the
sum.
The full adder for a given column adds two bits from the
input numbers together with a one-bit carry from the
previous column to the right. The adder produces a two-bit
answer; one of these bits is used as a carry into the next
column.

The truth table of the full-adder can be

drawn with inputs A,B and Cin with outputs S and
Cout
From the truth table we can write the Boolean
equation for the S and Cout

Simplify using Boolean Algebra and K-map, we

get
A full adder has 3 inputs and 2 outputs

Types of Logic Gates

A N D G a te

A
B

C
O R G a te

A
B

C
N O R G a te

C
N O T G a te
A

A
B

N A N D G a te

A
C
B
E x c lu s iv e - O R G a t e
A
A B=C
B

 AND , OR , NOT

Basic Gates

AND Gate

The AND gate implements the Boolean AND function

where the output only is logical 1 when all inputs are
logical 1.
The standard symbol and the truth tabel for a two
input AND gate is:

Boolean expression of AND

The Boolean
expression for the
AND gate is R=A.B

A
0
0
1
1

B
0
1
0
1

R
0
0
0
1

OR Gate
The OR gate implements the Boolean OR function where
the output is logical 1 when just input is logical 1.
The standard symbol and the truth table for a two input OR
gate is:

Boolean Expression of OR

The Boolean
expression for the
OR gate is: R=A+B

A
0
0
1
1

B
0
1
0
1

R
0
1
1
1

NOT Gate
The NOT gate implements the Boolean NOT
function where the output is the inverse of the
input.
The standard symbol and the truth table for the
NOT gate is:

Boolean Expression
of NOT
The Boolean expression
for the NOT gate is: R=A

Derived Gates

NAND , NOR , XOR

The NAND gate is an AND gate followed by a NOT
gate. The output is logical 1 when one of the
inputs are logical 0
The standard symbol and the truth table for the
NAND gate is:

A B R
0
0
1
1

0
1
0
1

1
1
1
0

Boolean expression of NAND

NOR Gate

The NOR is a combination of an OR followed by a NOT gate.

The output is logical 1 when non of the inputs are logical 0
The standard symbol and the truth table for the NOR gate is:

Boolean Expression of NOR

A
0
0
1
1

B
0
1
0
1

R
1
0
0
0

XOR Gate

The XOR gate produces a logic 1 output only if

its two inputs are different. If the inputs are the
same, the output is a logic 0
The XOR symbol is a variation on the standard
OR symbol. It consists of a plus (+) sign with a
circle around it. The logic symbol, as shown
here, is a variation on the standard OR symbol.

Four-Bit Parallel Adder

A

C a rry
O ut
C

F .A

F .A
C

F .A
C

F .A
C

This circuit is sometimes referred to as a ripple-through adder

C0 ripples through four two-level logic circuits
and hence the
until eightSgate delays
S3
S 2 sum cannot be completed
S1
0
For this kind of adder, the maximum delay is directly proportional to the number of stages n.

CONCLUSION