6.

002

CIRCUITS AND ELECTRONICS

The Digital Abstraction

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Review
Discretize matter by agreeing to observe the lumped matter discipline

Lumped Circuit Abstraction Analysis tool kit: KVL/KCL, node method, superposition, Thvenin, Norton (remember superposition, Thvenin, Norton apply only for linear circuits)

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Today

Discretize value

Digital abstraction

Interestingly, we will see shortly that the tools learned in the previous three lectures are sufficient to analyze simple digital circuits

Reading: Chapter 5 of Agarwal & Lang

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

But first, why digital? In the past

Analog signal processing R1
V1 + V2 R2

V0 V 1
and V 2 might represent the outputs of two sensors, for example.

By superposition,
V0 = R2 R1 V1 + V2 R1 + R2 R1 + R2
V1 + V2 2

If R1 = R 2 ,
V0 =

The above is an adder circuit.

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Noise Problem

add noise on this wire

Receiver: huh?

noise hampers our ability to distinguish between small differences in value e.g. between 3.1V and 3.2V.

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Value Discretization
Restrict values to be one of two HIGH 5V TRUE 1 LOW 0V FALSE 0 0 and 1

like two digits

Why is this discretization useful?

(Remember, numbers larger than 1 can be represented using multiple binary digits and coding, much like using multiple decimal digits to represent numbers greater than 9. E.g., the binary number 101 has decimal value 5.)
Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Digital System
sender VS

noise VN
VR

VN = 0V

receiver

VS
5V 0 1 0 HIGH 2.5V 0V
LOW

VR
0 1 0 5V

2.5V 0V

With noise

VS
0 1 0 5V 2.5V 0V

VN = 0.2V
0.2V

VS

0 1 0

t t
2.5V

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Digital System

Better noise immunity Lots of noise margin For 1: noise margin 5V to 2.5V = 2.5V For 0: noise margin 0V to 2.5V = 2.5V

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Voltage Thresholds and Logic Values

5V

1 sender 0

1 0
0V

1
2.5V receiver

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

But, but, but What about 2.5V?

Hmmm create no mans land or forbidden region
For example,
5V

1 sender 0
0V 3V 2V

forbidden region

VH VL

1 receiver 0

1 0
6.002 Fall 2000

5V V
L

0V
Lecture 4

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

But, but, but

Wheres the noise margin? What if the sender sent 1:

5V 1 sender 0
V 0H

VH ?

Hold the sender to tougher standards!

1
V IH V IL V 0L

receiver 0

0V

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

But, but, but

Wheres the noise margin? What if the sender sent 1:

5V 1 sender 0
V 0H

VH ?

Hold the sender to tougher standards!

1
Noise margins V IH V IL V 0L

receiver 0

0V 1 noise margin: V 0 noise margin:

6.002 Fall 2000 Lecture 4

IH V IL

- V -

0H V 0L

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

5V V 0H V IH V IL V 0L 0V

sender

5V V 0H V IH V IL V 0L 0V

receiver

Digital systems follow static discipline: if inputs to the digital system meet valid input thresholds, then the system guarantees its outputs will meet valid output thresholds.
Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Processing digital signals

Recall, we have only two values

1,0

Map naturally to logic: T, F Can also represent numbers

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Processing digital signals

Boolean Logic If X is true and Y is true Then Z is true else Z is false. Z = X AND Y Z = X Y Boolean equation X Y Z X, Y, Z are digital signals 0 , 1 AND gate

Truth table representation: X Y Z

0 0 1 1 0 1 0 1 0 0 0 1

Enumerate all input combinations

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Combinational gate abstraction

Adheres to static discipline Outputs are a function of inputs alone. Digital logic designers do not have to care about what is inside a gate.

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Demo

Z Noise X Y Z = X Y
Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Examples for recitation

X

t
Y

t
Z

t
Z = X Y
Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

In recitation
Another example of a gate If (A is true) OR (B is true) then C is true else C is false C = A + B A B Boolean equation OR C OR gate B Inverter X Y

More gates B

Z NAND

Z = X Y
Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4

Boolean Identities
X X X X

1 = 0 0 = 1 AB + AC = A (B + C)

1 = X 0 = X + 1 = 1 +0 = X

Digital Circuits
Implement: B C A output = A + B C BC output

Cite as: Anant Agarwal and Jeffrey Lang, course materials for 6.002 Circuits and Electronics, Spring 2007. MIT OpenCourseWare (http://ocw.mit.edu/), Massachusetts Institute of Technology. Downloaded on [DD Month YYYY].

6.002 Fall 2000

Lecture 4