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

Welcome to Scribd!

  • 21 views

    Digital Logic Design Homework #2: Name: Đinh Thanh Tùng ID: EEACIU18098

    Uploaded by

    Tung Dinh
    This document contains a student's homework on digital logic design. It includes: 1) Four problems simplifying Boolean functions using K-maps. The functions and their simplified forms are provided. 2) Four additional problems simplifying Boolean expressions to a minimum number of literals. The expressions and simplified forms are shown. 3) One problem to design a logic circuit where the output is high when at least two inputs (A, B, C) are low. The truth table and simplified output using a K-map are presented.

    Copyright:

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

    Digital Logic Design Homework #2: Name: Đinh Thanh Tùng ID: EEACIU18098

    Uploaded by

    Tung Dinh
    21 views5 pages
    This document contains a student's homework on digital logic design. It includes: 1) Four problems simplifying Boolean functions using K-maps. The functions and their simplified forms are provided. 2) Four additional problems simplifying Boolean expressions to a minimum number of literals. The expressions and simplified forms are shown. 3) One problem to design a logic circuit where the output is high when at least two inputs (A, B, C) are low. The truth table and simplified output using a K-map are presented.

    Original Description:

    Original Title

    DLD_HW2.docx

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains a student's homework on digital logic design. It includes: 1) Four problems simplifying Boolean functions using K-maps. The functions and their simplified forms are provided. 2) Four additional problems simplifying Boolean expressions to a minimum number of literals. The expressions and simplified forms are shown. 3) One problem to design a logic circuit where the output is high when at least two inputs (A, B, C) are low. The truth table and simplified output using a K-map are presented.

    Copyright:

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

    Digital Logic Design Homework #2: Name: Đinh Thanh Tùng ID: EEACIU18098

    Uploaded by

    Tung Dinh
    This document contains a student's homework on digital logic design. It includes: 1) Four problems simplifying Boolean functions using K-maps. The functions and their simplified forms are provided. 2) Four additional problems simplifying Boolean expressions to a minimum number of literals. The expressions and simplified forms are shown. 3) One problem to design a logic circuit where the output is high when at least two inputs (A, B, C) are low. The truth table and simplified output using a K-map are presented.

    Copyright:

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

    Name: ĐINH THANH TÙNG

    ID: EEACIU18098

    DIGITAL LOGIC DESIGN


    HOMEWORK #2
    Problem 1: Simplify the following Boolean functions using K maps:

    a/ 𝐹(𝑥, 𝑦, 𝑧) = 𝛴 (0, 1, 3, 7)

    yz 00 01 11 10
    x
    0 1 1 1 0
    1 0 0 1 0

    𝐹(𝑥, 𝑦, 𝑧) = x’y’ + yz

    b/ 𝐹(𝑥, 𝑦, 𝑧) = 𝛴 (0, 1, 2, 4, 5)

    yz 00 01 11 10
    x
    0 1 1 0 1
    1 1 1 0 0

    𝐹(𝑥, 𝑦, 𝑧) = y’ + x’z’

    c/ 𝐹(𝑥, 𝑦, 𝑧) = 𝛴 (2, 3, 4, 5)

    yz 00 01 11 10
    x
    0 0 0 1 1
    1 1 1 0 0

    𝐹(𝑥, 𝑦, 𝑧) = xy’ + x’y

    d/ 𝐹 (𝑥, 𝑦, 𝑧) = 𝛴(1, 2, 3, 5, 7)

    yz 00 01 11 10
    x
    0 0 1 1 1
    1 0 1 1 0
    𝐹(𝑥, 𝑦, 𝑧) = z + x’y

    Problem 2: Simplify the following Boolean functions using K maps

    a/ 𝐹(𝑥, 𝑦, 𝑧) = 𝑥’𝑦’ + 𝑥𝑦𝑧 + 𝑥𝑦’𝑧

    yz 00 01 11 10
    x
    0 1 1 0 0
    1 0 1 1 0

    𝐹(𝑥, 𝑦, 𝑧) = x’y’ + xz

    b/ 𝐹(𝑥, 𝑦, 𝑧) = 𝑥𝑦 + 𝑦’𝑧’ + 𝑥𝑦’z

    yz 00 01 11 10
    x
    0 1 0 0 0
    1 1 1 1 1

    𝐹(𝑥, 𝑦, 𝑧) = x + y’z’

    c/ 𝐹(𝑥, 𝑦, 𝑧) = 𝑥𝑦’ + 𝑦’𝑧 + 𝑦z

    yz 00 01 11 10
    x
    0 0 1 1 0
    1 1 1 1 0

    𝐹(𝑥, 𝑦, 𝑧) = z + xy’

    d/ 𝐹(𝑥, 𝑦, 𝑧) = 𝑥𝑦𝑧 + 𝑥’𝑦’𝑧’ + 𝑥’𝑦z

    yz 00 01 11 10
    x
    0 1 0 1 0
    1 0 0 1 0

    𝐹(𝑥, 𝑦, 𝑧) = yz + x’y’z’
    Problem 3: Simplify the following Boolean expressions to a minimum number of literals

    a. 𝑥’𝑦’ + 𝑥’𝑦

    x’y’ + x’y = x’(y’ + y) = x’

    b. 𝑥𝑦𝑧 + 𝑦𝑧’ + 𝑥’𝑦𝑧

    xyz + yz’ + x’yz = (x + x’)yz + yz’

    = yz + yz’

    = y(z+ z’) = y

    c. (𝑥 + 𝑦)’(𝑥’ + 𝑦’)’

    (x + y)’(x’ + y’)’ = (x’y’) (xy)

    =0

    d. (𝑥 + 𝑦’ + 𝑧’)(𝑥’ + 𝑧’)’

    (x + y’ + z’)(x’ + z’)’ = (x + y’ + z’)xz

    = xxz + xy’z + xzz’

    = xz + xy’z

    = (1+ y’)xz

    =xz

    Problem 4: Obtain the truth table of the following functions, and express each function as a sum of
    minterms and a product of maxterms:

    a. (𝑥’ + 𝑦)(𝑦 + 𝑧’)

    x y z 𝑥’ + 𝑦 𝑦 + 𝑧’ (𝑥’ + 𝑦)(𝑦 + 𝑧’)


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

    - The midterms are the ones with 1’s : ∑(0,2,3,6,7)


    - The maxterms are the ones with the 0’s: Π( 1,4,5)
    b. (𝑥’𝑦’ + 𝑦’𝑧 + 𝑥𝑧’)(𝑥’ + 𝑧’)

    x y z 𝑥’𝑦’ 𝑦’𝑧 𝑥𝑧’ 𝑥’𝑦’ + 𝑦’𝑧 + 𝑥𝑧’ x' + z’ (𝑥’𝑦’ + 𝑦’𝑧 + 𝑥𝑧’)(𝑥’ + 𝑧’)

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

    - The midterms are the ones with 1’s : ∑(0,1,2,4,6)


    - The maxterms are the ones with the 0’s: Π(3,5,7)

    Problem 5: Design a logic circuit whose output X is HIGH when at least two inputs of A, B and C are
    low.

    a. Establish truth table for circuit

    A B C X
    0 0 0 0 1
    1 0 0 1 1
    2 0 1 0 1
    3 0 1 1 0
    4 1 0 0 1
    5 1 0 1 0
    6 1 1 0 0
    7 1 1 1 0

    b. Simplify the given output X by K map

    AB 00 01 11 10
    c
    0 1 1 0 1
    1 1 0 0 0
    X = A’B’ + A’C’ + B’C’

    The logic circuit:

    B
    X

    You might also like