This work was supported by the NatLiral Science Foundation of Fujian Provmce(No.Z0511035);the Scientific Research Foundation of Fujian Provincial Education Department(No.JA04249)
In this paper, a new routing algorithm is given for the shuffle-exchange permutation network (SEPn). The length of the path between any two nodes given by our algorithm is not more than 11/16n^2+O(n), i.e., the d...