A merging network scheme that builds large sorting networks

We present a new scheme for building large sorting networks. The scheme is recursive in the sense of indicating how to build a large sorting network from modules of smaller sorting and merging networks. The scheme involves a regular wiring pattern between modules. When the scheme is applied to 2×2 comparison elements, we obtain a new sorting network with a wiring pattern that has fewer cross-over points than Batcher´s (1968) networks. When the scheme is applied to modules of a given size, for example 32×32 single-chip sorters, then we obtain a multi-chip implementation of larger sorting networks. Thus the scheme presented allows us to circumvent technology limitations that currently limit the size of sorters that are implementable