Abstract
The Atrubin systolic array, for multiplying two serially supplied integers in real-time, was invented in 1962, but to date, no simple explanation of its operation, or proof of its validity, has been published.
We present a methodical design of the array which yields a simple proof of its validity. First, we use a broadcast facility, and then we show how it can be removed by retiming which avoids the introduction of either slow-down or duplication.
A similar retiming technique can be used to remove instant-accumulation. These retiming methods are applicable to arrays of any dimension.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Atrubin, A.J., “A One-Dimensional Real-Time Iterative Multiplier”, IEEE Trans. on Electronic Computers, Vol. EC-14, No. 3, June 1965, pp. 394–c.
Cole, S.N., “Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines”, IEEE Trans. on Computers, Vol. C-18, No. 4, 1969, pp. 349–365.
Commoner, F., Holt, A.W., Even, S., Pnueli, A., “Marked Directed Graphs”, J. of Computer and System Sciences, Vol. 5, 1971, pp. 511–523.
Cohen, D., “Mathematical Approach to Computational Networks”, Information Sciences Inst., ISI/RR-78–73, Nov. 1978. ARPA order No. 2223.
Even, S., “Systolic Modular Multiplication”, presented in CRYPT’90. To appear in its proceedings.
Even, S., and Litman, A., “On the Capabilities of Systolic Systems”, to be presented in 3rd Annual ACM Symp. on Parallel Algorithms and Architectures, Hilton Head, South Carolina, July 21–24, 1991.
Leiserson, C.E., and Saxe, J.B., “Optimizing Synchronous Systems”, Twenty-Second Annual Symposium on Foundations of Computer Science, IEEE, 1981, pp. 23–36. Also
Leiserson, C.E., and Saxe, J.B., “Optimizing Synchronous Systems”Journal of VLSI and Computer Systems, Vol. 1, 1983, pp. 41–67.
Leiserson, C.E., Rose, F.M., and Saxe, J.B., “Optimizing Synchronous Circuitry by Retiming”, Third Caltech Conference on Very Large Scale Integration, ed. R. Bryant, Computer Science Press, 1983, pp. 87–116.
Sieferas, J.I., “Iterative Arrays with Direct Central Control”, Acta Informatica, Vol. 8, 1977, pp. 177–192.
Schonhage, A., and Strassen, V., “Schnelle Multiplikation grosser Zahlen”, Computing, Vol. 7, 1971, pp. 281–292.
Wallace, C.S., “A Suggestion for a Fast Multiplier”, IEEE Trans. on Electronic Computers, Vol. EC-13, Feb. 1964, pp. 14–17.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York, Inc.
About this paper
Cite this paper
Even, S., Litman, A. (1993). A Systematic Design and Explanation of the Atrubin Multiplier. In: Capocelli, R., De Santis, A., Vaccaro, U. (eds) Sequences II. Springer, New York, NY. https://doi.org/10.1007/978-1-4613-9323-8_14
Download citation
DOI: https://doi.org/10.1007/978-1-4613-9323-8_14
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4613-9325-2
Online ISBN: 978-1-4613-9323-8
eBook Packages: Springer Book Archive