{"id":"https://openalex.org/W2582157376","doi":"https://doi.org/10.1109/patmos.2016.7833691","title":"Automatic design of arbitrary-size approximate sorting networks with error guarantee","display_name":"Automatic design of arbitrary-size approximate sorting networks with error guarantee","publication_year":2016,"publication_date":"2016-09-01","ids":{"openalex":"https://openalex.org/W2582157376","doi":"https://doi.org/10.1109/patmos.2016.7833691","mag":"2582157376"},"language":"en","primary_location":{"id":"doi:10.1109/patmos.2016.7833691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/patmos.2016.7833691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 26th International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071584701","display_name":"Vojt\u011bch Mr\u00e1zek","orcid":"https://orcid.org/0000-0002-9399-9313"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vojtech Mrazek","raw_affiliation_strings":["Faculty of Information Technology, Centre of Excellence IT4Innovations"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Centre of Excellence IT4Innovations","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086941203","display_name":"Zden\u011bk Va\u0161\u00ed\u010dek","orcid":"https://orcid.org/0000-0002-2279-5217"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zdenek Vasicek","raw_affiliation_strings":["Faculty of Information Technology, Centre of Excellence IT4Innovations"],"affiliations":[{"raw_affiliation_string":"Faculty of Information Technology, Centre of Excellence IT4Innovations","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5071584701"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.5791,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74228704,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"221","last_page":"228"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10363","display_name":"Low-power high-performance VLSI design","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.8434524536132812},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7979578971862793},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.7163492441177368},{"id":"https://openalex.org/keywords/sorting-network","display_name":"Sorting network","score":0.644574761390686},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.47029349207878113},{"id":"https://openalex.org/keywords/approximation-error","display_name":"Approximation error","score":0.4686158299446106},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.4638979434967041},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37571048736572266},{"id":"https://openalex.org/keywords/sorting-algorithm","display_name":"Sorting algorithm","score":0.3552080988883972},{"id":"https://openalex.org/keywords/computer-engineering","display_name":"Computer engineering","score":0.3334379494190216},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10222816467285156}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.8434524536132812},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7979578971862793},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.7163492441177368},{"id":"https://openalex.org/C64540648","wikidata":"https://www.wikidata.org/wiki/Q646477","display_name":"Sorting network","level":4,"score":0.644574761390686},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.47029349207878113},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.4686158299446106},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.4638979434967041},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37571048736572266},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.3552080988883972},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3334379494190216},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10222816467285156},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/patmos.2016.7833691","is_oa":false,"landing_page_url":"https://doi.org/10.1109/patmos.2016.7833691","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 26th International Workshop on Power and Timing Modeling, Optimization and Simulation (PATMOS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.800000011920929}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321006","display_name":"Grantov\u00e1 Agentura \u010cesk\u00e9 Republiky","ror":"https://ror.org/01pv73b02"},{"id":"https://openalex.org/F4320322748","display_name":"Vysok\u00e9 U\u010den\u00ed Technick\u00e9 v Brn\u011b","ror":"https://ror.org/03613d656"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W100509257","https://openalex.org/W1887311811","https://openalex.org/W1976284552","https://openalex.org/W2028660080","https://openalex.org/W2030081822","https://openalex.org/W2034581485","https://openalex.org/W2037524288","https://openalex.org/W2040974335","https://openalex.org/W2082385702","https://openalex.org/W2141389982","https://openalex.org/W2147229907","https://openalex.org/W2147312192","https://openalex.org/W2155371437","https://openalex.org/W2161830806","https://openalex.org/W2165011274","https://openalex.org/W2265166184","https://openalex.org/W2504193173","https://openalex.org/W2752061190","https://openalex.org/W2752853835","https://openalex.org/W4213333889","https://openalex.org/W6680874277","https://openalex.org/W6724839440","https://openalex.org/W6744529318"],"related_works":["https://openalex.org/W2396743875","https://openalex.org/W2094179388","https://openalex.org/W2126436988","https://openalex.org/W2325315917","https://openalex.org/W2372558933","https://openalex.org/W2385397541","https://openalex.org/W4391130025","https://openalex.org/W2054216114","https://openalex.org/W2374324126","https://openalex.org/W2381187503"],"abstract_inverted_index":{"Despite":[0],"the":[1,13,22,48,99,122,149,199],"fact":[2],"that":[3,198],"hardware":[4,42],"sorters":[5],"offer":[6],"great":[7],"performance,":[8],"they":[9],"become":[10],"expensive":[11],"as":[12,59],"number":[14],"of":[15,24,36,76,83,124,135],"inputs":[16],"increases.":[17],"In":[18,191],"order":[19],"to":[20,94,113,180,193,204],"address":[21],"problem":[23],"high-performance":[25],"and":[26,65,92,101,120,140,152],"power-efficient":[27,37],"computing,":[28],"we":[29],"propose":[30],"a":[31,168],"scalable":[32],"method":[33,70,110],"for":[34,41],"construction":[35,75],"sorting":[38,78,85,116],"networks":[39,79],"suitable":[40],"implementation.":[43],"The":[44,69,87,174],"proposed":[45],"approach":[46],"exploits":[47],"error":[49,136,139,141,170],"resilience":[50],"which":[51],"is":[52,71,90,111,178,196,202],"present":[53],"in":[54,148,161,171,176],"many":[55],"real-world":[56],"applications":[57],"such":[58],"digital":[60],"signal":[61],"processing,":[62],"biological":[63],"computing":[64],"large-scale":[66],"scientific":[67],"computing.":[68],"based":[72],"on":[73],"recursive":[74],"large":[77],"using":[80],"smaller":[81],"instances":[82],"approximate":[84,115,125],"networks.":[86,117],"design":[88,109],"process":[89],"tunable":[91],"enables":[93],"achieve":[95],"desired":[96],"tradeoffs":[97],"between":[98],"accuracy":[100,123],"power":[102,153,162],"consumption":[103,154,163],"or":[104],"implementation":[105,150],"cost.":[106],"A":[107,145],"search-based":[108],"used":[112],"obtain":[114],"To":[118],"measure":[119],"analyze":[121],"networks,":[126],"three":[127],"data-independent":[128],"quality":[129],"metrics":[130],"are":[131,143],"proposed.":[132],"Namely,":[133],"guarantee":[134],"probability,":[137],"worst-case":[138,200],"distribution":[142],"discussed.":[144],"significant":[146],"improvement":[147],"cost":[151],"was":[155,164],"obtained.":[156],"For":[157],"example,":[158],"20%":[159],"reduction":[160],"achieved":[165],"by":[166],"introducing":[167],"small":[169],"256-input":[172],"sorter.":[173],"difference":[175,201],"rank":[177],"proved":[179],"be":[181],"not":[182],"worse":[183],"than":[184],"2":[185],"with":[186],"probability":[187],"at":[188],"least":[189],"99%.":[190],"addition":[192],"that,":[194],"it":[195],"guaranteed":[197],"equal":[203],"6.":[205]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}