Scribd Logo
Upload

Welcome to Scribd!

  • Lec 4 and 5

    Uploaded by

    Hazem Qaed
    17 views37 pages
    This document is a course document for a Computer Science course at the Higher Technological Institute. The document discusses minimizing Boolean functions using Karnaugh maps. It covers introducing Karnaugh maps and how they can be used to obtain product of sum and sum of product expressions for Boolean functions. It also discusses simplifying Boolean functions using tabulation methods and implementing Boolean functions using only NAND or NOR gates. The majority of the document is dedicated to providing examples and explanations of using Karnaugh maps to minimize Boolean functions.

    Original Description:

    Original Title

    Lec 4 and 5

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document is a course document for a Computer Science course at the Higher Technological Institute. The document discusses minimizing Boolean functions using Karnaugh maps. It covers introducing Karnaugh maps and how they can be used to obtain product of sum and sum of product expressions for Boolean functions. It also discusses simplifying Boolean functions using tabulation methods and implementing Boolean functions using only NAND or NOR gates. The majority of the document is dedicated to providing examples and explanations of using Karnaugh maps to minimize Boolean functions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    17 views37 pages

    Lec 4 and 5

    Uploaded by

    Hazem Qaed
    This document is a course document for a Computer Science course at the Higher Technological Institute. The document discusses minimizing Boolean functions using Karnaugh maps. It covers introducing Karnaugh maps and how they can be used to obtain product of sum and sum of product expressions for Boolean functions. It also discusses simplifying Boolean functions using tabulation methods and implementing Boolean functions using only NAND or NOR gates. The majority of the document is dedicated to providing examples and explanations of using Karnaugh maps to minimize Boolean functions.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as pdf or txt
    of 37

    Ministry of Higher Education Course: - BSC 215

    Higher Technological Institute Second level


    Computer Science Department

    11/2/2021 1
     Introduction.

     Karnaugh maps (K-map).

     Product of sum (POS) and sum of product (SOP)


    expressions using k-map.

     Implementation of boolean function using NAND/NOR


    gates only.

     Simplification of boolean functions using the tabulation


    method (quine-mccluskey method).
    11/2/2021 A. Prof. Ahmed Magdy 2
    Chapter 3
    Minimization of boolean
    functions using karnaugh maps

    11/2/2021 A. Prof. Ahmed Magdy 3


     The complexity of a logic function is a function of the
    number of gates in the circuit.
     The complexity of a gate is a function of the number of
    inputs to it.
     Because the logic circuit is a realization (implementation) of
    a Boolean function in hardware, reducing the number of
    literatures in the function should reduce the number of
    inputs to each gate and the number of gates in the circuit
    and hence reducing the complexity of the circuit.
     In this chapter we will describe two methods for
    minimization of the Boolean function. These two methods
    are Karnaugh map and Quine-McCluskey methods
    11/2/2021 A. Prof. Ahmed Magdy 4
    11/2/2021 A. Prof. Ahmed Magdy 5
    11/2/2021 A. Prof. Ahmed Magdy 6
    11/2/2021 A. Prof. Ahmed Magdy 7
    11/2/2021 A. Prof. Ahmed Magdy 8
    11/2/2021 A. Prof. Ahmed Magdy 9
    11/2/2021 A. Prof. Ahmed Magdy 10
    11/2/2021 A. Prof. Ahmed Magdy 11
    11/2/2021 A. Prof. Ahmed Magdy 12
    11/2/2021 A. Prof. Ahmed Magdy 13
    11/2/2021 A. Prof. Ahmed Magdy 14
    11/2/2021 A. Prof. Ahmed Magdy 15
    11/2/2021 A. Prof. Ahmed Magdy 16
    11/2/2021 A. Prof. Ahmed Magdy 17
    11/2/2021 A. Prof. Ahmed Magdy 18
    11/2/2021 A. Prof. Ahmed Magdy 19
    11/2/2021 A. Prof. Ahmed Magdy 20
    11/2/2021 A. Prof. Ahmed Magdy 21
    11/2/2021 A. Prof. Ahmed Magdy 22
    11/2/2021 A. Prof. Ahmed Magdy 23
    11/2/2021 A. Prof. Ahmed Magdy 24
    11/2/2021 A. Prof. Ahmed Magdy 25
    11/2/2021 A. Prof. Ahmed Magdy 26
    11/2/2021 A. Prof. Ahmed Magdy 27
    11/2/2021 A. Prof. Ahmed Magdy 28
    11/2/2021 A. Prof. Ahmed Magdy 29
    11/2/2021 A. Prof. Ahmed Magdy 30
    11/2/2021 A. Prof. Ahmed Magdy 31
    11/2/2021 A. Prof. Ahmed Magdy 32
    11/2/2021 A. Prof. Ahmed Magdy 33
    11/2/2021 A. Prof. Ahmed Magdy 34
    11/2/2021 A. Prof. Ahmed Magdy 35
    11/2/2021 A. Prof. Ahmed Magdy 36
    11/2/2021 A. Prof. Ahmed Magdy 37

    You might also like