Scribd Logo
Upload

Welcome to Scribd!

  • 30 views

    DLD Lab 04

    Uploaded by

    kalmaaa66
    The document describes an experiment on Boolean expression simplification and implementation. Students were asked to simplify Boolean expressions using K-maps and Boolean algebra, draw the corresponding logic diagrams, obtain truth tables, and implement and verify the circuits in a digital electronics trainer. The experiment enhanced the students' understanding of applying Boolean algebra principles to simplify expressions and design digital logic circuits.

    Copyright:

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

    DLD Lab 04

    Uploaded by

    kalmaaa66
    30 views11 pages
    The document describes an experiment on Boolean expression simplification and implementation. Students were asked to simplify Boolean expressions using K-maps and Boolean algebra, draw the corresponding logic diagrams, obtain truth tables, and implement and verify the circuits in a digital electronics trainer. The experiment enhanced the students' understanding of applying Boolean algebra principles to simplify expressions and design digital logic circuits.

    Original Title

    DLD LAB 04

    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 an experiment on Boolean expression simplification and implementation. Students were asked to simplify Boolean expressions using K-maps and Boolean algebra, draw the corresponding logic diagrams, obtain truth tables, and implement and verify the circuits in a digital electronics trainer. The experiment enhanced the students' understanding of applying Boolean algebra principles to simplify expressions and design digital logic circuits.

    Copyright:

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

    DLD Lab 04

    Uploaded by

    kalmaaa66
    The document describes an experiment on Boolean expression simplification and implementation. Students were asked to simplify Boolean expressions using K-maps and Boolean algebra, draw the corresponding logic diagrams, obtain truth tables, and implement and verify the circuits in a digital electronics trainer. The experiment enhanced the students' understanding of applying Boolean algebra principles to simplify expressions and design digital logic circuits.

    Copyright:

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

    AIR UNIVERSITY

    DEPARTMENT OF ELECTRICAL AND COMPUTER ENGINEERING

    EXPERIMENT NO 4

    Lab Title: Boolean Expression Simplification and Implementation

    Student Name: AMMAR TAHIR (233084)


    ZAIN ALI (231710)
    MUHAMMAD DAWOOD (231768)

    LAB ASSESSMENT:

    Excellent Good Average Satisfactory Unsatisfactory


    Attributes (5) (4) (3) (2) (1)
    Ability to Conduct
    Experiment
    Ability to assimilate the
    results
    Effective use of lab
    equipment and follows
    the lab safety rules

    Total Marks: Obtained Marks:

    LAB REPORT ASSESSMENT:

    Excellent Good Average Satisfactory Unsatisfactory


    Attributes
    (5) (4) (3) (2) (1)

    Data presentation

    Experimental results

    Conclusion

    Total Marks: Obtained Marks:

    Date: Signature:
    EXPERIMENT 04

    Boolean Expression Simplification and Implementation

    Objectives:
     To understand the utilization of Boolean algebra in logic circuits.
     To write logic equation of a logic circuit from the logic diagram.
     Simplification of Boolean Expression using K-Map.

    Equipment required:
     TTL IC-7408
     TTL IC-7432
     TTL IC-7404
     TTL IC-7400
     TTL IC-7402
     TTL IC-7486
     Digital Electronics Trainer

    Task 1:
    Simplify the given expression and follow the given steps to verify the circuit.
    F = (X’Y’+Z)’ + Z + XY + WZ
    Steps:
    1. Obtain the truth table for the expression given above.
    2. Simplify the Expression using Boolean algebra.
    3. Draw the logic diagram for the simplified expression.
    4. Implement the circuit on trainer using the required logic gates and verify your circuit by applying
    all the possible input combinations to the circuit.

    Simplified Expression:
    F = X+Y+Z
    Logic Diagram:

    W F
    X
    Y
    Z

    Truth Table:

    Inputs Output
    W X Y Z F
    0 0 0 0 0

    0 0 0 1 1

    0 0 1 0 1

    0 0 1 1 1

    0 1 0 0 1

    0 1 0 1 1

    0 1 1 0 1

    0 1 1 1 1

    1 0 0 0 1

    1 0 0 1 1

    1 0 1 0 1

    1 0 1 1 1

    1 1 0 0 1

    1 1 0 1 1

    1 1 1 0 1

    1 1 1 1 1
    Simulation Results:
    Simulation Results:

    Task 2:
    Steps:
    1. Write the Logic expression for the circuit.
    2. Simplify the expression using Boolean algebra.
    3. Obtain the truth table for the simplified expression.
    4. Draw a new logic diagram for the simplified expression.
    5. Implement the circuit on trainer using the required logic gates.
    6. Verify your circuit by applying all the possible input combinations to the circuit.

    Logic Expression:

    Y + YZ + XY + YZ +XZ

    Simplified Expression:

    Y + XZ

    Logic Diagram for the Simplified Expression:


    Inputs Output
    X Y Z F
    0 0 0 0

    0 0 1 1

    0 1 0 0

    0 1 1 0

    1 0 0 1

    1 0 1 1

    1 1 0 1

    1 1 1 1

    Simulation Results:
    Expression:

    F = A’C + A’B + AB’C + BC


    Steps:
    1. Express the above mentioned expression in the form of sum of minterms.
    2. Draw the K-Map for the function.
    3. Find its simplified expression from K-map in SOP form.
    4. Draw the logic diagram for the simplified expression.
    5. Obtain a truth table for the simplified expression.
    6. Implement the logic circuit on trainer using the required logic gates.
    7. Verify your logic circuit by applying all the possible input combinations to the circuit.

    Canonical Form:
    F = m1 + m2 + m3 + m4

    K-MAP:

    BC

    A
    00 01 11 10

    0 1 0 0 1

    1 1 1 1 1

    Simplified Expression:
    F = A’ + B’C + AC
    Truth Table:

    Inputs Output
    A B C F
    0 0 0 1

    0 0 1 1

    0 1 0 1

    0 1 1 1

    1 0 0 0

    1 0 1 0

    1 1 0 1

    1 1 1 1

    Logic Diagram:

    X X

    Z
    Simulation Results:
    Simulation Results:

    Conclusion:
    This experiment delved into the practical application of Boolean algebra in simplifying
    logic expressions and implementing them using logic gates. Through the utilization of Karnaugh
    Maps and Boolean algebra, complex expressions were simplified to their minimal forms, facilitating
    more efficient circuit design. The verification of circuits through truth tables and simulation results
    provided concrete evidence of the correctness of the simplified expressions. This experiment has
    enhanced understanding of Boolean algebra principles and their practical implementation in digital
    logic circuits.

    You might also like

    pFad - Phonifier reborn

    Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

    Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


    Alternative Proxies:

    Alternative Proxy

    pFad Proxy

    pFad v3 Proxy

    pFad v4 Proxy