{"id":"https://openalex.org/W2615589464","doi":"https://doi.org/10.1145/3060403.3060410","title":"Computing Polynomials with Positive Coefficients using Stochastic Logic by Double-NAND Expansion","display_name":"Computing Polynomials with Positive Coefficients using Stochastic Logic by Double-NAND Expansion","publication_year":2017,"publication_date":"2017-05-10","ids":{"openalex":"https://openalex.org/W2615589464","doi":"https://doi.org/10.1145/3060403.3060410","mag":"2615589464"},"language":"en","primary_location":{"id":"doi:10.1145/3060403.3060410","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3060403.3060410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Great Lakes Symposium on VLSI 2017","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/A5022120826","display_name":"Sayed Ahmad Salehi","orcid":null},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sayed Ahmad Salehi","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100411655","display_name":"Yin Liu","orcid":"https://orcid.org/0000-0002-0408-5967"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yin Liu","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103212398","display_name":"Marc D. Riedel","orcid":"https://orcid.org/0000-0002-3318-346X"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Marc D. Riedel","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5007884053","display_name":"Keshab K. Parhi","orcid":"https://orcid.org/0000-0001-6543-2793"},"institutions":[{"id":"https://openalex.org/I130238516","display_name":"University of Minnesota","ror":"https://ror.org/017zqws13","country_code":"US","type":"education","lineage":["https://openalex.org/I130238516"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Keshab K. Parhi","raw_affiliation_strings":["University of Minnesota, Minneapolis, MN, USA"],"affiliations":[{"raw_affiliation_string":"University of Minnesota, Minneapolis, MN, USA","institution_ids":["https://openalex.org/I130238516"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5022120826"],"corresponding_institution_ids":["https://openalex.org/I130238516"],"apc_list":null,"apc_paid":null,"fwci":2.2792,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.89679726,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"471","last_page":"474"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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/T11321","display_name":"Error Correcting Code Techniques","score":0.9998000264167786,"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/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9959999918937683,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9904999732971191,"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/nand-gate","display_name":"NAND gate","score":0.684380829334259},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.5861844420433044},{"id":"https://openalex.org/keywords/unary-operation","display_name":"Unary operation","score":0.5837292671203613},{"id":"https://openalex.org/keywords/multiplexer","display_name":"Multiplexer","score":0.5607673525810242},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.544799268245697},{"id":"https://openalex.org/keywords/factorization","display_name":"Factorization","score":0.5428085923194885},{"id":"https://openalex.org/keywords/nand-logic","display_name":"NAND logic","score":0.540864884853363},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4753536880016327},{"id":"https://openalex.org/keywords/logic-gate","display_name":"Logic gate","score":0.4514469504356384},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3605290651321411},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3191758990287781},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.08143121004104614},{"id":"https://openalex.org/keywords/multiplexing","display_name":"Multiplexing","score":0.07393857836723328}],"concepts":[{"id":"https://openalex.org/C124296912","wikidata":"https://www.wikidata.org/wiki/Q575178","display_name":"NAND gate","level":3,"score":0.684380829334259},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.5861844420433044},{"id":"https://openalex.org/C78023250","wikidata":"https://www.wikidata.org/wiki/Q657596","display_name":"Unary operation","level":2,"score":0.5837292671203613},{"id":"https://openalex.org/C70970002","wikidata":"https://www.wikidata.org/wiki/Q189434","display_name":"Multiplexer","level":3,"score":0.5607673525810242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.544799268245697},{"id":"https://openalex.org/C187834632","wikidata":"https://www.wikidata.org/wiki/Q188804","display_name":"Factorization","level":2,"score":0.5428085923194885},{"id":"https://openalex.org/C7234692","wikidata":"https://www.wikidata.org/wiki/Q4116068","display_name":"NAND logic","level":4,"score":0.540864884853363},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4753536880016327},{"id":"https://openalex.org/C131017901","wikidata":"https://www.wikidata.org/wiki/Q170451","display_name":"Logic gate","level":2,"score":0.4514469504356384},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3605290651321411},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3191758990287781},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.08143121004104614},{"id":"https://openalex.org/C19275194","wikidata":"https://www.wikidata.org/wiki/Q222903","display_name":"Multiplexing","level":2,"score":0.07393857836723328},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3060403.3060410","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3060403.3060410","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Great Lakes Symposium on VLSI 2017","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2514287937","display_name":null,"funder_award_id":"CCF-1423407","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G5342904062","display_name":null,"funder_award_id":"CCF-1319107","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":6,"referenced_works":["https://openalex.org/W2012712773","https://openalex.org/W2101765144","https://openalex.org/W2118914590","https://openalex.org/W2296101864","https://openalex.org/W2369113192","https://openalex.org/W2539422612"],"related_works":["https://openalex.org/W3208167090","https://openalex.org/W2607556907","https://openalex.org/W2152527810","https://openalex.org/W4226330631","https://openalex.org/W2074010091","https://openalex.org/W188762367","https://openalex.org/W1980808122","https://openalex.org/W1017999001","https://openalex.org/W2782113474","https://openalex.org/W2162444164"],"abstract_inverted_index":{"This":[0],"paper":[1,138],"proposes":[2],"a":[3],"novel":[4],"method,":[5,130],"referred":[6],"to":[7,11,70,83,107,115],"as":[8,146],"\\textit{double-NAND":[9],"expansion},":[10],"implement":[12],"polynomials":[13,47,73,86,147],"with":[14,48,74,123],"all":[15,75],"positive":[16,50,76],"coefficients":[17,53],"using":[18,37,57,87,148],"unipolar":[19],"stochastic":[20,58],"logic.":[21],"%The":[22],"inputs":[23],"and":[24,32,34,51,54,135,175],"outputs":[25],"of":[26,46,72,85,99,142,171],"these":[27],"circuits":[28],"lie":[29],"between":[30],"0":[31],"1,":[33],"are":[35,121],"encoded":[36],"unary":[38],"bit":[39],"streams.":[40],"Prior":[41],"work":[42],"has":[43],"addressed":[44],"implementation":[45,71],"alternately":[49],"negative":[52],"non-increasing":[55],"magnitudes,":[56],"logic":[59],"based":[60,125,152],"on":[61,126,153],"Horner's":[62,65,104],"rule.":[63],"However,":[64],"expansion":[66,81,113],"is":[67],"not":[68],"applicable":[69],"coefficients.":[77],"The":[78,137,157],"proposed":[79,112,119,155,163],"double-NAND":[80,117],"leads":[82,106,114],"implementations":[84,120,141],"no":[88],"more":[89],"than":[90],"2n":[91],"NAND":[92],"gates":[93],"where":[94],"n":[95],"represents":[96],"the":[97,100,103,111,154,162,166],"degree":[98],"polynomial.":[101],"%While":[102],"rule":[105],"cascaded":[108,116],"AND-NAND":[109],"gates,":[110],"gates.The":[118],"compared":[122],"those":[124],"multiplexers,":[127],"Bernstein":[128],"polynomial":[129],"finite":[131],"state":[132],"machine":[133],"method":[134,164],"factorization.":[136],"also":[139],"considers":[140],"several":[143],"functions":[144],"expressed":[145],"truncated":[149],"Mclaurin":[150],"series":[151],"approach.":[156],"experimental":[158],"results":[159],"show":[160],"that":[161],"outperforms":[165],"prior":[167],"methods":[168],"in":[169],"terms":[170],"accuracy,":[172],"hardware":[173],"complexity,":[174],"critical":[176],"path.":[177]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}