Combinational Logic

Analysis & Design

NAND Repsn
AND - INVERT

INVERT-OR

A + B

DeMorgans

(AB)

Inference

SOP - NAND

NOR Repsn
OR- INVERT

INVERT-AND

A B

DeMorgans

(A+B)

Inference

POS - NOR

Other Combinations

AND , OR,NAND,NOR

Combination
DEGENERATE

NON- DEGENERATE

OR-OR
AND-AND

AND OR
NAND-NAND
NOR-OR
OR-NAND
OR AND
NOR-NOR
NAND-AND
AND-NOR

Degenerate
A
AB
B

ABC
D

C
D

CD

Other Implementation
AND-OR-INVERT
SOP F

OR-AND-INVERT
POS F

Implementations F =
(0,6)
A
0
1

BC 00

1
0

m
0

m
4

01

0
0

11

m
1

0
0

F = AB + AB+C
F = (AB + AB+C)

10

m
3

m
7

0
1

m
2

m
6

AND-OR-INVERT: ANDNOR
A
B
A
B
C

G1

G2

G3

NAND-AND

A
B
A
B
C
C

G1

G2

G3
G3

Combination
DEGENERATE

NON- DEGENERATE

OR-OR
AND-AND

AND OR
NAND-NAND
NOR-OR
OR-NAND
OR AND
NOR-NOR
NAND-AND
AND-NOR

Implementations
A
0
1

BC 00

1
0

m
0

m
4

01

0
0

11

m
1

0
0

F= ABC + ABC

10

m
3

m
7

0
1

m
2

m
6

Simplify
F=

ABC + ABC
F= [ABC + ABC]
F = (A+B+C)(A+B+C)
F= [(A+B+C)(A+B+C)]

OR-AND-INVERT : ORNAND
A
B
C

G1
G1
G3

A
B
C

G2

NOR-OR

Parity Generation &

Checking
No.

of 1s
Even
Odd

Parity Generation
A

Parity Generation
A

BC 00

0
1

01

11

10

Odd Function

Parity Checking
A

Parity Checking
AB

CD 00

01

11

10

00

01

11

10

Combination
IMPLEMENTATION

AND OR
NAND-NAND
NOR-OR
OR-NAND
OR AND
NOR-NOR
NAND-AND
AND-NOR

K-MAP

SOP
SOP
SOP
SOP
POS
POS
SOP
SOP

Invert POS
Invert POS
Invert
Invert

Design Example 1
Multiply

2 two-input variable
Product of 2-bits four bits

Truth Table
A
1

A
0

B
1

B
0

P3 P2 P1 P0

A
1

A
0

B
1

B
0

P3 P2 P1 P0

P3
15
P3

= A1A0B1B0

P2
10,11,14
A1A0B1B0

+
A1A0B1B0+A1A0B1B0
A1A0B1+A1A0B1Bo
A1B1(Ao+A0B0)
A1B1(Ao+Bo)
A1B1A0+A1B1B0

P1

6,7,9,11,13,14 B1B000

01

A1A0

A1A0B1

A0B1B0

A1B1B0

11

10

00

01

11

10

A1A0B0

P0

5,7,13,15

A0B0

B1B0
00
A1A0

01

11

10

00

01

11

10

Logic Circuit
A0
B0

P0
P3
A1
B1

A1
B1
B0
A1
A0
B1

P2

Logic Circuit
A1
A0
B1
A0
B1
B0
A1
B1
B0
A1
A0
B0

P1