{"id":"https://openalex.org/W2612936968","doi":"https://doi.org/10.23919/date.2017.7927093","title":"Automated synthesis of compact crossbars for sneak-path based in-memory computing","display_name":"Automated synthesis of compact crossbars for sneak-path based in-memory computing","publication_year":2017,"publication_date":"2017-03-01","ids":{"openalex":"https://openalex.org/W2612936968","doi":"https://doi.org/10.23919/date.2017.7927093","mag":"2612936968"},"language":"en","primary_location":{"id":"doi:10.23919/date.2017.7927093","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2017.7927093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE), 2017","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://stars.library.ucf.edu/scopus2015/7507","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020014870","display_name":"Dwaipayan Chakraborty","orcid":"https://orcid.org/0000-0002-0791-7407"},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dwaipayan Chakraborty","raw_affiliation_strings":["Computer Science Department, University of Central Florida, Orlando, Florida"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Central Florida, Orlando, Florida","institution_ids":["https://openalex.org/I106165777"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075978538","display_name":"Sumit Kumar Jha","orcid":"https://orcid.org/0000-0003-0354-2940"},"institutions":[{"id":"https://openalex.org/I106165777","display_name":"University of Central Florida","ror":"https://ror.org/036nfer12","country_code":"US","type":"education","lineage":["https://openalex.org/I106165777"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sumit Kumar Jha","raw_affiliation_strings":["Computer Science Department, University of Central Florida, Orlando, Florida"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, University of Central Florida, Orlando, Florida","institution_ids":["https://openalex.org/I106165777"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.6314,"has_fulltext":false,"cited_by_count":36,"citation_normalized_percentile":{"value":0.90436289,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"770","last_page":"775"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":1.0,"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"}},"topics":[{"id":"https://openalex.org/T10502","display_name":"Advanced Memory and Neural Computing","score":1.0,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","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/T11601","display_name":"Neuroscience and Neural Engineering","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/2804","display_name":"Cellular and Molecular Neuroscience"},"field":{"id":"https://openalex.org/fields/28","display_name":"Neuroscience"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/crossbar-switch","display_name":"Crossbar switch","score":0.7345892786979675},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.7099895477294922},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6900420188903809},{"id":"https://openalex.org/keywords/boolean-circuit","display_name":"Boolean circuit","score":0.6611825227737427},{"id":"https://openalex.org/keywords/memristor","display_name":"Memristor","score":0.6328761577606201},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.5978846549987793},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.5590241551399231},{"id":"https://openalex.org/keywords/von-neumann-architecture","display_name":"Von Neumann architecture","score":0.5527191162109375},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5295408964157104},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.5104809999465942},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.48687759041786194},{"id":"https://openalex.org/keywords/product-term","display_name":"Product term","score":0.47743162512779236},{"id":"https://openalex.org/keywords/circuit-minimization-for-boolean-functions","display_name":"Circuit minimization for Boolean functions","score":0.47268444299697876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4501957893371582},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4468463957309723},{"id":"https://openalex.org/keywords/and-inverter-graph","display_name":"And-inverter graph","score":0.4346972703933716},{"id":"https://openalex.org/keywords/boolean-algebra","display_name":"Boolean algebra","score":0.4309748411178589},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33093011379241943},{"id":"https://openalex.org/keywords/two-element-boolean-algebra","display_name":"Two-element Boolean algebra","score":0.21352332830429077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1974690854549408},{"id":"https://openalex.org/keywords/algebra-over-a-field","display_name":"Algebra over a field","score":0.17631065845489502},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.08343961834907532}],"concepts":[{"id":"https://openalex.org/C29984679","wikidata":"https://www.wikidata.org/wiki/Q1929149","display_name":"Crossbar switch","level":2,"score":0.7345892786979675},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.7099895477294922},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6900420188903809},{"id":"https://openalex.org/C141796577","wikidata":"https://www.wikidata.org/wiki/Q837479","display_name":"Boolean circuit","level":3,"score":0.6611825227737427},{"id":"https://openalex.org/C150072547","wikidata":"https://www.wikidata.org/wiki/Q212923","display_name":"Memristor","level":2,"score":0.6328761577606201},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.5978846549987793},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.5590241551399231},{"id":"https://openalex.org/C80469333","wikidata":"https://www.wikidata.org/wiki/Q189088","display_name":"Von Neumann architecture","level":2,"score":0.5527191162109375},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5295408964157104},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.5104809999465942},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.48687759041786194},{"id":"https://openalex.org/C9429942","wikidata":"https://www.wikidata.org/wiki/Q1781698","display_name":"Product term","level":5,"score":0.47743162512779236},{"id":"https://openalex.org/C94992772","wikidata":"https://www.wikidata.org/wiki/Q6667469","display_name":"Circuit minimization for Boolean functions","level":4,"score":0.47268444299697876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4501957893371582},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4468463957309723},{"id":"https://openalex.org/C196836630","wikidata":"https://www.wikidata.org/wiki/Q4753279","display_name":"And-inverter graph","level":4,"score":0.4346972703933716},{"id":"https://openalex.org/C39685927","wikidata":"https://www.wikidata.org/wiki/Q173183","display_name":"Boolean algebra","level":2,"score":0.4309748411178589},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33093011379241943},{"id":"https://openalex.org/C207764348","wikidata":"https://www.wikidata.org/wiki/Q7858706","display_name":"Two-element Boolean algebra","level":4,"score":0.21352332830429077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1974690854549408},{"id":"https://openalex.org/C136119220","wikidata":"https://www.wikidata.org/wiki/Q1000660","display_name":"Algebra over a field","level":2,"score":0.17631065845489502},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.08343961834907532},{"id":"https://openalex.org/C169171071","wikidata":"https://www.wikidata.org/wiki/Q5449241","display_name":"Filtered algebra","level":3,"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C119599485","wikidata":"https://www.wikidata.org/wiki/Q43035","display_name":"Electrical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.23919/date.2017.7927093","is_oa":false,"landing_page_url":"https://doi.org/10.23919/date.2017.7927093","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Design, Automation &amp; Test in Europe Conference &amp; Exhibition (DATE), 2017","raw_type":"proceedings-article"},{"id":"pmh:oai:stars.library.ucf.edu:scopus2015-8506","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2015/7507","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 2015-2019","raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:stars.library.ucf.edu:scopus2015-8506","is_oa":true,"landing_page_url":"https://stars.library.ucf.edu/scopus2015/7507","pdf_url":null,"source":{"id":"https://openalex.org/S4210172555","display_name":"Journal of International Crisis and Risk Communication Research","issn_l":"2576-0017","issn":["2576-0017","2576-0025"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Scopus Export 2015-2019","raw_type":"text"},"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320332467","display_name":"U.S. Air Force","ror":"https://ror.org/006gmme17"},{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1461494254","https://openalex.org/W1554230273","https://openalex.org/W2080267935","https://openalex.org/W2099251677","https://openalex.org/W2126856948","https://openalex.org/W2161330443","https://openalex.org/W2174472167","https://openalex.org/W2184708688","https://openalex.org/W2286699138","https://openalex.org/W2288952784","https://openalex.org/W2342821294","https://openalex.org/W2397312330","https://openalex.org/W2483802021","https://openalex.org/W2503190914","https://openalex.org/W2509843886","https://openalex.org/W2546945562","https://openalex.org/W2914596496"],"related_works":["https://openalex.org/W2234833091","https://openalex.org/W4237556422","https://openalex.org/W3049502754","https://openalex.org/W2112641792","https://openalex.org/W2131164334","https://openalex.org/W4249833304","https://openalex.org/W1953235205","https://openalex.org/W4390345104","https://openalex.org/W1501377585","https://openalex.org/W1979258071"],"abstract_inverted_index":{"The":[0],"rise":[1],"of":[2,69,99,116],"data-intensive":[3],"computational":[4],"loads":[5],"has":[6,16,40],"exposed":[7],"the":[8,18,67,97,114,117,124,165],"processor-memory":[9],"bottleneck":[10],"in":[11,36,113],"Von":[12],"Neumann":[13],"architectures":[14],"and":[15,101],"reinforced":[17],"need":[19],"for":[20,59,164],"in-memory":[21],"computing":[22,31,60],"using":[23,34,80,148,167],"devices":[24],"such":[25,160],"as":[26,161],"memristors.":[27],"Existing":[28],"literature":[29],"on":[30,43,89],"Boolean":[32,45,62,78,107,125,131,146],"formula":[33,79,108,147],"sneak-paths":[35],"nanoscale":[37,139],"memristor":[38,71],"crossbars":[39,58,140],"only":[41],"focussed":[42],"short":[44],"formula.":[46],"There":[47],"are":[48],"two":[49],"open":[50],"questions:":[51],"(i)":[52],"Can":[53],"one":[54],"synthesize":[55,138,156],"sneak-path":[56,168],"based":[57,169],"large":[61,157],"formula?":[63],"(ii)":[64],"What":[65],"is":[66,109],"size":[68,115],"a":[70,76,106,144],"crossbar":[72,170],"that":[73,96,141],"can":[74,134,142],"compute":[75,105,143],"given":[77,145],"sneak":[81,151],"paths?":[82],"In":[83,153],"this":[84],"paper,":[85],"we":[86,94,128,155],"make":[87],"progress":[88],"both":[90],"these":[91],"problems.":[92],"First,":[93],"show":[95],"number":[98],"rows":[100],"columns":[102],"required":[103],"to":[104,137],"at":[110],"most":[111],"linear":[112],"Reduced":[118],"Ordered":[119],"Binary":[120],"Decision":[121,132],"Diagram":[122],"representing":[123],"function.":[126],"Second,":[127],"demonstrate":[129],"how":[130],"Diagrams":[133],"be":[135],"used":[136],"naturally":[149],"occurring":[150],"paths.":[152],"particular,":[154],"logical":[158],"circuits":[159],"128-bit":[162],"adders":[163],"first-time":[166],"computing.":[171]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":4}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}
