{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T23:41:31Z","timestamp":1780357291835,"version":"3.54.1"},"reference-count":59,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2017,6,1]],"date-time":"2017-06-01T00:00:00Z","timestamp":1496275200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-0953447"],"award-info":[{"award-number":["CNS-0953447"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007065","name":"Nvidia and Synopsys","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007065","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. VLSI Syst."],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1109\/tvlsi.2017.2661746","type":"journal-article","created":{"date-parts":[[2017,2,22]],"date-time":"2017-02-22T19:13:13Z","timestamp":1487790793000},"page":"1930-1942","source":"Crossref","is-referenced-by-count":33,"title":["An Efficient O( $N$ ) Comparison-Free Sorting Algorithm"],"prefix":"10.1109","volume":"25","author":[{"given":"Saleh","family":"Abdel-Hafeez","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8865-8381","authenticated-orcid":false,"given":"Ann","family":"Gordon-Ross","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/81.508173"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/38.9.695"},{"key":"ref33","first-page":"387","article-title":"A fast VLSI implementation of sorting algorithm for standard median filters","author":"yu","year":"1999","journal-title":"Proc 12th Annu IEEE Int ASIC\/SOC Conf"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1016\/0885-064X(88)90014-3"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICASIC.2005.1611246"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/MELCON.2012.6196391"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/92.748211"},{"key":"ref36","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/j.micpro.2004.03.008","article-title":"FPGA-based implementation of recursive algorithms","volume":"28","author":"sklyarov","year":"2004","journal-title":"Microprocess Microsyst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1016\/j.compeleceng.2013.06.007"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2006.04.002"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/4.90101"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2002.1211"},{"key":"ref29","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1109\/43.743726","article-title":"An improved optimal algorithm for bubble-sorting-based non-Manhattan channel routing","volume":"18","author":"yan","year":"1999","journal-title":"IEEE Trans Comput -Aided Des Integr Circuits Syst"},{"key":"ref2","first-page":"70","article-title":"A simple and efficient VLSI sorting architecture","volume":"1","author":"bang","year":"1994","journal-title":"Proc 37th Midwest Symp Circuits Syst"},{"key":"ref1","author":"knuth","year":"2011","journal-title":"The art of computer programming"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161005"},{"key":"ref22","first-page":"363","article-title":"Selection of best sorting algorithm","volume":"2","author":"mishra","year":"2008","journal-title":"Int J Intell Inform Process"},{"key":"ref21","first-page":"199","article-title":"Choosing the ‘best’ sorting algorithm from optimal energy consumption","volume":"2","author":"bunse","year":"2009","journal-title":"Proceedings ICSOFT"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1016\/j.jlap.2008.12.003"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.04.005"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/PDP.2007.10"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2498\/cit.2004.01.01"},{"key":"ref50","year":"2017","journal-title":"Sorting Algorithm Animations"},{"key":"ref51","year":"2010","journal-title":"Cadence Online Documentation"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/4.753687"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1007\/s00034-011-9279-8"},{"key":"ref57","year":"2010","journal-title":"HSPICE"},{"key":"ref56","year":"2005","journal-title":"90 nm CMOS ASIC Process Digests"},{"key":"ref55","author":"lee","year":"2006","journal-title":"Advanced Digital Logic Design Using VHDL State Machines and Synthesis for FPGA’s"},{"key":"ref54","author":"hayes","year":"1994","journal-title":"Computer Architecture and Organization"},{"key":"ref53","author":"uyemura","year":"1999","journal-title":"CMOS Logic Circuit Design"},{"key":"ref52","year":"2015","journal-title":"Synopsys Online Documentation"},{"key":"ref10","first-page":"136","article-title":"Demonstration of sorting algorithms on mobile platforms","author":"meolic","year":"2013","journal-title":"Proc CSEDU"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(00)00098-3"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/CISP.2009.5302455"},{"key":"ref12","first-page":"360","article-title":"Fast algorithms for sorting and searching strings","author":"bentley","year":"1997","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/351827.384245"},{"key":"ref14","first-page":"522","article-title":"Comparison of sorting algorithms (on the basis of average case)","volume":"3","author":"sareen","year":"2013","journal-title":"Int J Adv Res Comput Sci Softw Eng"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/PACT.2007.4336211"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2011.07.004"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2010.11.010"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/1498698.1564500"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.5121\/ijdps.2012.3609"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.09.001"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1470"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2012.6284021"},{"key":"ref5","first-page":"62","article-title":"Popular sorting algorithms","volume":"1","author":"canaan","year":"2011","journal-title":"World Applied Programming"},{"key":"ref8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.4156\/jdcta.vol4.issue8.21","article-title":"Several incomplete sort algorithms for getting the median value","volume":"4","author":"fuguo","year":"2010","journal-title":"Int J Digital Content Technol Appl"},{"key":"ref49","first-page":"195","article-title":"Resolve: Generation of high-performance sorting architectures from high-level synthesis","author":"matai","year":"2016","journal-title":"Proc ACM\/SIGDA Int Symp Field Program Gate (FPGA)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ASICON.2013.6811927"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICEMI.2011.6037771"},{"key":"ref46","author":"hughes","year":"2014","journal-title":"Computer Graphics Principles and Practice"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2009.5118240"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/2854150"},{"key":"ref47","first-page":"240","article-title":"Energy and memory efficient mapping of bitonic sorting on FPGA","author":"chen","year":"2015","journal-title":"Proc ACM\/SIGDA Int Symp Field Program Gate (FPGA)"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2003.811982"},{"key":"ref41","first-page":"1","article-title":"Efficient sorting architectures in FPGA","author":"sz\u00e9ll","year":"2006","journal-title":"Proc Int Carpathian Control Conf (ICCC)"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2007.4298343"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2003.1206314"}],"container-title":["IEEE Transactions on Very Large Scale Integration (VLSI) Systems"],"original-title":[],"link":[{"URL":"http:\/\/ieeexplore.ieee.org\/ielaam\/92\/7932577\/7862290-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/92\/7932577\/07862290.pdf?arnumber=7862290","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:48:34Z","timestamp":1649443714000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7862290\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,6]]},"references-count":59,"journal-issue":{"issue":"6"},"URL":"https:\/\/doi.org\/10.1109\/tvlsi.2017.2661746","relation":{},"ISSN":["1063-8210","1557-9999"],"issn-type":[{"value":"1063-8210","type":"print"},{"value":"1557-9999","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,6]]}}}