Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd Logo
Upload

Welcome to Scribd!

  • 27 views

    Design and Implementation of Combinational Logic Circuil

    Uploaded by

    Ali Basim Al-Taei
    The document describes designing and implementing a combinational logic circuit. It provides an example of a chemical process that is activated if at least two of three keys are inserted. The problem is represented with a truth table and Boolean expressions. The expressions are simplified using Boolean algebra and a Karnaugh map. Finally, the expression is implemented using logic gates in a circuit.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd

    Design and Implementation of Combinational Logic Circuil

    Uploaded by

    Ali Basim Al-Taei
    27 views10 pages
    The document describes designing and implementing a combinational logic circuit. It provides an example of a chemical process that is activated if at least two of three keys are inserted. The problem is represented with a truth table and Boolean expressions. The expressions are simplified using Boolean algebra and a Karnaugh map. Finally, the expression is implemented using logic gates in a circuit.

    Original Title

    Untitled

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes designing and implementing a combinational logic circuit. It provides an example of a chemical process that is activated if at least two of three keys are inserted. The problem is represented with a truth table and Boolean expressions. The expressions are simplified using Boolean algebra and a Karnaugh map. Finally, the expression is implemented using logic gates in a circuit.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    27 views10 pages

    Design and Implementation of Combinational Logic Circuil

    Uploaded by

    Ali Basim Al-Taei
    The document describes designing and implementing a combinational logic circuit. It provides an example of a chemical process that is activated if at least two of three keys are inserted. The problem is represented with a truth table and Boolean expressions. The expressions are simplified using Boolean algebra and a Karnaugh map. Finally, the expression is implemented using logic gates in a circuit.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Download as docx, pdf, or txt
    of 10

    -Ministry of teaching & high education 2` class

    -Al-Mustansiriya University electrical Eng. . Lab


    -College of engineering exp. No. (2)
    -Computer engineering
    -Stage 1

    Design And Implementation of combinational


    Logic circuil

    By:-
    -‫سجاد سرمد‬
    objective:
    to study how to design logic circuits by representing the
    Boolean expression in POS form and SOP form and how
    to implement the Boolean expression by using the logic
    gates.

    Procedure:
    a certain Chemical Process is activated only if at least two
    out of the three keys are inserted, assuming that an
    inserted key produces logic 1, design a minimal logic
    circuit to activate the chemical process.

    1- Firstly we know that the number of inputs are


    three(A,B and C) and the number output is one (F). from
    the problem description we can build the following truth-
    table {table 2.2}. Obtain {F} shown in table 2.2 in the
    form:
    a. SOP
    b. POS
    Output Inputs
    .Seq A B C F

    0 0 0 0 0
    1 0 0 1 0
    2 0 1 0 0
    3 0 1 1 1
    4 1 0 0 0
    5 1 0 1 1
    6 1 1 0 1
    7 1 1 1 1

    2- Simplify (F) by using:


    a. Boolean algebra.

    Sol:
    F=A`Bc+AB`c+ABc`+ABc
    Bc(A`+A)+A(B`c+Bc`)=
    Bc+A(B`c+Bc`)=
    b.Karnuagh map.

    Sol:

    A
    B
    C
    C
    F
    C

    A
    B
    C

    3. Implement the (F) Boolean expression by using logic


    gates.

    Sol:
    we already did that in the lap
    Discussion:
    1- if AB=AC, then is it necessary to be true that B=C?
    show by a Truth table
    A B c AB Ac
    0 0 0 0 0
    0 0 1 0 0
    0 1 0 0 0
    0 1 1 0 0
    1 0 0 0 0
    1 0 1 0 1
    1 1 0 1 0
    1 1 1 1 1
    2- determine whether or not the following equations are
    correct
    a. ABC+A'BC= A
    Bc (A+A`)=A
    Bc(1)=A
    Bc=A

    b. AB`C+ABC'= A(B + C)
    A(B`c + Bc`)
    A(B + c) =A(B + c)

    3- Write a boolean expression for the following


    conditions:

    a.(F) is a (0) if any two of the three variables A,B and C


    are 1's,(F) is a (1) for all other conditions then simplify
    the expression by using Karnaugh map
    A B c f
    0 0 0 0
    0 0 1 0
    0 1 0 0
    0 1 1 1
    1 0 0 0
    1 0 1 1
    1 1 0 1
    1 1 1 1

    discussion:
    1.
    Seq. A B c F
    0 0 0 0 0
    1 0 0 1 0
    2 0 1 0 0
    3 0 1 1 1
    4 1 0 0 0
    5 1 0 1 1
    6 1 1 0 1
    7 1 1 1 1
    2. find the Karnaugh map of the following functions, then
    simplify them.

    a. F= A(B`+c) + A`c
    = AB`+Ac+A`c

    3. find (F) for the circuit below:

    F= (ABc + D)(c+D)
    F= (ABc + D)+(c+D)
    F= ABc . D`+c`D`
    :Sop
    .Seq A B C F

    3 0 1 1 1
    5 1 0 1 1
    6 1 1 0 1
    7 1 1 1 1

    You might also like