CIRCUITS AND ELECTRONICS. The Digital Abstraction

Similar documents
XI STANDARD [ COMPUTER SCIENCE ] 5 MARKS STUDY MATERIAL.

Combinational Logic. By : Ali Mustafa

CPE100: Digital Logic Design I

Lab 3 Revisited. Zener diodes IAP 2008 Lecture 4 1

Systems I: Computer Organization and Architecture

DESIGN AND IMPLEMENTATION OF ENCODERS AND DECODERS. To design and implement encoders and decoders using logic gates.

Cs302 Quiz for MID TERM Exam Solved

211: Computer Architecture Summer 2016

Slides for Lecture 19

Floating Point Representation and Digital Logic. Lecture 11 CS301

1 Boolean Algebra Simplification

CSE 20 DISCRETE MATH. Fall

Building a Computer Adder

Binary addition example worked out

Digital Logic Design ENEE x. Lecture 14

CS61c: Representations of Combinational Logic Circuits

Number System. Decimal to binary Binary to Decimal Binary to octal Binary to hexadecimal Hexadecimal to binary Octal to binary

Boolean algebra. Examples of these individual laws of Boolean, rules and theorems for Boolean algebra are given in the following table.

Digital Logic (2) Boolean Algebra

Z = F(X) Combinational circuit. A combinational circuit can be specified either by a truth table. Truth Table

LOGIC GATES. Basic Experiment and Design of Electronics. Ho Kyung Kim, Ph.D.

R TH + V TH. Vport. + Rport V TH

ESE 570: Digital Integrated Circuits and VLSI Fundamentals

CIRCUITS AND ELECTRONICS. Introduction and Lumped Circuit Abstraction

E40M. Binary Numbers. M. Horowitz, J. Plummer, R. Howe 1

Digital Logic. Lecture 5 - Chapter 2. Outline. Other Logic Gates and their uses. Other Logic Operations. CS 2420 Husain Gholoom - lecturer Page 1

CIRCUITS AND ELECTRONICS. Dependent Sources and Amplifiers

Computer organization

Additional Gates COE 202. Digital Logic Design. Dr. Muhamed Mudawar King Fahd University of Petroleum and Minerals

L2: Combinational Logic Design (Construction and Boolean Algebra)

Part 1: Digital Logic and Gates. Analog vs. Digital waveforms. The digital advantage. In real life...

SAMPLE EXAMINATION PAPER

Intro To Digital Logic

14:332:231 DIGITAL LOGIC DESIGN. Why Binary Number System?

Chapter 1 :: From Zero to One

Sample Test Paper - I

Lecture 6: Time-Dependent Behaviour of Digital Circuits

10/14/2009. Reading: Hambley Chapters

CS 226: Digital Logic Design

Switches: basic element of physical implementations

UNSIGNED BINARY NUMBERS DIGITAL ELECTRONICS SYSTEM DESIGN WHAT ABOUT NEGATIVE NUMBERS? BINARY ADDITION 11/9/2018

CMOS Technology Worksheet

Chapter 4. Combinational: Circuits with logic gates whose outputs depend on the present combination of the inputs. elements. Dr.

Introduction to Computer Engineering ECE 203

EGC221: Digital Logic Lab

COSC 243. Introduction to Logic And Combinatorial Logic. Lecture 4 - Introduction to Logic and Combinatorial Logic. COSC 243 (Computer Architecture)

UC Berkeley College of Engineering, EECS Department CS61C: Representations of Combinational Logic Circuits

Designing Information Devices and Systems II Spring 2018 J. Roychowdhury and M. Maharbiz Discussion 1A

EE141-Fall 2011 Digital Integrated Circuits

Combinational Logic Design Combinational Functions and Circuits

EECS150 - Digital Design Lecture 19 - Combinational Logic Circuits : A Deep Dive

Integrated Circuit Design ELCT 701 (Winter 2017) Lecture 2: Resistive Load Inverter

S C F F F T T F T T S C B F F F F F T F T F F T T T F F T F T T T F T T T

THE LOGIC OF COMPOUND STATEMENTS

Gates and Flip-Flops

Binary Logic and Gates

ELCT201: DIGITAL LOGIC DESIGN

Signals and Systems Digital Logic System

UNIVERSITY OF BOLTON SCHOOL OF ENGINEERING BENG (HONS) ELECTRICAL & ELECTRONICS ENGINEERING EXAMINATION SEMESTER /2017

Every time has a value associated with it, not just some times. A variable can take on any value within a range

Digital Electronics Final Examination. Part A

University of California at Berkeley College of Engineering Department of Electrical Engineering and Computer Sciences

Introduction to Digital Logic

Fundamentals of Digital Design

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

ECE 342 Electronic Circuits. Lecture 35 CMOS Delay Model

COMBINATIONAL LOGIC FUNCTIONS

ECE/CS 250: Computer Architecture. Basics of Logic Design: Boolean Algebra, Logic Gates. Benjamin Lee

Looking at a two binary digit sum shows what we need to extend addition to multiple binary digits.

Lecture 12 Digital Circuits (II) MOS INVERTER CIRCUITS

Lecture 7: Logic design. Combinational logic circuits

Lecture 3: Boolean Algebra

Chapter 10 AC Analysis Using Phasors

Digital Electronics. Part A

Mealy & Moore Machines

Chapter 3 Combinational Logic Design

Ex: Boolean expression for majority function F = A'BC + AB'C + ABC ' + ABC.

Propositional Logic: Equivalence

UNIVERSITI TENAGA NASIONAL. College of Information Technology

Combinational Logic. Review of Combinational Logic 1

ECE/CS 250 Computer Architecture

CHAPTER 7. Exercises 17/ / /2 2 0

Memory, Latches, & Registers

Implementation of Boolean Logic by Digital Circuits

E&CE 223 Digital Circuits & Systems. Lecture Transparencies (Boolean Algebra & Logic Gates) M. Sachdev

EE 330 Lecture 36. Digital Circuits. Transfer Characteristics of the Inverter Pair One device sizing strategy Multiple-input gates

ECE 250 / CPS 250 Computer Architecture. Basics of Logic Design Boolean Algebra, Logic Gates

Chapter 7 Logic Circuits

Review: Additional Boolean operations

Lecture 4 Modeling, Analysis and Simulation in Logic Design. Dr. Yinong Chen

CSE 140L Spring 2010 Lab 1 Assignment Due beginning of the class on 14 th April

Lecture 21: Boolean Logic. To Wrap up AVR

Numbers and Arithmetic

Chapter 2 Combinational Logic Circuits

Propositional Logic. Logical Expressions. Logic Minimization. CNF and DNF. Algebraic Laws for Logical Expressions CSC 173

CSE 311: Foundations of Computing. Lecture 3: Digital Circuits & Equivalence

EECS Variable Logic Functions

XOR - XNOR Gates. The graphic symbol and truth table of XOR gate is shown in the figure.

CIRCUITS AND ELECTRONICS. State and Memory

Transcription:

6.002 CIRCUITS AND ELECTRONICS The Digital Abstraction

Review Discretize matter by agreeing to observe the lumped matter discipline Lumped Circuit Abstraction Analysis tool kit: KVL/KCL, node method, superposition, Thévenin, Norton (remember superposition, Thévenin, Norton apply only for linear circuits)

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

But first, why digital? In the past Analog signal processing R V + V + 2 R 2 V 0 V and V 2 might represent the outputs of two sensors, for example. By superposition, V R R 2 0 = V + V2 R + R2 R + R2 If R = R 2, V 0 V = + V 2 2 The above is an adder circuit.

Noise Problem t add noise on this wire Receiver: huh? noise hampers our ability to distinguish between small differences in value e.g. between 3.V and 3.2V.

Value Discretization Restrict values to be one of two HIGH 5V TRUE LOW 0V FALSE 0 like two digits 0 and Why is this discretization useful? (Remember, numbers larger than 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 0 has decimal value 5.)

Digital System sender V S noise V N V N = 0V V R receiver 5V 2.5V 0V V S 0 0 HIGH LOW t V R 0 0 5V 2.5V 0V t With noise V S 0 0 5V 2.5V 0V V N = 0. 2V t 0.2V t V S 0 0 2.5V t

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

Voltage Thresholds and Logic Values 5V sender 2.5V receiver 0 0 0 0V

But, but, but What about 2.5V? Hmmm create no man s land or forbidden region For example, 5V sender V H 3V forbidden region 2V V L receiver 0 0 0V V 5V H 0 0V V L

But, but, but Where s the noise margin? What if the sender sent : V H? Hold the sender to tougher standards! 5V V 0H sender 0 V 0L 0V V IH V IL receiver 0

But, but, but Where s the noise margin? What if the sender sent : V H? Hold the sender to tougher standards! 5V V 0H sender Noise margins V IH receiver V IL 0 V 0L 0 0V noise margin: V IH - V 0H 0 noise margin: V IL - V 0L

5V V 0H V IH V IL 0 0 sender V 0L 0V t 5V V 0H V IH V IL 0 0 receiver V 0L 0V t 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.

Processing digital signals Recall, we have only two values,0 Map naturally to logic: T, F Can also represent numbers

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 are digital signals 0, X Y Z AND gate Truth table representation: X Y Enumerate all input combinations Z 0 0 0 0 0 0 0

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.

Demo X Y Z Noise X Y Z Z = X Y

Examples for recitation X t Y t Z t Z = X Y

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 More gates OR gate B B X Y Z Inverter NAND Z = X Y

Boolean Identities X = X X 0 = X X + = X + 0 = X = 0 0 = AB + AC = A (B + C) Digital Circuits Implement: output = A + B C B C A B C output