Finite State Model and Compatibility Theory: New Analysis Tools for Permutation Networks
IEEE Transactions on Computers
Self-Routing Technique in Perfect-Shuffle Networks Using Control Tags
IEEE Transactions on Computers
| Hi-index | 14.98 |
Properties of some shuffle/exchange type permutation sets are studied from operational points of view. The permutation sets studied are Omega , Omega /sup -1/, Psi , L, and U; Omega and Omega /sup -1/ are, respectively, the omega and inverse omega permutation sets, Omega identical to ( Omega intersection Omega /sup -1/); and L and U are, respectively, the admissible lower and upper triangular permutation sets. Several intuitive operations are introduced. Based on these operations, important known results relating to these sets are readdressed. The recursive nature of the sets is also discussed.