Scribd Logo
Upload

Welcome to Scribd!

  • Csave Add

    Uploaded by

    sunayana_ghosh2001
    6 views1 page
    The document describes a carry save adder (CSA) that can add 4 four-bit numbers using carry save stages to add the numbers in parallel without waiting for carry propagation. The CSA uses an array of full adders to generate sum and carry bits in each stage that are then combined in a final ripple-carry adder to generate the final sum, with the worst case delay being a function of the number of bits and numbers being added.

    Original Description:

    Original Title

    csave_add

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document describes a carry save adder (CSA) that can add 4 four-bit numbers using carry save stages to add the numbers in parallel without waiting for carry propagation. The CSA uses an array of full adders to generate sum and carry bits in each stage that are then combined in a final ripple-carry adder to generate the final sum, with the worst case delay being a function of the number of bits and numbers being added.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Csave Add

    Uploaded by

    sunayana_ghosh2001
    The document describes a carry save adder (CSA) that can add 4 four-bit numbers using carry save stages to add the numbers in parallel without waiting for carry propagation. The CSA uses an array of full adders to generate sum and carry bits in each stage that are then combined in a final ripple-carry adder to generate the final sum, with the worst case delay being a function of the number of bits and numbers being added.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Carry Save Adder (CSaA)

    Addition of four 4−Bit Numbers

    A0 B0 C0 A1 B1 C1 A2 B2 C2 A3 B3 C3

    Carry−Save
    a b a b a b a b Stages
    ci co ci co ci co ci co
    s s s s
    D0 D1 D2 D3

    a b a b a b a b
    ’0’ ci co ci co ci co ci co
    s s s s

    a b a b a b a b
    ’0’ ci co ci co ci co ci co Co
    s s s s

    S0 S1 S2 S3 S4

    Ripple−Carry Adder

    Note: Carry propagates diagonally through the array of adder cells


    Worst case Delay for Addition of N numbers with m−Bit Resolution: Tpd = [N−2+m]*tpd(FA)

    You might also like