Fast Data Sort Based on Searching Networks with Ring Pipeline

Authors

  • Valery Sklyarov
  • Iouliia Skliarova
  • Alexander Sudnitson

DOI:

https://doi.org/10.5755/j01.eie.22.4.15920

Keywords:

Binary search networks, ring pipeline, block-based merge, communication-time circuits, system-on-chip

Abstract

The paper suggests a technique for fast data sort based on a specially organized binary searching network with the following new distinctive features: 1) data sort is done within the time of data acquisition through a serial interface; 2) a new type of pipeline, which we call ring pipeline, is created 3) the delay for receiving each data item is minimized thanks to the novel ring pipeline; 4) sorted data can be transmitted almost immediately after receiving the last input item; 5) several data sets may be sorted by the same network at the same acquisition time. It is proved theoretically that the network is very fast. It was modelled and evaluated in software and the basic components were synthesized and implemented in hardware. The results have shown a significant speed-up comparing to the best known alternatives.

DOI: http://dx.doi.org/10.5755/j01.eie.22.4.15920

Downloads

Published

2016-08-09

How to Cite

Sklyarov, V., Skliarova, I., & Sudnitson, A. (2016). Fast Data Sort Based on Searching Networks with Ring Pipeline. Elektronika Ir Elektrotechnika, 22(4), 58 - 62. https://doi.org/10.5755/j01.eie.22.4.15920

Issue

Vol. 22 No. 4 (2016)

Section

SYSTEM ENGINEERING, COMPUTER TECHNOLOGY

License

The copyright for the paper in this journal is retained by the author(s) with the first publication right granted to the journal. The authors agree to the Creative Commons Attribution 4.0 (CC BY 4.0) agreement under which the paper in the Journal is licensed.

By virtue of their appearance in this open access journal, papers are free to use with proper attribution in educational and other non-commercial settings with an acknowledgement of the initial publication in the journal.