A systolic generation of combinations

@article{Lin1989ASG,
  title={A systolic generation of combinations},
  author={Chau-Jy Lin and J. Tsay},
  journal={BIT Numerical Mathematics},
  year={1989},
  volume={29},
  pages={23-36}
}
A parallel algorithm for generating all combinations ofm (m fixed) items out of anyn given items in lexicographic order is presented. The computational model is a linear systolic array consisting ofm identical processing elements. This algorithm requires {ie23-1} time-steps for the {ie23-2} combinations, that is, one output at each time-step. Since all processing elements perform the same program, it is suitable for VLSI implementation. Based on mathematical induction, such an algorithm is… Expand
11 Citations
Systolic Generation of combinations from Arbitrary Elements
  • 7
On Parallel Generation of Combinations in Associative Processor Architectures
  • 11
  • PDF
A novel parallel algorithm for enumerating combinations
  • 3
  • PDF
Counting and generating integer partitions in parallel
  • L. Sanchis
  • Mathematics, Computer Science
  • Proceedings ICCI `92: Fourth International Conference on Computing and Information
  • 1992
  • 4
Systolic algorithm for the solution of dense linear equations
  • Chau-Jy Lin.
  • Mathematics, Computer Science
  • Int. J. Comput. Math.
  • 1990
  • 3
FPGA Generators of Combinatorial Configurations in a Linear Array Model
  • PDF
On random and adaptive parallel generation of combinatorial objects
  • 18
...
1
2
...

References

SHOWING 1-10 OF 12 REFERENCES
Generating combinations in parallel
  • 20
  • Highly Influential
Parallel generation of permutations and combinations
  • 39
  • Highly Influential
On the design of algorithms for VLSI systolic arrays
  • 413
  • PDF
Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
  • 516
  • PDF
An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order
  • I. Semba
  • Mathematics, Computer Science
  • J. Algorithms
  • 1984
  • 14
The Structure of Parallel Algorithms
  • 208
Parallelism and Array Processing
  • V. Zakharov
  • Computer Science
  • IEEE Transactions on Computers
  • 1984
  • 47
Permutation Generation Methods
  • 248
  • PDF
Approximate Algorithms for the 0/1 Knapsack Problem
  • 352
A new systolic architecture for convex hull and half-plane intersection problems
  • 8
...
1
2
...