Lecture 9: Digital Electronics

Similar documents
Digital Electronics. Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL (7400)

Gates and Flip-Flops

Digital Circuits. 1. Inputs & Outputs are quantized at two levels. 2. Binary arithmetic, only digits are 0 & 1. Position indicates power of 2.

Lab 3 Revisited. Zener diodes IAP 2008 Lecture 4 1

Digital Electronics Final Examination. Part A

Boole Algebra and Logic Series

DIGITAL LOGIC CIRCUITS

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

Vidyalankar S.E. Sem. III [EXTC] Digital Electronics Prelim Question Paper Solution ABCD ABCD ABCD ABCD ABCD ABCD ABCD ABCD = B

Chapter 2 Boolean Algebra and Logic Gates

Vidyalankar S.E. Sem. III [ETRX] Digital Circuits and Design Prelim Question Paper Solution

EC-121 Digital Logic Design

Logic Gates and Boolean Algebra

TYPICAL QUESTIONS & ANSWERS

Chapter 5 Synchronous Sequential Logic

Fundamentals of Digital Design

NTE74HC109 Integrated Circuit TTL High Speed CMOS, Dual J K Positive Edge Triggered Flip Flop w/set & Reset

Cs302 Quiz for MID TERM Exam Solved

LOGIC CIRCUITS. Basic Experiment and Design of Electronics

Why digital? Overview. Number Systems. Binary to Decimal conversion

Digital Logic: Boolean Algebra and Gates. Textbook Chapter 3

Sample Test Paper - I

Vidyalankar S.E. Sem. III [CMPN] Digital Logic Design and Analysis Prelim Question Paper Solution

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

S.Y. Diploma : Sem. III [DE/ED/EI/EJ/EN/ET/EV/EX/IC/IE/IS/IU/MU] Principles of Digital Techniques

Logic. Basic Logic Functions. Switches in series (AND) Truth Tables. Switches in Parallel (OR) Alternative view for OR

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

Chapter 2: Boolean Algebra and Logic Gates

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

ENGR4300 Fall 2005 Test 3S. Name solution. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

MM54HCT193 MM74HCT193 Synchronous Binary Up Down Counters

Digital Electronic Meters


EE40 Lec 15. Logic Synthesis and Sequential Logic Circuits

Electronics. Overview. Introducction to Synthetic Biology

Sequential Logic. Rab Nawaz Khan Jadoon DCS. Lecturer COMSATS Lahore Pakistan. Department of Computer Science

ELCT201: DIGITAL LOGIC DESIGN

MM74C90 MM74C93 4-Bit Decade Counter 4-Bit Binary Counter

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

CMPE12 - Notes chapter 2. Digital Logic. (Textbook Chapters and 2.1)"

Number Systems 1(Solutions for Vol 1_Classroom Practice Questions)

NTE74HC173 Integrated Circuit TTL High Speed CMOS, 4 Bit D Type Flip Flop with 3 State Outputs

74LS195 SN74LS195AD LOW POWER SCHOTTKY

ELCT201: DIGITAL LOGIC DESIGN

NTE74176 Integrated Circuit TTL 35Mhz Presettable Decade Counter/Latch

Computers also need devices capable of Storing data and information Performing mathematical operations on such data

NOTE: The Flatpak version has the same pinouts (Connection Diagram) as the Dual In-Line Package. *MR for LS160A and LS161A *SR for LS162A and LS163A

UNIT 8A Computer Circuitry: Layers of Abstraction. Boolean Logic & Truth Tables

Chapter 2. Review of Digital Systems Design

Vidyalankar. S.E. Sem. III [EXTC] Digital System Design. Q.1 Solve following : [20] Q.1(a) Explain the following decimals in gray code form

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

Appendix A: Digital Logic. CPSC 352- Computer Organization

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION (Autonomous) (ISO/IEC Certified)

on candidate s understanding. 7) For programming language papers, credit may be given to any other program based on equivalent concept.

Digital Electronics. Part A

LOGIC GATES A Y=A+B. Logic symbol of OR gate B The Boolean expression of OR gate is Y = A + B, read as Y equals A 'OR' B.

Boolean Algebra. Boolean Variables, Functions. NOT operation. AND operation. AND operation (cont). OR operation


ENGR4300 Fall 2005 Test 3A. Name. Section. Question 1 (25 points) Question 2 (25 points) Question 3 (25 points) Question 4 (25 points)

Hold Time Illustrations

INTEGRATED CIRCUITS. For a complete data sheet, please also download:

GMU, ECE 680 Physical VLSI Design

9/18/2008 GMU, ECE 680 Physical VLSI Design

MAHARASHTRA STATE BOARD OF TECHNICAL EDUCATION

NTE74177 Integrated Circuit TTL 35Mhz Presettable Binary Counter/Latch

Digital Integrated Circuits A Design Perspective

New Students Day Activity

Implementation of Boolean Logic by Digital Circuits

Digital Logic. CS211 Computer Architecture. l Topics. l Transistors (Design & Types) l Logic Gates. l Combinational Circuits.

Roger L. Tokheim. Chapter 8 Counters Glencoe/McGraw-Hill

ECE/Comp Sci 352 Digital Systems Fundamentals. Charles R. Kime Section 2 Fall Logic and Computer Design Fundamentals

Jan M. Rabaey Anantha Chandrakasan Borivoje Nikolic. November Digital Integrated Circuits 2nd Sequential Circuits

Sequential Logic Circuits

Digital Electronics I

Unit II Chapter 4:- Digital Logic Contents 4.1 Introduction... 4

74LS393 Dual 4-Bit Binary Counter

Digital Fundamentals

Standard Expression Forms

EET 310 Flip-Flops 11/17/2011 1

Time Allowed 3:00 hrs. April, pages

ELEC Digital Logic Circuits Fall 2014 Sequential Circuits (Chapter 6) Finite State Machines (Ch. 7-10)

Appendix A: Digital Logic. Principles of Computer Architecture. Principles of Computer Architecture by M. Murdocca and V. Heuring

Chapter 2 Combinational Logic Circuits

Digital Electronics II Mike Brookes Please pick up: Notes from the front desk

04. What is the Mod number of the counter circuit shown below? Assume initially reset.

A Guide. Logic Library

Mealy & Moore Machines

Digital Integrated Circuits A Design Perspective

Advanced Information Storage 02

CHAPTER 3 LOGIC GATES & BOOLEAN ALGEBRA

CD4027BC Dual J-K Master/Slave Flip-Flop with Set and Reset

MOSIS REPORT. Spring MOSIS Report 1. MOSIS Report 2. MOSIS Report 3

Philadelphia University Student Name: Student Number:

CMSC 313 Lecture 16 Postulates & Theorems of Boolean Algebra Semiconductors CMOS Logic Gates

Chapter 14 Sequential logic, Latches and Flip-Flops

[Omotosho, 2(9): September, 2013] ISSN: Impact Factor: 1.852

Synchronous Sequential Logic

Introduction EE 224: INTRODUCTION TO DIGITAL CIRCUITS & COMPUTER DESIGN. Lecture 6: Sequential Logic 3 Registers & Counters 5/9/2010

Reg. No. Question Paper Code : B.E./B.Tech. DEGREE EXAMINATION, NOVEMBER/DECEMBER Second Semester. Computer Science and Engineering

Transcription:

Introduction: We can classify the building blocks of a circuit or system as being either analog or digital in nature. If we focus on voltage as the circuit parameter of interest: nalog: The voltage can take on a range of voltages, e.g. any value between 0.1 and 2 Volts. Digital: The voltage can have only two values, e.g. 0 or 5 Volts Lecture 9: Digital Electronics We say the voltage is either on or off Digital circuits are useful when we don t need a continuous range of voltage or current. Examples: Representing numbers, binary logic, counting circuits. Example: Represent base 10 numbers using the binary system: 2 10 = 10 2 = 1 x 2 1 + 0 x 2 0 10 10 = 1010 2 = 1 x 2 3 + 0 x 2 2 + 1 x 2 1 + 0 x 2 0 Digital circuits use standard voltages (or currents) to denote ON (high, 1) or OFF (low, 0). These standards are called "Logic Families" and there are several families. Two of the most popular families are: TTL (Transistor-Transistor-Logic): ON = 5 Volts, OFF = 0 Volts ECL (Emitter-Coupled-Logic): ON = -1 Volt, OFF = -1.6 Volts For practical reasons both ON and OFF are given by a range of voltages or currents. ON for an input to a circuit might have slightly different voltage than ON for an output to a circuit. 1

description of several logic families is given in the table below: Delay Max. FF Rate Power/Gate High Low (ns) (MHz) (mw) (V) (V) Standard TTL 10 35 15 3.5 0.2 (7400) Low-power Schottky 9.0 33 2 3.5 0.2 (74LS00) Fast TTL 3.5 125 5.5 2.7 0.5 (74F00) CMOS 25 @ 10 V 10 @ 10 V 0.01 5-15 0 (74C00) 50 @ 25 V 3.5 @ 5 V High-speed CMOS 8.0 40 0.01 2-6 0.1 (74HC00) ECL 2 250 25-0.9-1.8 100k ECL 0.75 500 40-1.0-1.7 dvantages of Digital: only deal with two voltage levels (either ON or OFF) voltages (or currents) are standardized do not deal with individual transistors Disadvantages of Digital: too many "black" boxes need good power supplies, clocks etc. for circuits to work properly 2

Logic Gates: We want to make decisions based on digital information. For now consider the basic building blocks with one or two inputs and one output. The basic logic units (gates) are: ND, OR, NOT. These functions are defined by their truth tables. V ND OR NOT (inverter) Y 0 0 0 1 0 0 0 1 0 1 1 1 = Y D 0 +V Y R Y 0 0 0 1 0 1 0 1 1 1 1 1 + = Y D0 V D 1 Y V out Y 0 1 1 0 = Y +V 1 Y invert symbol V out and stand for the inputs Y stands for the output 0: low input or output 1: high input or output V D 1 V out V V V out = +V if both diodes off V out = V or V if either V > 0.6 V, 1 is on, V out ~ 0 = 0 if one or more diodes conduct V < 0.6 V, 1 is off, V out = +V diodes conduct = 0 if both diodes are off 3

oolean lgebra or the lgebra of 1's and 0's Circuits consisting of logic gates are described by oolean algebra. Use of this algebra can greatly simplify circuit design, e.g. minimize the number of components. The following theorems can be proved using a truth table and the definition of OR, ND, and NOT. 1) + =, +1 =1, + 0 = 2) = 3) = 4) C = ()C = (C) See Simpson page 540 for more theorems. 5) (+ C) = + C 6) 1 = 0, 0 =1 7) + =1, = 0, 1 = For clarity (ND) is not shown in some theorems. 8) = 9) + = 10) = + DeMorgan's Theorem Example using oolean algebra: Prove: X + YZ = (X + Y)(X + Z) (X+ Y)(X+ Z) = XX + XZ + YX+ YZ by 5) = X+ X(Z + Y)+ YZ by 2) and 5) = X(1+ Z + Y)+ YZ by 5) = X+ YZ by 1) 4

We could also have proven the above using a truth table. There are 8 (2 3 ) possible combinations of X, Y, Z. For a large number of inputs using a truth table becomes unwieldy. Example, if there are 10 inputs 2 10 = 1024 possible combinations! Example: Exclusive OR = XOR =. Output is high if inputs are different. XOR Y Y 0 0 0 1 0 1 0 1 1 1 1 0 + =Y How do we make an exclusive OR with ND, OR, and NOT gates? + rute force method 5

Can we simplify this circuit with the use of less parts? Use logical theorems: = + = + + + 7) and 1) = ( + )+ ( + ) 5) = ()+ () 10) = ( + )() 5) The circuit uses only 3 parts (OR, NND, ND), but each of them is different! Usually there are many ways to synthesize the same function (circuit). Must decide if you want to minimize: number of components types of components number of connections power consumption For example we can make an XOR using only 4 NND gates: + (+)() 6

Final example: Suppose you have a light controlled by 3 switches. You want the light to be on if any one of the 3 switches is on or if all 3 switches are on. C Light 1 1 1 1 1 0 0 1 1 1 0 0 C 0 1 1 0 L 0 1 0 1 0 0 1 1 1 0 1 0 1 = ON 0 0 0 0 0 = OFF L = C + C + C + C = (C + C )+ (C + C) = ( + C )( + C)+ ( C) = CC + ( C) = C + C + ( C) = C + ( C) = ( C) 7

Flip-Flops: asic counting unit in computer: counters shift registers memory Circuit whose output depends on the history of its inputs. Can make a flip-flop with just 2 transistors (or 2 vacuum tubes 1919!). Lots of different types of flip-flops (e.g. RS, JK, T, D). Example: RS flip-flop or Reset-Set flip flop Flip-flops, like logic gates are defined by their truth table. Flip-flops are controlled by an external clock pulse. ll inputs and outputs are logic levels (e.g. TTL, ECL). Can make an RSFF out of NOR gates: R S n is the present state of the FF. n+1 will be the output after the clock enables the FF to look at its inputs (R and S). Many FF change state ( n n+1 ) on the trailing edge of the clock. R S n+1 0 0 n 1 0 0 0 1 1 1 1 undefined The state with R = S =1 is undefined. The output is not predictable! R S C 8

Example: D flip-flop (Like RS but only one input) D Clock Example: JK flip-flop D 0 0 0 0 1 0 1 0 1 1 1 1 JKFF is like the RSFF except that both inputs (J and K) can be high (1). C J K 0 0 1 0 1 0 1 0 1 1 n+1 n n J K Most JKFF's have a connection for forcing = 0 (clear) or forcing = 1 (preset). next Example: T (Toggle) flip-flop T flip-flop is like the JKFF with both inputs (J and K) tied to each other. T Clock T 0 0 0 0 1 1 1 0 1 1 1 0 next 9

Flip-Flops are a class of circuits called multivibrators Multivibrators are circuits with one or more stable states. Monostable multivibrators (one shot) have one stable state. If the circuit is forced out of its stable state (e.g. by an input pulse) it eventually returns back to the stable state by itself. istable multivibrators have two stable states. Transitions between states occur only by an external action (e.g. voltage pulse for flip-flops). Transition voltages can be different for the two states (e.g. Schmitt trigger). stable multivibrators are two state devices which switch on their own accord. Commonly used as oscillators. 10

Example: istable Multivibrator. This circuit has two stable states. When either transistor conducts there is 4 m flowing (by design) in the collector (I C1 or I C2 ). State 1:transistor 1 off, transistor 2 on V C1 11 V, V 1 2 V, V E1 4 V V C2 4 V, V 2 5.5 V, V E2 4 V Transition from state 1 to state 2: Input pulse forces T 1 to conduct, T 1 conducting means that V C1 drops. V C1 causes V 2 to drop to the point where T 2 is not conducting. State 2: transistor 1 on, transistor 2 off V C1 4 V, V 1 5.5 V, V E1 4 V V C2 11 V, V 2 2 V, V E2 4 V 12 V T 2 is saturated (V CE 0) T 1 is saturated (V CE 0) input output T 2 k 2 k 14 k 14 k 14 k 14 k 1 2 T -3 V 11.2 V V C1 time input C 1 k 4.1 V 11 time