• DocumentCode
    3543894
  • Title

    Multiplication by two integers using the minimum number of adders

  • Author

    Dempster, A.G. ; Macleod, M.D.

  • Author_Institution
    Univ. of Westminster, London, UK
  • fYear
    2005
  • fDate
    23-26 May 2005
  • Firstpage
    1814
  • Abstract
    The two-coefficient minimum-adder graph (MAG2) algorithm is described and shown to be optimal. A partial implementation, optimal for pairs of integers up to 8 bits, outperforms the best existing algorithms.
  • Keywords
    adders; digital arithmetic; graph theory; adders; integer multiplication; two-coefficient minimum-adder graph algorithm; Adders; Algorithm design and analysis; Application software; Circuit topology; Cost function; Finite impulse response filter; Integrated circuit interconnections; Terminology;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on
  • Print_ISBN
    0-7803-8834-8
  • Type

    conf

  • DOI
    10.1109/ISCAS.2005.1464962
  • Filename
    1464962
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3543894