Issue No. 03 - March (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.2172
A class of modified single-state shuffle/exchange (S/E) networks with reconfigurable connections is described. The capability of these modified networks to simulate every arbitrary permutation and other multistage S/E networks is studied. In particular, the upper bounds on simulating six multistage S/E networks are given. It is also shown that C.L. Wu and T.Y. Feng's (1981) modified single-stag
single-stage shuffle/exchange networks; reconfigurable connections; upper bounds; link folding scheme; connection complexity; computer networks.
S. Thanawastien and P. Srimani, "The Universality of a Class of Modified Single-Stage Shuffle/Exchange Networks," in IEEE Transactions on Computers, vol. 37, no. , pp. 348-352, 1988.