Scribd Logo
Upload

Welcome to Scribd!

  • Array Multiplier: 4x4 Bit Binary Multiplication

    Uploaded by

    amitpanda
    6 views1 page
    This document describes a 4x4-bit binary array multiplier. It multiplies a 4-bit number A by a 4-bit number B to produce an 8-bit product. The multiplier uses 16 full adders in an array structure, with the outputs of each row of full adders comprising bits of the final product. It also provides a formula to calculate the worst case propagation delay through the full adder array.

    Original Description:

    srr

    Original Title

    Array Mult1

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This document describes a 4x4-bit binary array multiplier. It multiplies a 4-bit number A by a 4-bit number B to produce an 8-bit product. The multiplier uses 16 full adders in an array structure, with the outputs of each row of full adders comprising bits of the final product. It also provides a formula to calculate the worst case propagation delay through the full adder array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    6 views1 page

    Array Multiplier: 4x4 Bit Binary Multiplication

    Uploaded by

    amitpanda
    This document describes a 4x4-bit binary array multiplier. It multiplies a 4-bit number A by a 4-bit number B to produce an 8-bit product. The multiplier uses 16 full adders in an array structure, with the outputs of each row of full adders comprising bits of the final product. It also provides a formula to calculate the worst case propagation delay through the full adder array.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    Array Multiplier

    Version 1
    4x4Bit Binary Multiplication
    A3

    A2

    A1

    A0

    B0

    P0
    B1
    0
    coFA ci
    s

    coFA ci
    s

    coFA ci
    s

    coFA ci
    s

    P1
    B2

    coFA ci
    s

    coFA ci
    s

    coFA ci
    s

    coFA ci
    s

    P2
    B3

    P7

    coFA ci
    s

    coFA ci
    s

    coFA ci
    s

    coFA ci
    s

    P6

    P5

    P4

    P3

    Worst Case Propagation Delay: Tpd = [3N4]*tpd(FA)

    You might also like