Issue No. 10 - October (1984 vol. 33)
A.Y. Oruc , Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute
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.
transposition, Cellular interconnection arrays, cycle, interconnection networks, monotone increasing factorization, permutation
A. Oruc and D. Prakash, "Routing Algorithms for Cellular Interconnection Arrays," in IEEE Transactions on Computers, vol. 33, no. , pp. 939-942, 1984.