Digital Circuits and Systems Spring 2015 Week 1 Module 2 Shankar - - PowerPoint PPT Presentation

digital circuits and systems
SMART_READER_LITE
LIVE PREVIEW

Digital Circuits and Systems Spring 2015 Week 1 Module 2 Shankar - - PowerPoint PPT Presentation

Digital Circuits and Systems Spring 2015 Week 1 Module 2 Shankar Balachandran* Associate Professor, CSE Department Indian Institute of Technology Madras *Currently a Visiting Professor at IIT Bombay Binary Switch x = 0 x = 1 (a) Two


slide-1
SLIDE 1

Shankar Balachandran* Associate Professor, CSE Department Indian Institute of Technology Madras

*Currently a Visiting Professor at IIT Bombay

Digital Circuits and Systems

Spring 2015 Week 1 Module 2

slide-2
SLIDE 2

x 1 = x = (a) Two states of a switch S x (b) Symbol for a switch

Binary Switch

slide-3
SLIDE 3

Simple connection to a battery S Battery Light

x

A Light Controlled by a Switch

slide-4
SLIDE 4

(a) The logical AND function (series connection) S Power supply S S Power supply S (b) The logical OR function (parallel connection) Light Light x1 x2 x1 x2

Two Basic Functions

slide-5
SLIDE 5

S Power supply S Light S

x1 x2 x3

A Series Parallel Circuit

slide-6
SLIDE 6

S Light Power supply R

x

An Inverting Circuit

slide-7
SLIDE 7

Truth Table

slide-8
SLIDE 8

Truth Table of 3-Input AND and OR Operations

slide-9
SLIDE 9

Truth Table of 3-Input AND and OR Operations

slide-10
SLIDE 10

Introduction 13

Symbols

 AND Dot ( ) Imagine it to be like multiplication Example x y  Called “x and y”  OR Plus ( + ) Imagine it to be like addition Example x + y Called “x or y”

v

slide-11
SLIDE 11

NOT Operation

 Symbol Closing single quote ’ Also overline

and ! symbol

Example: x’, x, !x  Calling x complement  “not of x” Simpler: “x bar”

Introduction 14

slide-12
SLIDE 12

Symbols

Introduction 15

x

1

x

2

x

n

x

1 x 2

 x

n

+ + + x

1

x

2

x

1 x 2

+ x

1

x

2

x

n

x

1

x

2

x

1 x 2

x

1 x 2  x n

  

(a) AND gates (b) OR gates

x x

(c) NOT gate

slide-13
SLIDE 13

Boolean Algebra

 Named after George Boole  Axioms  0 · 0 = 0  0 + 0 = 0  0’ = 1

 Duality

 1 · 1 = 1  1 + 1 = 1  1’ = 0

 0 + 1 = 1 + 0 = 1  0 · 1 = 1 · 0 = 0

Introduction 16

slide-14
SLIDE 14

Single Variable Theorems

 x · 0 = 0  x + 1 = 1  x · 1 = x  x + 0 = x  x · x = x  x + x = x  x + !x = 1  x · !x = 0  x · x · x · … x = x  !!x = x

Introduction 17

slide-15
SLIDE 15

Two Variable Theorems

 x · y = y · x  x + y = y + x  Both are commutative

Introduction 18

slide-16
SLIDE 16

Three Variable Theorems

 Associative Laws 

x · (y · z) = (x · y) · z

x + (y + z) = (x + y) + z

 Distributive Law

x · (y + z) = (x · y) + (x · z)

 x + (y · z) = (x + y) · (x + z)  More as we go

Introduction 19

slide-17
SLIDE 17

End of Week 1: Module 2

Thank You

Introduction 20