AN EFFICIENT MULTIWAY MERGING SORTING NETWORK

A new efficient multiway merging sorting network is proposed,which is based on sloping and shaking multiway merging sorting algorithm.Its basic component is k sorters,i.e.,the k elements sorter.The concrete implementation of the multiway merging sorting network is discussed,and its delay time is analyzed.It is shown that compared with the Batcher sorting network,it is an efficient multiway merging sorting network.It has less delay time than the Batcher sorting network if specific design of k sorters is adopted.