A COST-OPTIMAL SYSTOLIC ALGORITHM FOR GENERATING SUBSETS

dc.citation.epage	10	en_US
dc.citation.issue	1-2	en_US
dc.citation.spage	1	en_US
dc.citation.volume	50	en_US
dc.citation.woscount	1
dc.contributor.author	TSAY, JC	en_US
dc.contributor.author	LEE, WP	en_US
dc.contributor.department	交大名義發表	zh_TW
dc.contributor.department	工學院	zh_TW
dc.contributor.department	National Chiao Tung University	en_US
dc.contributor.department	College of Engineering	en_US
dc.date.accessioned	2014-12-08T15:04:12Z
dc.date.available	2014-12-08T15:04:12Z
dc.date.issued	1994	en_US
dc.description.abstract	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.	en_US
dc.identifier.issn	0020-7160	en_US
dc.identifier.journal	INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS	en_US
dc.identifier.uri	https://ir.lib.nycu.edu.tw/handle/11536/2705
dc.identifier.wosnumber	WOS:A1994PG27800001
dc.language.iso	en_US	en_US
dc.subject	COMBINATORIAL OBJECT	en_US
dc.subject	SPACE-TIME MAPPING	en_US
dc.subject	SUBSET	en_US
dc.subject	SYSTOLIC ALGORITHM	en_US
dc.title	A COST-OPTIMAL SYSTOLIC ALGORITHM FOR GENERATING SUBSETS	en_US
dc.type	Article	en_US

Files

Now showing 1 - 1 of 1