This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Routing Algorithms for Cellular Interconnection Arrays
October 1984 (vol. 33 no. 10)
pp. 939-942
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.
Index Terms:
transposition, Cellular interconnection arrays, cycle, interconnection networks, monotone increasing factorization, permutation
Citation:
A.Y. Oruc, D. Prakash, "Routing Algorithms for Cellular Interconnection Arrays," IEEE Transactions on Computers, vol. 33, no. 10, pp. 939-942, Oct. 1984, doi:10.1109/TC.1984.1676359
Usage of this product signifies your acceptance of the Terms of Use.