A SYSTOLIC DESIGN FOR GENERATING PERMUTATIONS IN LEXICOGRAPHIC ORDER
檔案
本條目沒有附加檔案。
日期
1994-05-01
類型
系所
期刊名稱
PARALLEL COMPUTING
卷期與頁次
第 20 卷第 5 期,頁 775–785
ISSN
0167-8191
語言
英文
摘要
In this paper, we shall design a systolic algorithm for generating all N! permutations of N objects. The algorithm is time efficient, generates all permutations in lexicographic order, and can be executed on a simple computation model (systolic array). Furthermore, because the algorithm is systolic, it is suitable for VLSI implementation.