Cellular Interconnection Arrays
IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
The Reverse-Exchange Interconnection Network
IEEE Transactions on Computers
Interconnection Networks from Three State Cells
IEEE Transactions on Computers
On a Class of Multistage Interconnection Networks
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Programming cellular permutation networks through decomposition of symmetric groups
IEEE Transactions on Computers
| Hi-index | 14.99 |
The paper describes an algebraic model which provides a means for realizing an arbitrary permutation through various cellular-array-type networks. The model views a cellular array as an ordered set of transposition maps where each transposition corresponds to a permutation cell of the array. A permutation realizable by such an array is then expressed as a composition of the transpositions where the rules for the composition are determined by the topology of the array.