• DocumentCode
    1209363
  • Title

    Bit-serial multipliers and squarers

  • Author

    Ienne, Paolo ; Viredaz, Marc A.

  • Author_Institution
    Mantra Centre for Neuro-Mimetic Syst., Swiss Federal Inst. of Technol., Lausanne, Switzerland
  • Volume
    43
  • Issue
    12
  • fYear
    1994
  • fDate
    12/1/1994 12:00:00 AM
  • Firstpage
    1445
  • Lastpage
    1450
  • Abstract
    Traditional bit-serial multipliers present one or more clock cycles of data-latency. In some situations, it is desirable to obtain the output after only a combinational delay, as in serial adders and subtracters. A serial multiplier and a squarer with no latency cycles are presented here. Both accept unsigned or sign-extended two´s complement numbers and produce an arbitrarily long output. They are fully modular and thus good candidates for introduction in VLSI libraries
  • Keywords
    adders; computational complexity; digital arithmetic; multiplying circuits; VLSI libraries; adders; bit-serial multipliers; clock cycles; combinational delay; data-latency; latency cycles; squarers; two´s complement numbers; Arithmetic; Clocks; Counting circuits; Delay; Flip-flops; Libraries; Multiplexing; Throughput; Very large scale integration; Wiring;
  • fLanguage
    English
  • Journal_Title
    Computers, IEEE Transactions on
  • Publisher
    ieee
  • ISSN
    0018-9340
  • Type

    jour

  • DOI
    10.1109/12.338107
  • Filename
    338107