Scribd Logo
Upload

Welcome to Scribd!

  • 16 views

    Full Adder

    Uploaded by

    raffy arranguez
    This document summarizes the steps to design a full adder circuit. It includes: 1. Analyzing the inputs and outputs of a full adder which are 3 inputs (x, y, z) and 2 outputs (sum, carry). 2. Forming a truth table of the inputs and outputs. 3. Deriving the boolean expressions for the sum (S) and carry (C) outputs from the truth table. 4. Simplifying the boolean expressions for S and C. 5. Drawing the circuit diagram for the full adder using the simplified expressions. 6. Verifying the output of the circuit matches the truth table.

    Copyright:

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

    Full Adder

    Uploaded by

    raffy arranguez
    16 views2 pages
    This document summarizes the steps to design a full adder circuit. It includes: 1. Analyzing the inputs and outputs of a full adder which are 3 inputs (x, y, z) and 2 outputs (sum, carry). 2. Forming a truth table of the inputs and outputs. 3. Deriving the boolean expressions for the sum (S) and carry (C) outputs from the truth table. 4. Simplifying the boolean expressions for S and C. 5. Drawing the circuit diagram for the full adder using the simplified expressions. 6. Verifying the output of the circuit matches the truth table.

    Original Title

    Full adder

    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 summarizes the steps to design a full adder circuit. It includes: 1. Analyzing the inputs and outputs of a full adder which are 3 inputs (x, y, z) and 2 outputs (sum, carry). 2. Forming a truth table of the inputs and outputs. 3. Deriving the boolean expressions for the sum (S) and carry (C) outputs from the truth table. 4. Simplifying the boolean expressions for S and C. 5. Drawing the circuit diagram for the full adder using the simplified expressions. 6. Verifying the output of the circuit matches the truth table.

    Copyright:

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

    Full Adder

    Uploaded by

    raffy arranguez
    This document summarizes the steps to design a full adder circuit. It includes: 1. Analyzing the inputs and outputs of a full adder which are 3 inputs (x, y, z) and 2 outputs (sum, carry). 2. Forming a truth table of the inputs and outputs. 3. Deriving the boolean expressions for the sum (S) and carry (C) outputs from the truth table. 4. Simplifying the boolean expressions for S and C. 5. Drawing the circuit diagram for the full adder using the simplified expressions. 6. Verifying the output of the circuit matches the truth table.

    Copyright:

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

    Full adder

    Step 1. Analyzation

    # inputs - 3 inputs (addend(x), augend(y),cin(z))

    # outputs - 2 outputs (sum(s), cout(c))

    Step 2. Truth table

    inputs outputs
    x y Z(lsb) s c
    0 0 0 0 0
    0 0 1 1 0
    0 1 0 1 0
    0 1 1 0 1
    1 0 0 1 0
    1 0 1 0 1
    1 1 0 0 1
    1 1 1 1 1

    Step 3. Characteristics / Boolean function

    S (x,y,z) = ∑ (1,2,4,7)

    C(x,y,z) = ∑ (3,5,6,7)

    Step 4. Simplification

    For s

    xy 00 01 11 10
    Z 1 1
    0 0 2 6 4
    1 1
    1 1 3 7 5

    S = x’y’z + x’yz’ + xy’z’ + xyz

    = x’ (y’z + yz’) + x (y’z’ + yz) but y’z + yz’ = y xor z and y’z’ + yz = y xnor z

    = x’ ( y xor z ) + x (y xnor z) but y xnor z = ( y xor z )’ and let A = y xor z

    = x’ A + x A’

    = x xor A , substituting value of A

    S= x xor (y xor z)
    For c

    xy 00 01 11 10
    Z 1
    0 0 2 6 4
    1 1 1
    1 1 3 7 5

    C = yz + xz + xy

    Step 5. Diagram

    S= x xor (y xor z)

    C = yz + xz + xy

    Step 6. Test

    Output of the constructed diagram is the same with the outputs of the truth table formed in
    step 2.

    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