Comparison of High Speed Modular Multiplication and Design of Expansible Systolic Array


The Transactions of the Korea Information Processing Society (1994 ~ 2000), Vol. 6, No. 5, pp. 1219-1224, May. 1999
10.3745/KIPSTE.1999.6.5.1219,   PDF Download:

Abstract

This paper derived Montgomery's parallel algorithms for modular multiplication based on Walter's and Iwamura's method, and compared data dependence graph of each parallel algorithm. Comparing the result, Walter's parallel algorithm has small computational index in data dependence graph, so it is selected and used to computed spatial and temporal pipelining diagrams with each projection direction for designing expansible bit-level systolic array. We also evaluated internal operation of proposed expansible systolic array with C language.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. B. Jo and C. S. Wook, "Comparison of High Speed Modular Multiplication and Design of Expansible Systolic Array," The Transactions of the Korea Information Processing Society (1994 ~ 2000), vol. 6, no. 5, pp. 1219-1224, 1999. DOI: 10.3745/KIPSTE.1999.6.5.1219.

[ACM Style]
Choo Bong Jo and Choi Sung Wook. 1999. Comparison of High Speed Modular Multiplication and Design of Expansible Systolic Array. The Transactions of the Korea Information Processing Society (1994 ~ 2000), 6, 5, (1999), 1219-1224. DOI: 10.3745/KIPSTE.1999.6.5.1219.