A systolic generation of combinations |
| |
| Authors: | Chau-Jy Lin Jong-Chuang Tsay |
| |
| Institution: | (1) Department of Applied Mathematics and Institute of Computer Engineering, National Chiao Tung University, Hsinchu, Taiwan, Republic of China |
| |
| Abstract: | 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 proved to be correct. |
| |
| Keywords: | C 1 F 2 |
| 本文献已被 SpringerLink 等数据库收录！ |
|
