{"id":"https://openalex.org/W3141196428","doi":"https://doi.org/10.1109/dsd.2007.4341460","title":"Exploiting Parallelism in Double Path Adders' Structure for Increased Throughput of Floating Point Addition","display_name":"Exploiting Parallelism in Double Path Adders' Structure for Increased Throughput of Floating Point Addition","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W3141196428","doi":"https://doi.org/10.1109/dsd.2007.4341460","mag":"3141196428"},"language":"en","primary_location":{"id":"doi:10.1109/dsd.2007.4341460","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsd.2007.4341460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD 2007)","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/A5045308058","display_name":"Alexandru Amaric\u0103i","orcid":"https://orcid.org/0000-0002-2706-1781"},"institutions":[{"id":"https://openalex.org/I3122695212","display_name":"Polytechnic University of Timi\u015foara","ror":"https://ror.org/02v91gy68","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122695212"]}],"countries":["RO"],"is_corresponding":true,"raw_author_name":"Alexandru Amaricai","raw_affiliation_strings":["Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara, Romania","Computer Science and Engineering Department, \"Politehnica\" University of Timisoara, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara, Romania","institution_ids":["https://openalex.org/I3122695212"]},{"raw_affiliation_string":"Computer Science and Engineering Department, \"Politehnica\" University of Timisoara, Romania","institution_ids":["https://openalex.org/I3122695212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5098527837","display_name":"Mircea Vladupiu","orcid":null},"institutions":[{"id":"https://openalex.org/I3122695212","display_name":"Polytechnic University of Timi\u015foara","ror":"https://ror.org/02v91gy68","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122695212"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Mircea Vladupiu","raw_affiliation_strings":["Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara","Computer Science and Engineering Department, \"Politehnica\" University of Timisoara"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara","institution_ids":["https://openalex.org/I3122695212"]},{"raw_affiliation_string":"Computer Science and Engineering Department, \"Politehnica\" University of Timisoara","institution_ids":["https://openalex.org/I3122695212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049151814","display_name":"Lucian Prodan","orcid":null},"institutions":[{"id":"https://openalex.org/I3122695212","display_name":"Polytechnic University of Timi\u015foara","ror":"https://ror.org/02v91gy68","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122695212"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Lucian Prodan","raw_affiliation_strings":["Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara, Romania","Computer Science and Engineering Department, \"Politehnica\" University of Timisoara, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara, Romania","institution_ids":["https://openalex.org/I3122695212"]},{"raw_affiliation_string":"Computer Science and Engineering Department, \"Politehnica\" University of Timisoara, Romania","institution_ids":["https://openalex.org/I3122695212"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5061592063","display_name":"Mihai Udrescu","orcid":"https://orcid.org/0000-0002-7607-9240"},"institutions":[{"id":"https://openalex.org/I3122695212","display_name":"Polytechnic University of Timi\u015foara","ror":"https://ror.org/02v91gy68","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122695212"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Mihai Udrescu","raw_affiliation_strings":["Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara, Romania","Computer Science and Engineering Department, \"Politehnica\" University of Timisoara, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara, Romania","institution_ids":["https://openalex.org/I3122695212"]},{"raw_affiliation_string":"Computer Science and Engineering Department, \"Politehnica\" University of Timisoara, Romania","institution_ids":["https://openalex.org/I3122695212"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052005986","display_name":"Oana Boncalo","orcid":"https://orcid.org/0000-0002-9211-2311"},"institutions":[{"id":"https://openalex.org/I3122695212","display_name":"Polytechnic University of Timi\u015foara","ror":"https://ror.org/02v91gy68","country_code":"RO","type":"education","lineage":["https://openalex.org/I3122695212"]}],"countries":["RO"],"is_corresponding":false,"raw_author_name":"Oana Boncalo","raw_affiliation_strings":["Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara, Romania","Computer Science and Engineering Department, \"Politehnica\" University of Timisoara, Romania"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering Department, \u201cPolitehnica\u201d University of Timisoara, Romania","institution_ids":["https://openalex.org/I3122695212"]},{"raw_affiliation_string":"Computer Science and Engineering Department, \"Politehnica\" University of Timisoara, Romania","institution_ids":["https://openalex.org/I3122695212"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5045308058"],"corresponding_institution_ids":["https://openalex.org/I3122695212"],"apc_list":null,"apc_paid":null,"fwci":1.0929,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80172848,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"132","last_page":"137"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11697","display_name":"Numerical Methods and Algorithms","score":0.9998000264167786,"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.9998000264167786,"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.9984999895095825,"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/T11034","display_name":"Digital Filter Design and Implementation","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/adder","display_name":"Adder","score":0.9642304182052612},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6875849366188049},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6800854802131653},{"id":"https://openalex.org/keywords/carry-save-adder","display_name":"Carry-save adder","score":0.6476528644561768},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.6404900550842285},{"id":"https://openalex.org/keywords/floating-point","display_name":"Floating point","score":0.6370376348495483},{"id":"https://openalex.org/keywords/latency","display_name":"Latency (audio)","score":0.6198043823242188},{"id":"https://openalex.org/keywords/double-precision-floating-point-format","display_name":"Double-precision floating-point format","score":0.4780633747577667},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47390663623809814},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.47059929370880127},{"id":"https://openalex.org/keywords/serial-binary-adder","display_name":"Serial binary adder","score":0.45435041189193726},{"id":"https://openalex.org/keywords/low-latency","display_name":"Low latency (capital markets)","score":0.4131411612033844},{"id":"https://openalex.org/keywords/computer-hardware","display_name":"Computer hardware","score":0.3674112558364868},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.3625342845916748},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.27108150720596313},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17087194323539734},{"id":"https://openalex.org/keywords/telecommunications","display_name":"Telecommunications","score":0.07388454675674438},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05540269613265991}],"concepts":[{"id":"https://openalex.org/C164620267","wikidata":"https://www.wikidata.org/wiki/Q376953","display_name":"Adder","level":3,"score":0.9642304182052612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6875849366188049},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6800854802131653},{"id":"https://openalex.org/C3227080","wikidata":"https://www.wikidata.org/wiki/Q5046770","display_name":"Carry-save adder","level":4,"score":0.6476528644561768},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.6404900550842285},{"id":"https://openalex.org/C84211073","wikidata":"https://www.wikidata.org/wiki/Q117879","display_name":"Floating point","level":2,"score":0.6370376348495483},{"id":"https://openalex.org/C82876162","wikidata":"https://www.wikidata.org/wiki/Q17096504","display_name":"Latency (audio)","level":2,"score":0.6198043823242188},{"id":"https://openalex.org/C35912277","wikidata":"https://www.wikidata.org/wiki/Q1243369","display_name":"Double-precision floating-point format","level":3,"score":0.4780633747577667},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47390663623809814},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.47059929370880127},{"id":"https://openalex.org/C116206932","wikidata":"https://www.wikidata.org/wiki/Q7454686","display_name":"Serial binary adder","level":4,"score":0.45435041189193726},{"id":"https://openalex.org/C46637626","wikidata":"https://www.wikidata.org/wiki/Q6693015","display_name":"Low latency (capital markets)","level":2,"score":0.4131411612033844},{"id":"https://openalex.org/C9390403","wikidata":"https://www.wikidata.org/wiki/Q3966","display_name":"Computer hardware","level":1,"score":0.3674112558364868},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.3625342845916748},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.27108150720596313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17087194323539734},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.07388454675674438},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05540269613265991},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/dsd.2007.4341460","is_oa":false,"landing_page_url":"https://doi.org/10.1109/dsd.2007.4341460","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (DSD 2007)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1558457238","https://openalex.org/W1604516392","https://openalex.org/W1693331953","https://openalex.org/W1944989747","https://openalex.org/W2107170344","https://openalex.org/W2171240804","https://openalex.org/W6633343075","https://openalex.org/W6636109441","https://openalex.org/W6637796343","https://openalex.org/W6676286007","https://openalex.org/W6759416110"],"related_works":["https://openalex.org/W2364181090","https://openalex.org/W3215589575","https://openalex.org/W4299002946","https://openalex.org/W2950518102","https://openalex.org/W2336476964","https://openalex.org/W3150959508","https://openalex.org/W2953746839","https://openalex.org/W1571090276","https://openalex.org/W2516396101","https://openalex.org/W2530498711"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"a":[3,38,43,68],"novel":[4],"approach":[5],"for":[6,75],"increasing":[7],"the":[8,11,21,58,72,76,89,92,106,112],"performance":[9],"of":[10,57,71,87,91],"floating":[12,33,48,82],"point":[13,34,49,83],"addition,":[14],"by":[15,111],"efficiently":[16],"exploiting":[17],"both":[18],"paths":[19],"from":[20],"classical":[22],"double":[23,102],"path":[24,103],"adder.":[25],"Thus,":[26],"it":[27],"becomes":[28],"possible":[29],"to":[30,100],"execute":[31],"two":[32,47],"additions":[35,50],"simultaneously":[36],"using":[37],"single":[39],"adder,":[40],"each":[41],"on":[42],"different":[44],"path.":[45],"Performing":[46],"in":[51],"this":[52],"manner":[53],"will":[54],"requires":[55],"duplication":[56],"signs":[59],"and":[60],"exponent":[61],"computation":[62],"modules.":[63],"The":[64],"cost":[65],"estimates":[66],"show":[67],"20%":[69],"increase":[70],"active":[73],"area":[74],"proposed":[77,93],"adder":[78,94],"compared":[79],"with":[80,98],"other":[81,101],"adders.":[84,104],"In":[85],"terms":[86],"performance,":[88],"latency":[90,108],"is":[95,109],"slightly":[96],"higher":[97],"respect":[99],"However,":[105],"increased":[107,113],"compensated":[110],"throughput":[114],"obtained.":[115]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}