+ All Categories
Home > Engineering > Universal gate BY Abdullah

Universal gate BY Abdullah

Date post: 19-Jul-2015
Category:
Upload: sheikh-muhammad-abdullah
View: 395 times
Download: 6 times
Share this document with a friend
Popular Tags:
18
WELCOME To Our Presentation 1 Sheikh Muhammad Abdullah Universal Gates
Transcript
Page 1: Universal gate BY Abdullah

WELCOMETo Our Presentation

1Sheikh Muhammad Abdullah Universal Gates

Page 2: Universal gate BY Abdullah

Our Topics name:

2

NAND and NOR gates are “Universal” because they can

used to produce any of the other logic functions.

Sheikh Muhammad Abdullah Universal Gates

Page 3: Universal gate BY Abdullah

MUHAMMAD ABDULLAH(142-0076-511)

MD.KHALID HASAN(142-0106-501)

MD.IBRAHIM(141-0036-511)

Department Name: B.Sc in EEE&CSE

3

Teacher’s Name:

MUHAMMAD WOLI ULLAH

Our Team name:

Subject Name: DIGITAL LOGIC

Sheikh Muhammad Abdullah Universal Gates

Page 4: Universal gate BY Abdullah

Sheikh Muhammad AbdullahUniversal Gates 4

Universal Gates: NAND and NOR

AND/OR/NOT gates are sufficient for building any Boolean functions.

We call the set {AND, OR, NOT} a complete set of logic.

However, other gates are also used because:

(i) usefulness

(ii) economical on transistors

(iii) self-sufficient

NAND/NOR: economical, self-sufficient

XOR: useful (e.g. parity bit generation)

Page 5: Universal gate BY Abdullah

Sheikh Muhammad AbdullahUniversal Gates 5

Universal Property of NAND Gates

NAND gate is self-sufficient (can build any logic circuit with it).

Therefore, {NAND} is also a complete set of logic.

Can be used to implement AND/OR/NOT.

1. Implementing an inverter using NAND gate:

(x.x)' = x' (T1: idempotency)

x x'

Page 6: Universal gate BY Abdullah

Universal Property of NAND Gates

• NAND Gate as an Inverter

• Two NAND Gates as an AND Gate

Sheikh Muhammad Abdullah Universal Gates6

Page 7: Universal gate BY Abdullah

Universal Property of NAND Gates

• Three NAND Gates as an OR Gate

• Four NAND Gates as OR Gate

Sheikh Muhammad Abdullah Universal Gates7

Page 8: Universal gate BY Abdullah

Universal Property of NAND Gates

((x.y)'(x.y)')' = ((x.y)')' idempotency= (xy) involution

((x.x)'(y.y)')' = (x'.y')' idempotency= x''+y'' DeMorgan= x+y involution

Implementing AND using NAND gates:

Implementing OR using NAND gates:

xx.y

y

(x.y)'

x

x+y

y

x'

y'

Sheikh Muhammad Abdullah Universal Gates8

Page 9: Universal gate BY Abdullah

Universal Property of NOR Gates

NOR gate is also self-sufficient.

Therefore, {NOR} is also a complete set of logic

Can be used to implement AND/OR/NOT.

Implementing an inverter using NOR gate:

(x+x)' = x' (T1: idempotency)

x x'

Sheikh Muhammad Abdullah

Universal Gates 9

Page 10: Universal gate BY Abdullah

Universal Property of NOR Gates

• NOR Gate as an Inverter

• Two NOR Gates as an OR Gate

Sheikh Muhammad Abdullah Universal Gates10

Page 11: Universal gate BY Abdullah

Universal Property of NOR Gates

• Three NOR Gates as an AND Gate

• Four NOR Gates as an AND Gate

Sheikh Muhammad Abdullah Universal Gates11

Page 12: Universal gate BY Abdullah

Universal Property of NOR Gates

((x+x)'+(y+y)')'=(x'+y')' idempotency

= x''.y'' DeMorgan

= x.y involution

((x+y)'+(x+y)')' = ((x+y)')' idempotency

= (x+y) involution

Implementing AND using NOR gates:

Implementing OR using NOR gates:

xx+y

y

(x+y)'

x

x.y

y

x'

y'

Sheikh Muhammad AbdullahUniversal Gates 12

Page 13: Universal gate BY Abdullah

Implementation using NAND gates (1/2)

Possible to implement any Boolean expression using

NAND gates.

Procedure:

(i) Obtain sum-of-products Boolean expression:

e.g. F3 = x.y'+x'.z

(ii) Use DeMorgan theorem to obtain expression

using 2-level NAND gates

e.g. F3 = x.y'+x'.z

= (x.y'+x'.z)' ' involution

= ((x.y')' . (x'.z)')' DeMorgan

Sheikh Muhammad AbdullahUniversal Gates 13

Page 14: Universal gate BY Abdullah

Implementation using NAND gates (2/2)

F3 = ((x.y')'.(x'.z)') ' = x.y' + x'.z

x'z

F3

(x'.z)'

(x.y')'xy'

Sheikh Muhammad AbdullahUniversal Gates 14

Page 15: Universal gate BY Abdullah

Implementation using NOR gates (1/2)

Possible to implement any Boolean expression using NOR

gates.

Procedure:

(i) Obtain product-of-sums Boolean expression:

e.g. F6 = (x+y').(x'+z)

(ii) Use DeMorgan theorem to obtain expression

using 2-level NOR gates.

e.g. F6 = (x+y').(x'+z)

= ((x+y').(x'+z))' ' involution

= ((x+y')'+(x'+z)')' DeMorgan

Sheikh Muhammad AbdullahUniversal Gates 15

Page 16: Universal gate BY Abdullah

Implementation using NOR gates (2/2)

F6 = ((x+y')'+(x'+z)')' = (x+y').(x'+z)

x'z

F6

(x'+z)'

(x+y')'xy'

Sheikh Muhammad AbdullahUniversal Gates 16

Page 17: Universal gate BY Abdullah

Sheikh Muhammad Abdullah17

Mano, M. Morris (October 1992). Computer System Architecture (3rd ed. ed.). Prentice-Hall. ISBN 0-13-175563-3

Universal Gates

John A. Camara (2010). Electrical and Electronics Reference Manual for the Electrical and Computer PE Exam. www.ppi2pass.com. p. 41. ISBN 978-1-59126-166-7.

Page 18: Universal gate BY Abdullah

THANKS TO ALL

Sheikh Muhammad Abdullah 18Universal Gates


Recommended