Minimizing communication of a recirculating bitonic sorting network

This paper presents the construction of a new recirculating bitonic sorting network which reduces the O(Nlog/sup 2/N) cost complexity of the original bitonic sorting network to O(NlogN) while preserving the well known time complexity of O(log/sup 2/N). Network communication is reduced by one half by leaving the N/2 even-parity keys in the local memory of each comparator.