標題: A COST-OPTIMAL SYSTOLIC ALGORITHM FOR GENERATING SUBSETS
作者: TSAY, JC
LEE, WP
交大名義發表
工學院
National Chiao Tung University
College of Engineering
關鍵字: COMBINATORIAL OBJECT;SPACE-TIME MAPPING;SUBSET;SYSTOLIC ALGORITHM
公開日期: 1994
摘要: Subset generation, generating all 2'' - 1 subsets of an n-element set, is frequently necessary in combinatorial algorithms. In this paper, we shall utilize Moldovan's space-time mapping methodology to design a systolic algorithm for the subset generation problem. The algorithm is a cost-optimal design and can generate all subsets in lexicographic order. Since it can be run on a simple linear systolic array, it is amenable to VLSI implementation.
URI: http://hdl.handle.net/11536/2705
ISSN: 0020-7160
期刊: INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
Volume: 50
Issue: 1-2
起始頁: 1
結束頁: 10
顯示於類別:期刊論文