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:   Print 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


Primary Entity

<http://www.worldcat.org/oclc/21006169> # A systolic algorithm for integer GCD computation
    a schema:CreativeWork, schema:Book ;
    library:oclcnum "21006169" ;
    library:placeOfPublication <http://experiment.worldcat.org/entity/work/data/3896357#Place/pittsburgh_pa> ; # Pittsburgh, Pa.
    library:placeOfPublication <http://id.loc.gov/vocabulary/countries/pau> ;
    schema:about <http://experiment.worldcat.org/entity/work/data/3896357#Topic/algorithmus> ; # Algorithmus
    schema:about <http://id.loc.gov/authorities/subjects/sh85067125> ; # Integrated circuits--Very large scale integration
    schema:about <http://experiment.worldcat.org/entity/work/data/3896357#Topic/grosster_gemeinsamer_teiler> ; # Größter gemeinsamer Teiler
    schema:about <http://id.worldcat.org/fast/975602> ; # Integrated circuits--Very large scale integration
    schema:about <http://id.worldcat.org/fast/1070715> ; # Polynomials
    schema:about <http://dewey.info/class/620.0042/> ;
    schema:bookFormat bgn:PrintBook ;
    schema:contributor <http://viaf.org/viaf/149544984> ; # Carnegie-Mellon University. Design Research Center.
    schema:contributor <http://viaf.org/viaf/27655304> ; # H. T. Kung
    schema:creator <http://viaf.org/viaf/223659213> ; # Richard P. Brent
    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:productID "21006169" ;
    schema:publication <http://www.worldcat.org/title/-/oclc/21006169#PublicationEvent/pittsburgh_pa_carnegie_mellon_university_design_research_center_1984> ;
    schema:publisher <http://experiment.worldcat.org/entity/work/data/3896357#Agent/carnegie_mellon_university_design_research_center> ; # Carnegie-Mellon University, Design Research Center
    wdrs:describedby <http://www.worldcat.org/title/-/oclc/21006169> ;
    .


Related Entities

<http://experiment.worldcat.org/entity/work/data/3896357#Agent/carnegie_mellon_university_design_research_center> # Carnegie-Mellon University, Design Research Center
    a bgn:Agent ;
    schema:name "Carnegie-Mellon University, Design Research Center" ;
    .

<http://experiment.worldcat.org/entity/work/data/3896357#Place/pittsburgh_pa> # Pittsburgh, Pa.
    a schema:Place ;
    schema:name "Pittsburgh, Pa." ;
    .

<http://experiment.worldcat.org/entity/work/data/3896357#Topic/grosster_gemeinsamer_teiler> # Größter gemeinsamer Teiler
    a schema:Intangible ;
    schema:name "Größter gemeinsamer Teiler"@en ;
    .

<http://id.loc.gov/authorities/subjects/sh85067125> # Integrated circuits--Very large scale integration
    a schema:Intangible ;
    schema:name "Integrated circuits--Very large scale integration"@en ;
    .

<http://id.worldcat.org/fast/1070715> # Polynomials
    a schema:Intangible ;
    schema:name "Polynomials"@en ;
    .

<http://id.worldcat.org/fast/975602> # Integrated circuits--Very large scale integration
    a schema:Intangible ;
    schema:name "Integrated circuits--Very large scale integration"@en ;
    .

<http://viaf.org/viaf/149544984> # Carnegie-Mellon University. Design Research Center.
    a schema:Organization ;
    schema:name "Carnegie-Mellon University. Design Research Center." ;
    .

<http://viaf.org/viaf/223659213> # Richard P. Brent
    a schema:Person ;
    schema:familyName "Brent" ;
    schema:givenName "Richard P." ;
    schema:givenName "R. P." ;
    schema:name "Richard P. Brent" ;
    .

<http://viaf.org/viaf/27655304> # H. T. Kung
    a schema:Person ;
    schema:familyName "Kung" ;
    schema:givenName "H. T." ;
    schema:name "H. T. Kung" ;
    .


Content-negotiable representations

Close Window

Please sign in to WorldCat 

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