skip to content
A systolic algorithm for integer GCD computation Preview this item
ClosePreview this item
Checking...

A systolic algorithm for integer GCD computation

Author: R P Brent; H T Kung; Carnegie-Mellon University. Design Research Center.
Publisher: Pittsburgh, Pa. : Carnegie-Mellon University, Design Research Center, 1984.
Edition/Format:   Book : EnglishView all editions and formats
Database:WorldCat
Summary:
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."
Rating:

(not yet rated) 0 with reviews - Be the first.

Subjects
More like this

 

Find a copy in the library

&AllPage.SpinnerRetrieving; Finding libraries that hold this item...

Details

Document Type: Book
All Authors / Contributors: R P Brent; H T Kung; Carnegie-Mellon University. Design Research Center.
OCLC Number: 21006169
Notes: "December, 1984."
Description: 33 pages : illustrations ; 28 cm
Responsibility: by R.P. Brent and H.T. Kung.

Abstract:

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."

Reviews

User-contributed reviews
Retrieving GoodReads reviews...
Retrieving DOGObooks reviews...

Tags

Be the first.
Confirm this request

You may have already requested this item. Please select Ok if you would like to proceed with this request anyway.

Linked Data


<http://www.worldcat.org/oclc/21006169>
library:oclcnum"21006169"
library:placeOfPublication
library:placeOfPublication
rdf:typeschema:Book
schema:about
schema:about
<http://id.loc.gov/authorities/subjects/sh85067125>
rdf:typeschema:Intangible
schema:name"Integrated circuits--Very large scale integration."@en
schema:about
schema:about
<http://id.worldcat.org/fast/975602>
rdf:typeschema:Intangible
schema:name"Integrated circuits--Very large scale integration."@en
schema:about
schema:about
schema:contributor
<http://viaf.org/viaf/149544984>
rdf:typeschema:Organization
schema:name"Carnegie-Mellon University. Design Research Center."
schema:contributor
schema:creator
schema:datePublished"1984"
schema: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
schema:exampleOfWork<http://worldcat.org/entity/work/id/3896357>
schema:inLanguage"en"
schema:name"A systolic algorithm for integer GCD computation"@en
schema:publication
schema:publisher
wdrs:describedby

Content-negotiable representations

Close Window

Please sign in to WorldCat 

Don't have an account? You can easily create a free account.