Sorting on a > or = 2-D multistage architecture with nearest-neighbour interconnection of switches

The polymer matrix for the number of N inputs/ouputs, N stages and 2*2-switches is denoted as the 1-D Spanke-Benes (SB) network. Throughout the paper, the 1-D SB-network, which equals the diamond cellular array, is extended to arbitrary dimensions by a mathematical transformation (a 1-D network provides the interconnection of 1-D data). This transformation determines the multistage architecture completely by providing size, location, geometry and wiring of the switches as well as it preserves properties of the networks, e.g. the capability of sorting. SE-networks of dimension <or=3 are analysed and sorting is applied.