Matrix techniques for faster routing of affine permutations on a mesh interconnection network
Jop F. Sibeyn · 1990
We study the problem of routing arline permutations on a SIMD MESH-connected network without wrap-around connections. For a g"x g" MESH affine permutations can be described by an invertible log N x log N matrix A and a translation vector 5.