On the complexity of min-max sorting networks

  • Authors:

  • Giuseppe Campobello;Giuseppe Patanè;Marco Russo

  • Affiliations:

  • Department of Matter Physics and Electronic Engineering, University of Messina, C.da di Dio, 98166 Messina, Italy;DMCE Danube Mobile Communications Engineering GmbH & Co KG (majority owned by Intel Mobile Communications), RF System Engineering, Freistaedter Strasse 400, 4040 Linz, Austria;Department of Physics and Astronomy, Univeristy of Catania and National Institute of Nuclear Physics (INFN) Catania Section, Viale A. Doria, 6, 95125 Catania, Italy

  • Venue:
  • Information Sciences: an International Journal
  • Year:
  • 2012

Quantified Score

Hi-index 0.07

Visualization

Abstract

This paper extends previous work on sorting networks (SNs) based on min/max circuits. In particular, we have identified the complexity of both min/max-based sorting and merging networks showing that, depending on design choice, the time complexity of this kind of SN ranges from O(1) to O(log (n)) and spatial complexity from O(n2^n) to O(n^2), respectively. Moreover, we show that both AT and AT^2 metrics of the proposed SN are better than those of Batcher's SNs also for SNs with several hundreds of inputs. In addition to these results we show how to design a fast digital, serial, pipelined sorting network using FPGA technology. As expected, FPGA synthesis results confirm our theoretical analysis.