{"id":"https://openalex.org/W4308645235","doi":"https://doi.org/10.1109/icfpt56656.2022.9974486","title":"Using integer linear programming for correctly rounded multipartite architectures","display_name":"Using integer linear programming for correctly rounded multipartite architectures","publication_year":2022,"publication_date":"2022-12-05","ids":{"openalex":"https://openalex.org/W4308645235","doi":"https://doi.org/10.1109/icfpt56656.2022.9974486"},"language":"en","primary_location":{"id":"doi:10.1109/icfpt56656.2022.9974486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icfpt56656.2022.9974486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Field-Programmable Technology (ICFPT)","raw_type":"proceedings-article"},"type":"preprint","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/A5034281565","display_name":"Or\u00e9gane Desrentes","orcid":null},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Oregane Desrentes","raw_affiliation_strings":["École Normale Supérieure de Lyon,France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"École Normale Supérieure de Lyon,France","institution_ids":["https://openalex.org/I113428412"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035966925","display_name":"Florent de Dinechin","orcid":"https://orcid.org/0000-0003-4927-3301"},"institutions":[{"id":"https://openalex.org/I100532134","display_name":"Universit\u00e9 Claude Bernard Lyon 1","ror":"https://ror.org/029brtt94","country_code":"FR","type":"education","lineage":["https://openalex.org/I100532134","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I48430043","display_name":"Institut National des Sciences Appliqu\u00e9es de Lyon","ror":"https://ror.org/050jn9y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I203339264","https://openalex.org/I48430043"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Florent de Dinechin","raw_affiliation_strings":["Univ Lyon, INSA Lyon, Inria, CITI,France","Univ Lyon, INSA Lyon, Inria, CITI, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Univ Lyon, INSA Lyon, Inria, CITI,France","institution_ids":["https://openalex.org/I48430043","https://openalex.org/I100532134"]},{"raw_affiliation_string":"Univ Lyon, INSA Lyon, Inria, CITI, France","institution_ids":["https://openalex.org/I48430043","https://openalex.org/I100532134"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.1522,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.52097162,"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":"1","last_page":"8"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9955999851226807,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/multipartite","display_name":"Multipartite","score":0.852127730846405},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7001087069511414},{"id":"https://openalex.org/keywords/adder","display_name":"Adder","score":0.6395602226257324},{"id":"https://openalex.org/keywords/integer-programming","display_name":"Integer programming","score":0.561873197555542},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.5416361093521118},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42211470007896423},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.41945868730545044},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.41416698694229126},{"id":"https://openalex.org/keywords/compression","display_name":"Compression (physics)","score":0.4117695093154907},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.40869247913360596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38182199001312256},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17073944211006165},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.09025323390960693}],"concepts":[{"id":"https://openalex.org/C166733315","wikidata":"https://www.wikidata.org/wiki/Q6934831","display_name":"Multipartite","level":4,"score":0.852127730846405},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7001087069511414},{"id":"https://openalex.org/C164620267","wikidata":"https://www.wikidata.org/wiki/Q376953","display_name":"Adder","level":3,"score":0.6395602226257324},{"id":"https://openalex.org/C56086750","wikidata":"https://www.wikidata.org/wiki/Q6042592","display_name":"Integer programming","level":2,"score":0.561873197555542},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.5416361093521118},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42211470007896423},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.41945868730545044},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.41416698694229126},{"id":"https://openalex.org/C180016635","wikidata":"https://www.wikidata.org/wiki/Q2712821","display_name":"Compression (physics)","level":2,"score":0.4117695093154907},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.40869247913360596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38182199001312256},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17073944211006165},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.09025323390960693},{"id":"https://openalex.org/C121040770","wikidata":"https://www.wikidata.org/wiki/Q215675","display_name":"Quantum entanglement","level":3,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C84114770","wikidata":"https://www.wikidata.org/wiki/Q46344","display_name":"Quantum","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icfpt56656.2022.9974486","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icfpt56656.2022.9974486","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2022 International Conference on Field-Programmable Technology (ICFPT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5299999713897705,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[{"id":"https://openalex.org/G4230703500","display_name":"Improving Predictability of Numerical Computations","funder_award_id":"ANR-18-CE46-0011","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1505109187","https://openalex.org/W2047995285","https://openalex.org/W2071812325","https://openalex.org/W2111730172","https://openalex.org/W2122685238","https://openalex.org/W2132543649","https://openalex.org/W2139535992","https://openalex.org/W2523017333","https://openalex.org/W2570233623","https://openalex.org/W2785117529","https://openalex.org/W2973285591","https://openalex.org/W3110935306","https://openalex.org/W4235346344"],"related_works":["https://openalex.org/W2047683846","https://openalex.org/W2044902158","https://openalex.org/W2109912052","https://openalex.org/W1711527768","https://openalex.org/W4285278887","https://openalex.org/W2365237642","https://openalex.org/W2995925505","https://openalex.org/W2773399470","https://openalex.org/W3116484972","https://openalex.org/W2941986668"],"abstract_inverted_index":{"This":[0,54,82],"article":[1],"introduces":[2],"several":[3,28],"improvements":[4],"to":[5,63,116],"the":[6,13,35,56,64,67,84,96,99,107,118,131,136,139,143,146],"multipartite":[7,20,38,76],"method,":[8],"a":[9,23,87,111],"generic":[10,48],"technique":[11],"for":[12],"hardware":[14],"implementation":[15],"of":[16,25,37,58,66,98,106,121,130,138,145],"numerical":[17],"functions.":[18],"A":[19],"architecture":[21,123],"replaces":[22],"table":[24,80],"value":[26],"with":[27,95],"tables":[29,39],"and":[30],"an":[31,122],"adder":[32,147],"tree.":[33,148],"Here,":[34],"optimization":[36],"is":[40,110],"formalized":[41],"using":[42],"Integer":[43],"Linear":[44],"Programming":[45],"so":[46],"that":[47,114],"ILP":[49],"solvers":[50],"can":[51],"be":[52],"used.":[53],"improves":[55,83],"quality":[57],"faithfully":[59],"rounded":[60,75],"architectures":[61],"compared":[62,94],"state":[65,97],"art.":[68],"The":[69],"proposed":[70,108],"approach":[71],"also":[72],"enables":[73],"correctly":[74],"architectures,":[77],"providing":[78],"errorless":[79,102],"compression.":[81,103],"area":[85],"by":[86],"factor":[88],"5":[89],"without":[90],"any":[91],"performance":[92],"penalty":[93],"art":[100],"in":[101,124],"Another":[104],"improvement":[105],"work":[109],"cost":[112,120,144],"function":[113],"attempts":[115],"predict":[117],"total":[119],"FPGA":[125],"architectural":[126],"LUTs,":[127],"where":[128],"most":[129],"previous":[132],"works":[133],"only":[134],"count":[135],"size":[137],"tables,":[140],"thus":[141],"ignoring":[142]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2026-06-22T08:00:12.763002","created_date":"2025-10-10T00:00:00"}