ECE 434 Advanced Digital Systems

Slides:



Advertisements
Similar presentations
Chapter 3 Gate-Level Minimization
Advertisements

K-Map Simplification COE 202 Digital Logic Design Dr. Aiman El-Maleh
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 8 – Systematic Simplification.
ECE 3110: Introduction to Digital Systems Simplifying Sum of Products using Karnaugh Maps.
ECE C03 Lecture 21 Lecture 2 Two Level Minimization Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal approach to simplification that is.
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
Boolean Algebra and Logic Simplification
1 Simplification of Boolean Functions:  An implementation of a Boolean Function requires the use of logic gates.  A smaller number of gates, with each.
1 Chapter 5 Karnaugh Maps Mei Yang ECG Logic Design 1.
Department of Computer Engineering
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
1 Digital Logic Design Week 5 Simplifying logic expressions.
1 © 2015 B. Wilkinson Modification date: January 1, 2015 Designing combinational circuits Logic circuits whose outputs are dependent upon the values placed.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.
ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.
Combinational Logic Part 2: Karnaugh maps (quick).
Unit 5 Karnaugh Maps Fundamentals of Logic Design by Roth and Kinney.
Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
Computer Engineering (Logic Circuits) (Karnaugh Map)
Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
Karnaugh Maps (K maps).
CEC 220 Digital Circuit Design Implicants Wed, Sept. 23 CEC 220 Digital Circuit Design Slide 1 of 10.
School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.
CHAPTER 6 Quine-McCluskey Method
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
CHAPTER 3 Simplification of Boolean Functions
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
ECE 2110: Introduction to Digital Systems
Computer Organisation
ECE 3110: Introduction to Digital Systems
QUINE-McCLUSKEY METHOD
ECE/CS 352 Digital Systems Fundamentals
CS 352 Introduction to Logic Design
ECE 2110: Introduction to Digital Systems
CPE/EE 422/522 Advanced Logic Design
EEL 3705 / 3705L Digital Logic Design
ECE 331 – Digital System Design
Digital Logic and Design
Basics Combinational Circuits Sequential Circuits Ahmad Jawdat
ECE 616 Advanced FPGA Designs
Instructor: Alexander Stoytchev
CSE140 HW2 Preparation Xinyuan Wang 04/20/2018.
Instructor: Alexander Stoytchev
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
ECE434a Advanced Digital Systems L02
SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.
CSE 370 – Winter 2002 – Logic minimization - 1
ECE 331 – Digital System Design
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Chapter 3 Gate-level Minimization.
MINTERMS and MAXTERMS Week 3
COE 202: Digital Logic Design Combinational Logic Part 3
Instructor: Alexander Stoytchev
Minimization of Switching Functions
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Overview Part 2 – Circuit Optimization
Instructor: Alexander Stoytchev
CHAPTER 6 QUINE-McCLUSKEY METHOD
Karnaugh Maps (K maps).
Laws & Rules of Boolean Algebra
Presentation transcript:

ECE 434 Advanced Digital Systems Electrical and Computer Engineering University of Western Ontario

General 1. Welcome remark Digital and analog Overview Note: 22/11/2018

Course Requirement Prerequisite and following courses Rules ECE339, ECE349, ECE489 Rules Attendance & Assignment Lab Midterm & final Note: 22/11/2018

Information Text book in library: Class notes and lab manual: Digital Systems Design Using VHDL, Charles H. Roth, Jr., PWS Publishing, 1998 (ISBN: 0-534-95099-X). S. Brown and Z. Vranesic, Fundamentals of Digital Logic with VHDL Design, McGraw Hill, 1999/2000 (Book should contain CD-ROM from Altera Corp). Class notes and lab manual: www.engga.uwo.ca/people/wwang Note: 22/11/2018

Information (cont’d) Labs: Assignments: Drop-off box LOCKER #10 EB3107 Digital lab: EB3097 Assignments: Two weeks from the post date Drop-off box LOCKER #10 EB3107 Note: 22/11/2018

Wei Wang Office: EC 1006 Office hours: Thursday 3:00 to 5:00 pm Email: wwang@eng.uwo.ca Note: 22/11/2018

Digital and Analog Digital TV Amplifier 22/11/2018

History DSP, telecommunication, computer, microprocessor 22/11/2018

1947 transisitor 22/11/2018

Overview Digital system VHDL FPGA and CPLD Note: 22/11/2018

Review of Logic Design Fundamentals Outline Review of Logic Design Fundamentals Combinational Logic Boolean Algebra and Algebraic Simplifications Karnaugh Maps 22/11/2018

Combinational Logic Has no memory => present state depends only on the present input X = x1 x2... xn Z = z1 z2... zm x1 z1 x2 z2 xn zm Note: Positive Logic – low voltage corresponds to a logic 0, high voltage to a logic 1 Negative Logic – low voltage corresponds to a logic 1, high voltage to a logic 0 22/11/2018

Basic Logic Gates 22/11/2018

Full Adder Module Truth table Algebraic expressions F(inputs for which the function is 1): Minterms m-notation 22/11/2018

Full Adder (cont’d) Module Truth table Algebraic expressions F(inputs for which the function is 0): Maxterms M-notation 22/11/2018

Boolean Algebra Basic mathematics used for logic design Laws and theorems can be used to simplify logic functions Why do we want to simplify logic functions? 22/11/2018

Laws and Theorems of Boolean Algebra 22/11/2018

Laws and Theorems of Boolean Algebra 22/11/2018

Simplifying Logic Expressions Combining terms Use XY+XY’=X, X+X=X Eliminating terms Use X+XY=X Eliminating literals Use X+X’Y=X+Y Adding redundant terms Add 0: XX’ Multiply with 1: (X+X’) 22/11/2018

Theorems to Apply to Exclusive-OR (Commutative law) (Associative law) (Distributive law) 22/11/2018

Karnaugh Maps Convenient way to simplify logic functions of 3, 4, 5, (6) variables Four-variable K-map each square corresponds to one of the 16 possible minterms 1 - minterm is present; 0 (or blank) – minterm is absent; X – don’t care the input can never occur, or the input occurs but the output is not specified adjacent cells differ in only one value => can be combined Location of minterms Based on AND and OR 22/11/2018

Karnaugh Maps (cont’d) Example 22/11/2018

Sum-of-products Representation Function consists of a sum of prime implicants Prime implicant a group of one, two, four, eight 1s on a map represents a prime implicant if it cannot be combined with another group of 1s to eliminate a variable Prime implicant is essential if it contains a 1 that is not contained in any other prime implicant Why? K-map and SOP and POS, why?  AND and OR gates 22/11/2018

Selection of Prime Implicants Two minimum forms 22/11/2018

Procedure for min Sum of products 1. Choose a minterm (a 1) that has not been covered yet 2. Find all 1s and Xs adjacent to that minterm 3. If a single term covers the minterm and all adjacent 1s and Xs, then that term is an essential prime implicant, so select that term 4. Repeat steps 1, 2, 3 until all essential prime implicants have been chosen 5. Find a minimum set of prime implicants that cover the remaining 1s on the map. If there is more than one such set, choose a set with a minimum number of literals 22/11/2018

Products of Sums F(1) = {0, 2, 3, 5, 6, 7, 8, 10, 11} F(X) = {14, 15} 22/11/2018

To Do Textbook Read Chapter 1.1, 1.2 Altera’s MAX+plus II and the UP1 Educational board: A User’s Guide, B. E. Wells, S. M. Loo Altera University Program Design Laboratory Package 22/11/2018