A systolic design for generating combinations in lexicographic order

@article{Tsay1990ASD,
  title={A systolic design for generating combinations in lexicographic order},
  author={J. Tsay and Chau-Jy Lin},
  journal={Parallel Comput.},
  year={1990},
  volume={13},
  pages={119-125}
}
Abstract A linear systolic array for generating all combinations of m items (m is given) out of n given items in lexicographic order is presented. Each processing element of the systolic array performs two simple if-then-else statements. It takes 2 ∗ n C m + (m − 1) time steps to generate all nCm combinations, where m is the number of processing elements. The correctness proof of this algorithm is also given. Due to its simplicity, regularity and local interconnection, the array is suitable for… Expand
5 Citations

Topics from this paper

Systolic Generation of combinations from Arbitrary Elements
  • 7
FPGA Generators of Combinatorial Configurations in a Linear Array Model
  • PDF
A Simple, Multi-Architecture, Parallel Procedure for Generating Combinations

References

SHOWING 1-10 OF 14 REFERENCES
Generating combinations in parallel
  • 20
Parallel generation of permutations and combinations
  • 39
On the design of algorithms for VLSI systolic arrays
  • 415
  • PDF
Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
  • 516
  • PDF
Optimizing synchronous systems
  • C. Leiserson, J. Saxe
  • Computer Science
  • 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981)
  • 1981
  • 521
  • PDF
Parallelism and Array Processing
  • V. Zakharov
  • Computer Science
  • IEEE Transactions on Computers
  • 1984
  • 47
On supercomputing with systolic/wavefront array processors
  • 326
The Structure of Parallel Algorithms
  • 208
VLSI Array processors
  • S. Kung
  • Computer Science
  • IEEE ASSP Magazine
  • 1985
  • 1,705
  • PDF
...
1
2
...