A novel class of sorting networks

A novel class of Very Fast Sorting Networks based on the theoretical properties of sorting is presented. The sorting algorithm makes exclusive use of the n-input maximum and minimum. It is shown that it is possible to design a Sorting Network of any size if some suitable rules are adopted. The most important characteristic of this technique is that the total delay, which is lower than that of other solutions, is almost independent of the number of Sorting Network inputs. The Sorting Networks presented are easy to implement as VLSI circuits.