• DocumentCode
    3401119
  • Title

    A systolic algorithm for integer GCD computation

  • Author

    Brent, R.P. ; Rung, H.T.

  • Author_Institution
    Centre for Mathematical Analysis Australian National University Canberra, A.C.T. 2601 Australia
  • fYear
    1985
  • fDate
    4-6 June 1985
  • Firstpage
    118
  • Lastpage
    125
  • Abstract
    It is shown that the greatest common divisor of two n-bit integers (given in the usual binary representation) can be computed in time O(n) on a linear systolic array of O(n) identical cells.
  • Keywords
    Arrays; Convergence; Hardware; Parallel algorithms; Pipelines; Polynomials; Very large scale integration;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computer Arithmetic (ARITH), 1985 IEEE 7th Symposium on
  • Conference_Location
    Urbana, IL,
  • Type

    conf

  • DOI
    10.1109/ARITH.1985.6158931
  • Filename
    6158931
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=3401119