WorldCat Linked Data Explorer

Turtle N-Triple JSON-LD RDF/XML HTML Contact Us Home

http://worldcat.org/entity/work/id/3896357

A systolic algorithm for integer GCD computation

Abstract: "We show 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 array of O(n) identical systolic cells, each of which is a finite-state machine with connections to its nearest neighbours."

Open All Close All

type

about

author

contributor

creator

description

http://schema.org/description

  • "Abstract: "We show 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 array of O(n) identical systolic cells, each of which is a finite-state machine with connections to its nearest neighbours.""@en
  • "In this document the authors show 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 array of O(n) identical systolic cells, each of which is a finite-state machine with connections to its nearest neighbours. (Author)."@en

name

http://schema.org/name

  • "A systolic algorithm for integer GCD computation"@en
  • "A systolic algorithm for integer GCD computation"
  • "A Systolic Algorithm for Integer GCD Computation. Revision"@en
  • "A systolic algorithm for interger GCD computation"
  • "A systolic algorithm for integer gcd computation"
  • "A Systolic Algorithm for Integer GCD computation"

workExample