Square interconnection network for data permutation

Abstract

In this paper a square cellular network for data permutation in a SIMD model is described. It has n/sup 2//4 2-permuters only, and realizes an arbitrary permutation pattern in two passes. For this network a programming algorithm is provided with O(n) sequential time complexity. Due to its regular cellular structure the square network is suitable for VLSI implementation.