Scribd Logo
Upload

Welcome to Scribd!

  • 9 views

    Computer Architecture and Organization

    Uploaded by

    atharvajaaa
    The document describes the aim, objectives, theory and design issues related to a ripple carry adder experiment. The experiment aims to understand how carry ripples through stages of a ripple carry adder. It will examine the behavior of a working module and design a 4-bit ripple carry adder using full adders. The theory section explains that ripple carry adders add N-bit binary numbers using multiple full adders connected in series, where each full adder inputs the carry out of the previous stage. This causes the carry to ripple through the adder stages. The design issues section derives the boolean expressions for calculating the sum and carry out of a full adder in terms of its inputs.

    Copyright:

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

    Computer Architecture and Organization

    Uploaded by

    atharvajaaa
    9 views2 pages
    The document describes the aim, objectives, theory and design issues related to a ripple carry adder experiment. The experiment aims to understand how carry ripples through stages of a ripple carry adder. It will examine the behavior of a working module and design a 4-bit ripple carry adder using full adders. The theory section explains that ripple carry adders add N-bit binary numbers using multiple full adders connected in series, where each full adder inputs the carry out of the previous stage. This causes the carry to ripple through the adder stages. The design issues section derives the boolean expressions for calculating the sum and carry out of a full adder in terms of its inputs.

    Original Description:

    Book for COA

    Original Title

    Computer architecture and organization

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    The document describes the aim, objectives, theory and design issues related to a ripple carry adder experiment. The experiment aims to understand how carry ripples through stages of a ripple carry adder. It will examine the behavior of a working module and design a 4-bit ripple carry adder using full adders. The theory section explains that ripple carry adders add N-bit binary numbers using multiple full adders connected in series, where each full adder inputs the carry out of the previous stage. This causes the carry to ripple through the adder stages. The design issues section derives the boolean expressions for calculating the sum and carry out of a full adder in terms of its inputs.

    Copyright:

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

    Computer Architecture and Organization

    Uploaded by

    atharvajaaa
    The document describes the aim, objectives, theory and design issues related to a ripple carry adder experiment. The experiment aims to understand how carry ripples through stages of a ripple carry adder. It will examine the behavior of a working module and design a 4-bit ripple carry adder using full adders. The theory section explains that ripple carry adders add N-bit binary numbers using multiple full adders connected in series, where each full adder inputs the carry out of the previous stage. This causes the carry to ripple through the adder stages. The design issues section derives the boolean expressions for calculating the sum and carry out of a full adder in terms of its inputs.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    Experiment 2

    Aim :Design of Ripple Carry Adder.


    Objective :To understand the operation of a ripple carry adder, specifically
    how the carry ripples through the adder.
    1. examining the behavior of the working module to understand
    how the carry ripples through the adder stages
    2. to design a ripple carry adder using full adders to mimic the
    behavior of the working module
    3. the adder will add two 4 bit numbers

    Theory:
    Design of Ripple Carry Adders :
    Arithmetic operations like addition, subtraction, multiplication, division are
    basic operations to be implemented in digital computers using basic gates
    likr AND, OR, NOR, NAND etc. Among all the arithmetic operations if we can
    implement addition then it is easy to perform multiplication (by repeated
    addition), subtraction (by negating one operand) or division (repeated
    subtraction).
    Half Adders can be used to add two one bit binary numbers. It is also
    possible to create a logical circuit using multiple full adders to add N-bit
    binary numbers.Each full adder inputs a Cin, which is the Cout of the
    previous adder. This kind of adder is a Ripple Carry Adder, since each
    carry bit "ripples" to the next full adder. The first (and only the first) full
    adder may be replaced by a half adder.The block diagram of 4-bit Ripple
    Carry Adder is shown here below -

    The layout of ripple carry adder is simple, which allows for fast design time;
    however, the ripple carry adder is relatively slow, since each full adder must
    wait for the carry bit to be calculated from the previous full adder. The gate
    delay can easily be calculated by inspection of the full adder circuit. Each full
    adder requires three levels of logic.In a 32-bit [ripple carry] adder, there are
    32 full adders, so the critical path (worst case) delay is 31 * 2(for carry
    propagation) + 3(for sum) = 65 gate delays.
    Experiment 2

    Design Issues :
    The corresponding boolean expressions are given here to construct a ripple
    carry adder. In the half adder circuit the sum and carry bits are defined as

    sum = A ⊕ B
    carry = AB
    In the full adder circuit the the Sum and Carry outpur is defined by inputs A,
    B and Carryin as
    Sum=ABC + ABC + ABC + ABC
    Carry=ABC + ABC + ABC + ABC
    Having these we could design the circuit.But,we first check to see if there
    are any logically equivalent statements that would lead to a more structured
    equivalent circuit.
    With a little algebraic manipulation,one can see that
    Sum= ABC + ABC + ABC + ABC
    = (AB + AB) C + (AB + AB) C
    = (A ⊕ B) C + (A ⊕ B) C
    =A ⊕ B ⊕ C
    Carry= ABC + ABC + ABC + ABC
    = AB + (AB + AB) C
    = AB + (A ⊕ B) C

    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