The Community for Technology Leaders
Green Image
<p>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.</p>
design; unidirectional systolic array; key enumeration; unidirectional data flow; maximum data pipelining rate; closest-neighbor problems; computational geometry; cellular arrays; computational geometry.

F. Lin and K. Chen, "On the Design of a Unidirectional Systolic Array for Key Enumeration," in IEEE Transactions on Computers, vol. 39, no. , pp. 266-269, 1990.
111 ms
(Ver 3.3 (11022016))