Abstract Given n elements and an arbitrary integer m for m ⩽ n, a systolic algorithm for generating all r -subsets (subsets containing r elements) with 1 ⩽ r ⩽ m in lexicographic order is presented. The computational model used is a linear systolic array consisting of m identical processing elements with a simple structure. One subset is produced at a time step. The elapsed time within a time step is independent of integers r , n and m . The design process of systolic array and the verification… Expand