Scribd Logo
Upload

Welcome to Scribd!

  • Lecture 11, Advance Digital Design: Hassan Bhatti, Spring 2009

    Uploaded by

    indujcebala
    69 views38 pages
    The document summarizes topics from a lecture on advanced digital design, including: - Simple and efficient adder architectures like half adders, full adders, ripple carry adders, pipeline adders, carry select adders, and carry lookahead adders. - Division algorithms and examples of divider circuits. - Multiplier circuits like basic multipliers and more efficient designs like Booth multipliers and Wallace trees.

    Original Description:

    Original Title

    Adder-Notes Lecture 11

    Copyright

    © Attribution Non-Commercial (BY-NC)

    Available Formats

    PPT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes topics from a lecture on advanced digital design, including: - Simple and efficient adder architectures like half adders, full adders, ripple carry adders, pipeline adders, carry select adders, and carry lookahead adders. - Division algorithms and examples of divider circuits. - Multiplier circuits like basic multipliers and more efficient designs like Booth multipliers and Wallace trees.

    Copyright:

    Attribution Non-Commercial (BY-NC)
    Download as PPT, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    69 views38 pages

    Lecture 11, Advance Digital Design: Hassan Bhatti, Spring 2009

    Uploaded by

    indujcebala
    The document summarizes topics from a lecture on advanced digital design, including: - Simple and efficient adder architectures like half adders, full adders, ripple carry adders, pipeline adders, carry select adders, and carry lookahead adders. - Division algorithms and examples of divider circuits. - Multiplier circuits like basic multipliers and more efficient designs like Booth multipliers and Wallace trees.

    Copyright:

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

    Lecture 11, Advance Digital

    Design

    Hassan Bhatti, Spring 2009


    Today’s Topics

     Simple Adder Architectures


     Efficient Adders
     Division Algorithms
     Multipliers
     Efficient Multipliers (Booth Multiplier, Wallace
    Tree)
    HALF ADDER
    HALF Adder in Verilog
    Half Adder Using Data Flow
    Full Adder Architecture
    FULL adder using Data Flow Model
    Ripple Carry Adder
    Ripple Carry Adder
    Pipeline Adders: Single Stage
    Single Stage Pipelining
    Three Stage Pipeline Adder
    Carry Select Adder
    Uniform Stage Carry Select Adder
    Non Uniform Stage Carry Select Adder
    Non Uniform Stage Carry Select Adder
    Non Uniform Stage Carry Select Adder
    Carry Look Ahead Adder
    Carry Look Ahead
    Carry Look Ahead
    Carry Look Ahead Adders
    Carry Look Ahead Block
    Delay of Carry Look Ahead
    Delay of Carry Look Ahead
    Implementation of Carry Look
    Ahead
    Area and Delay of Adders
    Conditional Sum Adder
    Conditional Sum Adder
    Conditional Sum Adder: Example
    Conditional Sum Adder: Example 8-Bits
    Conditional Sum Adder: Example 16-
    Bits
    Dividers-1:

    For Details See Chapter-6-7-4 Bernard Sklar, Digital Communication


    Dividers-1: Verification of the Result

    For Details See Chapter-6-7-4 Bernard Sklar, Digital Communication


    Dividers-2

    Reference: Article 3-5 Hennesy,Patterson, Computer Organization and Design


    Dividers-2: Example

    Reference: Article 3-5 Hennesy,Patterson, Computer Organization and Design


    Divisors-2: Easy Circuit

    Reference: Article 3-5 Hennesy,Patterson, Computer Organization and Design


    Divisors-2: Improved Circuit

    Reference: Article 3-5 Hennesy,Patterson, Computer Organization and Design


    Courtesy and Acknowledgement of
    Slides and Pictures
     Adder Architecture are Taken for Dr. Shoab
    A. Khan Lectures

    You might also like