Name
Abstract | ||
|---|---|---|
A π network, which is a concatenation of 2 Ω networks [2], along with a simple control algorithm is proposed. This network is capable of performing all Ω network realizable permutations and the bit-permute-complement (BPC) class of permutations[5] in 0(log N) time. The control algorithm is actually a multiple-pass control algorithm on the Ω network, which is more general than Pease's LU decomposition method [6] and Lenfant's decomposition method[4]. |
Year | DOI | Venue |
|---|---|---|
1981 | 10.1109/TC.1981.1675778 | IEEE Trans. Computers |
Keywords | Field | DocType |
o network realizable permutation,lu decomposition method,p network,Ω,multiple-pass control algorithm,easily controlled network,decomposition algorithms,simple control algorithm,control algorithm,decomposition method,network,network partitions,bit-permute-complement permutations,o network,computer science,switches | Discrete mathematics,Binary logarithm,Control algorithm,Combinatorics,Computer science,Permutation,Decomposition method (constraint satisfaction),Concatenation,LU decomposition | Journal |
Volume | Issue | ISSN |
C | 4 | 0018-9340 |
Citations | PageRank | References |
17 | 1.90 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Pen-Chung Yew | 1 | 1430 | 133.52 |
| Duncan H. Lawrie | 2 | 1196 | 463.99 |