This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On the Design of a Unidirectional Systolic Array for Key Enumeration
February 1990 (vol. 39 no. 2)
pp. 266-269

A systolic array for enumerating keys in n keys in 3n-1 time steps is introduced. This array has unidirectional data flow and achieves the maximum data pipelining rate. Modifications of the array for solving the closest-neighbor problems in computational geometry are presented.

[1] H. T. Kung and C. E. Leiserson, "Systolic arrays (for VLSI)," inProc. SIAM Sparse Matrix Symp., 1978, pp. 256-282.
[2] H. T. Kung, "Let's design algorithms for VLSI systems," inProc. Cal. Tech. Conf. VLSI, 1979, pp. 65-90.
[3] H. T. Kung, "Why systolic architectures?"IEEE Comput. Mag., vol. 15, pp. 37-46, Jan. 1982.
[4] D. E. Knuth,The Art of Computer Programming, Vol. 3, Reading, MA: Addison-Wesley, 1973.
[5] H. Yasuura, N. Takagi, and S. Yajima, "The parallel enumeration sorting scheme for VLSI,"IEEE Trans. Comput., vol. 31, pp. 1192- 1201, Dec. 1982.
[6] W. W. Su, "The design and analysis of systolic arrays," M.S. thesis, National Chaio Tung University, Taiwan, 1983.
[7] F. C. Lin and I. C. Wu, "Broadcast normalization in systolic design,"IEEE Trans. Comput., vol. 37, pp. 1428-1434, 1988.
[8] P. Y. Chen and M. Nussbaum, "Sorting with systolic architecture," inProc. 14th Int. Conf. Parallel Processing, 1985, pp. 865-868.
[9] D. Moldovan, "On the design of algorithms for VLSI systolic arrays,"Proc. IEEE, vol. 71, pp. 113-120, Jan. 1983.
[10] D. I. Moldovan and J. A. B. Fortes, "Partitioning and mapping algorithms into fixed size systolic arrays,"IEEE Trans. Comput., vol. C-35, pp. 1-12, Jan. 1986.
[11] F. P. Preparata and M. I. Shamos,Computational Geometry, an Introduction. New York: Springer-Verlag, 1985.
[12] H. T. Kung and M. S. Lam, "Wafer-scale integration and two-level pipelined implementation of systolic arrays,"J. Parallel Distribut. Comput., vol. 1, pp. 32-63, Aug. 1984.
[13] H. T. Kung, "Memory requirements for balanced computer architectures," inProc. 13th Annu. Int. Symp. Comput. Architecture, 1986, pp. 49-54.

Index Terms:
design; unidirectional systolic array; key enumeration; unidirectional data flow; maximum data pipelining rate; closest-neighbor problems; computational geometry; cellular arrays; computational geometry.
Citation:
F.-C. Lin, K. Chen, "On the Design of a Unidirectional Systolic Array for Key Enumeration," IEEE Transactions on Computers, vol. 39, no. 2, pp. 266-269, Feb. 1990, doi:10.1109/12.45213
Usage of this product signifies your acceptance of the Terms of Use.