Ch.4 Combinational Logic Circuits

Slides:



Advertisements
Similar presentations
Chapter 3 Gate-Level Minimization
Advertisements

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Chapter 3 Basic Logic Gates 1.
L14: Boolean Logic and Basic Gates
Gate-Level Minimization
Boolean Algebra and Reduction Techniques
Chapter 3 Basic Logic Gates 1.
Digital Systems: Combinational Logic Circuits
Boolean Algebra and Combinational Logic
Chapter 3 Basic Logic Gates
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
Chapter 4 Gates and Circuits.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.

EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Computer Engineering (Logic Circuits) (Karnaugh Map)
Digital Systems: Combinational Logic Circuits Digital IC Characteristics Wen-Hung Liao, Ph.D.
Digital Fundamentals with PLD Programming Floyd Chapter 4
Chapter 5 Boolean Algebra and Reduction Techniques William Kleitz Digital Electronics with VHDL, Quartus® II Version Copyright ©2006 by Pearson Education,
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
Digital Systems: Digital IC Characteristics
Introduction to Digital Logic Design Appendix A of CO&A Dr. Farag
Chapter 4 Gates and Circuits.
Introduction to Chapter 4
Overview of Chapter 3 °K-maps: an alternate approach to representing Boolean functions °K-map representation can be used to minimize Boolean functions.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
1 Logic Gates Digital Computer Logic Kashif Bashir WWW:
Digital Logic Chapter 4 Presented by Prof Tim Johnson
Digital Logic Basics Chapter 2 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 
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.
Chapter 3 (part 2) Basic Logic Gates 1.
Chapter 3 Basic Logic Gates William Kleitz Digital Electronics with VHDL, Quartus® II Version Copyright ©2006 by Pearson Education, Inc. Upper Saddle River,
Digital Systems: Combinational Logic Circuits Wen-Hung Liao, Ph.D.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Lecture 09 NAND and XOR Implementations. Overview °Developing NAND circuits °Two-level implementations Convert from AND/OR to NAND (again!) °Multi-level.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Pp244 In Sum-of-Products (SOP) form, basic.
Boolean Algebra and Reduction Techniques
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
Karnaugh Mapping Digital Electronics. Karnaugh Mapping or K-Mapping This presentation will demonstrate how to Create and label two, three, & four variable.
AGBell – EECT by Andrew G. Bell (260) Lecture 4.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 4 © 2008 Pearson Education.
Sum-of-Products (SOP)
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Chapter 4 – Combinational Logic Circuits Copyright © 2011, 2007, 2004, 2001, 1998 by Pearson Education, Inc. Upper Saddle River, New Jersey All.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Binary Numbers For digital systems, the.
Digital Logic Design Basics Combinational Circuits Sequential Circuits Pu-Jen Cheng Adapted from the slides prepared by S. Dandamudi for the book, Fundamentals.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Boolean Algebra & Logic Gates
DeMorgan’s Theorem DeMorgan’s 2nd Theorem
Boolean Algebra and Combinational Logic
Karnaugh Map Method.
Basics Combinational Circuits Sequential Circuits
CS105 Introduction to Computer Concepts GATES and CIRCUITS
BASIC & COMBINATIONAL LOGIC CIRCUIT
Chapter 4 – Combinational Logic Circuits
EET 1131 Unit 3 Basic Logic Gates
Laws & Rules of Boolean Algebra
Presentation transcript:

Ch.4 Combinational Logic Circuits

2 4-1.Sum-of-product (SOP) form for a Boolean Expression Useful in simplification and design Two or more AND terms ORed together –Ex: ABC+ABC, AB+ABC+CD+D, –the inversion sign cannot cover more than one variable Alternate form: Product-of-Sums (POS) –Another general form : (A+B+C)(A+C) –will not be used often in this course Review Questions –Which of the following is in SOP form? AB+CD+EAB(C+D)(A+B)(C+D+F) –Repeat the above for POS form

3 4-2.Simplifying Logic Circuits First obtain one expression for the circuit, then try to simplify. Example: Two methods for simplifying –Algebraic method (use Boolean algebra theorems) –Karnaugh mapping method (systematic, step-by-step approach)

4 4-3 Algebraic Simplification Put the original expression into SOP form by repeated application of DeMorgan theorems Once in SOP form, check for common factors and factor whenever possible. Example:

5 4-4 Combinational Logic Circuit Design (concept introduced by example) A logic circuit having 3 inputs, A, B, C will have its output HIGH only when a majority of the inputs are HIGH. Step1. Set up the truth table Step 2. Write the AND term for each case where the output is a 1. ABCx

6 Step 3. Write the SOP form the output Step 4. Simplify the output expression

7 Step 5. Implement the circuit x = BC + AC + AB

8 4-5 Karnaugh Map (K Map) Method K Map shows the relationship between inputs and outputs. The horizontally and vertically adjacent squares differ only in one variable.

9 Looping is a process combining the squares which contain 1s. The output expression can be simplified by looping. FIGURE 4-12 Examples of looping pairs of adjacent 1s.

10 FIGURE 4-13 Examples of looping groups of four 1s (quads).

Karnaugh Map (K Map) Method cont. FIGURE 4-14 Examples of looping groups of eight 1s (octets).

12 Summary : When a variable appears in both complemented and uncomplemented form within a loop, that variable is eliminated from the expression. Variables that are the same for all squares of the loop must appear in the final expression. Complete Simplification Process 1.Construct the K map and place 1s and 0s in the squares according to the truth table. 2.Loop the isolated 1s which are not adjacent to any other 1s. (single loops) 3.Loop any pair which contains a 1 adjacent to only one other 1. (double loops) 4.Loop any octet even if it contains one or more 1s that have already been looped. 5.Loop any quad that contains one or more 1s that have not already been looped, making sure to use the minimum number of loops. 6.Loop any pairs necessary to include any 1s that have not yet been looped, making sure to use the minimum number of loops. 7.Form the OR sum of all the terms generated by each loop.

Karnaugh Map (K Map) Method cont. FIGURE 4-15 Examples 4-10 to 4-12.

Karnaugh Map (K Map) Method cont. “Don’t-Care” Conditions are certain input conditions for which there are no specified output levels. FIGURE 4-18 “Don’t-care” conditions should be changed to either 0 or 1 to produce K-map looping that yields the simplest expression.

Karnaugh Map (K Map) Method cont. Summary Compared to the algebraic method, the K-map process is a more orderly process requiring fewer steps and always producing a minimum expression. For the circuits with large numbers of inputs (larger than four), other more complex techniques are used.

Exclusive-OR and Exclusive-NOR Circuits Exclusive-OR (XOR) produces a HIGH output whenever the two inputs are at opposite levels.

17 Exclusive-NOR (XNOR) : Exclusive-NOR (XNOR) produces a HIGH output whenever the two inputs are at the same level.

18 XNOR gate may be used to simplify circuit implementation.

Parity Generator and Checker FIGURE 4-25 XOR gates used to implement the parity generator and the parity checker for an even-parity system.

Enable/Disable Circuits FIGURE 4-26 Four basic gates can either enable or disable the passage of an input signal, A, under control of the logic level at control input B.

Enable/Disable Circuits cont. Example 4-21(Fig.a): Design a logic circuit that will allow a signal to pass to the output only when control inputs B and C are both HIGH; otherwise, the output will stay LOW. Example 4-22(Fig.b): Design a logic circuit that will allow a signal to pass to the output only when one, but not both, of the control inputs are HIGH; otherwise, the output will stay LOW.

Basic Characteristics of Digital ICs Digital ICs (chips): a collection of resistors, diodes and transistors fabricated on a single piece of semiconductor materials called substrate. Dual-in-line package (DIP) is a common type of packages.

Basic Characteristics of Digital ICs cont. Categorized according to the number of the gates on the substrate: SSI, MSI, LSI, VLSI, ULSI, GSI Categorized according to electric components used: Bipolar ICs (e.g. TTL family) and Unipolar Ics (e.g. CMOS family) FIGURE 4-30 (a) TTL INVERTER circuit; (b) CMOS INVERTER circuit. Pin numbers are given in parentheses.

Troubleshooting Digital Systems 3 basic steps –Fault detection, determine operation to expected operation. –Fault isolation, test and measure to isolate the fault. –Fault correction, repair the fault. Good troubleshooting skills come through experience in actual hands-on troubleshooting. The basic troubleshooting tools used here will be: the logic probe, oscilloscope, and logic pulser. The most important tool is the technician’s brain.

Troubleshooting Digital Systems The logic probe will indicate the presence or absence of a signal when touched to a pin as indicated below.

Internal Digital IC Faults Most common internal failures: –Malfunction in the internal circuitry. –Inputs or outputs shorted to ground or V CC –Inputs or outputs open-circuited –Short between two pins (other than ground or V CC )

Internal Digital IC Faults Malfunction in internal circuitry –Outputs do not respond properly to inputs. Outputs are unpredictable. Input internally shorted to ground or supply –The input will be stuck in LOW or HIGH state. Output internally shorted to ground or supply –Output will be stuck in LOW or HIGH state. Open-circuited input or output –Floating input in a TTL device will result in a HIGH output. Floating input in a CMOS device will result in erratic or possibly destructive output. –An open output will result in a floating indication. Short between two pins –The signal at those pins will always be identical.

28 FIGURE 4-35 (a) IC input internally shorted to ground; (b) IC input internally shorted to supply voltage. These two types of failures force the input signal at the shorted pin to stay in the same state. (c) IC output internally shorted to ground; (d) output internally shorted to supply voltage. These two failures do not affect signals at the IC inputs.

29 FIGURE 4-36

30 FIGURE 4-37

31 FIGURE 4-38

32 FIGURE 4-39

External Faults Open signal lines – signal is prevented from moving between points. Some causes: –Broken wire –Poor connections (solder or wire-wrap) –Cut or crack on PC board trace –Bent or broken IC pins. –Faulty IC socket Detect visually and verify with an ohmmeter.

External Faults Shorted signal lines – the same signal will appear on two or more pins. V CC or ground may also be shorted. Some causes: –Sloppy wiring –Solder bridges –Incomplete etching Detect visually and verify with an ohmmeter.

External Faults Faulty power supply – ICs will not operate or will operate erratically. –May lose regulation due to an internal fault or because circuits are drawing too much current. –Always verify that power supplies are providing the specified range of voltages and are properly grounded. –Use an oscilloscope to verify that AC signals are not present.

External Faults Output loading – caused by connecting too many inputs to the output of an IC. –Causes output voltage to fall into the indeterminate range. –This is called loading the output. –Usually a result of poor design or bad connection.

37 FIGURE 4-40

Troubleshooting Case Study Example 4-28 illustrates the process involved in troubleshooting a fairly simple circuit. The reasoning process can be applied to more complex digital circuits. Take the time to carefully study the example and use the opportunities at the end of the chapter to practice and develop troubleshooting skills.

39 FIGURE 4-41