1994
DOI: 10.1109/81.340851
|View full text |Cite
|
Sign up to set email alerts
|

VLSI array synthesis for polynomial GCD computation and application to finite field division

Abstract: Many practical algorithms have dynamic (or datadependent) dependency structure in their computation, which is not desirable for VLSI hardware implementation. Polynomial GCD computation by Euclid's algorithm is a typical example of dynamic dependency. In this paper, we use an algorithmic transformation technique to derive static (or data-independent) dependencies for Euclid's GCD algorithm. The resulting algorithm is mapped to a linear systolic array which is area-efficient and achieves maximum throughput with … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Year Published

1999
1999
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 10 publications
references
References 10 publications
(7 reference statements)
0
0
0
Order By: Relevance