zoukankan      html  css  js  c++  java
  • multiplicationoverview

    High speed multipliers are typically classified into two categories. The first,known as parallel multiplication, involves the use of hardware to multiply a
    m-bit number by a n-bit number to completely produce a n+m product. Parallel multipliers can also be pipelined to reduce the cycle time and increase the
    throughput by introducing storage elements within the multiplier. On the other hand, serial or sequential multipliers compute the product sequentially usually
    utilizing storage elements so that hardware of the multiplier is reused during an iteration. The implementations presented in this chapter are primarily parallel
    multipliers since they usually provide the most benefit to a computer architecture at the expense of area. However, many of the designs presented here can
    be utilized in a sequential fashion as well.

    Multiplication usually involve three separate steps as listed below. Although ere are implementations that can theoretically be reduced to the generation
     the shifted multiples of the multiplicand and multi-operand addition (i.e.e addition of more than two operands), most multipliers utilize the steps below. Although there are various different perspectives on the implementation of multiplication, its basic entity usually is the adder.
    1 Partial Product (PP) Generation - utilizes a collection of gates to generate the partial product bits (i.e. ai · bi).
    2 Partial Product (PP) Reduction - utilizes adders (counters) to reduce the partial products to sum and carry vectors.
    3 Final Carry-Propagate Addition (CPA) - adds the sum and carry vectors to produce the product.

  • 相关阅读:
    MySQL数据丢失讨论
    分布式系统之Quorum (NRW)算法
    阿里巴巴-OS事业群-OS手机事业部-系统服务部门招聘Java开发工程师,有意者请进来
    EQueue
    ENode 2.0
    关于MySQL的在线扩容
    我收藏的技术知识图(每张都是大图)
    关于实现一个基于文件持久化的EventStore的核心构思
    Actor的原理
    OAuth 2.0 授权原理
  • 原文地址:https://www.cnblogs.com/zhoususheng/p/2990311.html
Copyright © 2011-2022 走看看