{"id":"https://openalex.org/W4392745963","doi":"https://doi.org/10.1109/isscc49657.2024.10454397","title":"30.3 VIP-Sat: A Boolean Satisfiability Solver Featuring 5\u00d712 Variable In-Memory Processing Elements with 98% Solvability for 50-Variables 218-Clauses 3-SAT Problems","display_name":"30.3 VIP-Sat: A Boolean Satisfiability Solver Featuring 5\u00d712 Variable In-Memory Processing Elements with 98% Solvability for 50-Variables 218-Clauses 3-SAT Problems","publication_year":2024,"publication_date":"2024-02-18","ids":{"openalex":"https://openalex.org/W4392745963","doi":"https://doi.org/10.1109/isscc49657.2024.10454397"},"language":"en","primary_location":{"id":"doi:10.1109/isscc49657.2024.10454397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isscc49657.2024.10454397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Solid-State Circuits Conference (ISSCC)","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/A5111145660","display_name":"Chaeyun Shim","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Chaeyun Shim","raw_affiliation_strings":["University of California,Santa Barbara,CA","University of California, Santa Barbara, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Santa Barbara,CA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California, Santa Barbara, CA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070419768","display_name":"Jooyoung Bae","orcid":"https://orcid.org/0009-0009-2677-792X"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jooyoung Bae","raw_affiliation_strings":["University of California,Santa Barbara,CA","University of California, Santa Barbara, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Santa Barbara,CA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California, Santa Barbara, CA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035469250","display_name":"Bongjin Kim","orcid":"https://orcid.org/0000-0001-5397-9628"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bongjin Kim","raw_affiliation_strings":["University of California,Santa Barbara,CA","University of California, Santa Barbara, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California,Santa Barbara,CA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":"University of California, Santa Barbara, CA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111145660"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":null,"apc_paid":null,"fwci":5.9782,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.96533211,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"486","last_page":"488"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9958000183105469,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.9958000183105469,"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/T10142","display_name":"Formal Methods in Verification","score":0.9821000099182129,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9760000109672546,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/boolean-satisfiability-problem","display_name":"Boolean satisfiability problem","score":0.8495643138885498},{"id":"https://openalex.org/keywords/satisfiability","display_name":"Satisfiability","score":0.6107314825057983},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.582572877407074},{"id":"https://openalex.org/keywords/maximum-satisfiability-problem","display_name":"Maximum satisfiability problem","score":0.5757217407226562},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5734050273895264},{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.5689699649810791},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.38993850350379944},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.37121209502220154},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3041408061981201},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2564815878868103},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.24267134070396423},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23496198654174805}],"concepts":[{"id":"https://openalex.org/C6943359","wikidata":"https://www.wikidata.org/wiki/Q875276","display_name":"Boolean satisfiability problem","level":2,"score":0.8495643138885498},{"id":"https://openalex.org/C168773769","wikidata":"https://www.wikidata.org/wiki/Q1350299","display_name":"Satisfiability","level":2,"score":0.6107314825057983},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.582572877407074},{"id":"https://openalex.org/C111797529","wikidata":"https://www.wikidata.org/wiki/Q17080584","display_name":"Maximum satisfiability problem","level":3,"score":0.5757217407226562},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5734050273895264},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.5689699649810791},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.38993850350379944},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.37121209502220154},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3041408061981201},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2564815878868103},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.24267134070396423},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23496198654174805},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isscc49657.2024.10454397","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isscc49657.2024.10454397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2024 IEEE International Solid-State Circuits Conference (ISSCC)","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":7,"referenced_works":["https://openalex.org/W291502169","https://openalex.org/W1487965496","https://openalex.org/W4280571900","https://openalex.org/W4360606441","https://openalex.org/W4360606816","https://openalex.org/W4376134029","https://openalex.org/W6629443124"],"related_works":["https://openalex.org/W2408080066","https://openalex.org/W2394616262","https://openalex.org/W192406999","https://openalex.org/W2406837904","https://openalex.org/W3152212242","https://openalex.org/W2014111643","https://openalex.org/W2102364390","https://openalex.org/W4289743389","https://openalex.org/W1913543287","https://openalex.org/W2336941104"],"abstract_inverted_index":{"Boolean":[0,55,70],"satisfiability":[1],"(SAT),":[2],"a":[3,54,67,112,167,172,182,187,217,231,253,260,267],"non-deterministic":[4],"polynomial":[5],"(NP)-complete":[6],"problem,":[7],"has":[8,176],"gained":[9],"increasing":[10,103],"attention":[11],"with":[12,25,101,166,191,198,259,283],"applications":[13],"in":[14,57,96,201,241,301],"artificial":[15],"intelligence,":[16],"machine":[17],"learning,":[18],"electronic":[19],"design":[20],"automation,":[21],"and":[22,32,41,111,115,149,211,245,286,298],"VLSI":[23],"tests":[24],"practical":[26],"examples,":[27],"such":[28,85,137],"as":[29,86,138],"AI":[30],"planning":[31],"ML":[33],"model":[34],"verification,":[35],"fault":[36],"diagnosis,":[37],"combinational":[38],"equivalence":[39],"checking":[40],"automatic":[42],"test":[43],"pattern":[44],"generation.":[45],"The":[46],"SAT":[47,99,127,132,189,257,280],"problem":[48,185,190],"is":[49],"based":[50,229],"on":[51,230],"testing":[52],"if":[53],"formula":[56,75,79],"conjunctive":[58],"normal":[59],"form":[60],"(CNF)":[61],"can":[62],"be":[63],"solved":[64],"by":[65],"finding":[66],"set":[68],"of":[69,105,170,270],"variables":[71,106,200,297],"that":[72],"satisfy":[73],"the":[74,78,224],"(i.e.,":[76,186],"makes":[77],"TRUE).":[80],"Conventionally,":[81],"software-based":[82],"SAT-solving":[83,233],"algorithms,":[84],"WalkSAT,":[87],"have":[88,94,129,159],"been":[89],"widely":[90],"used.":[91],"However,":[92,223],"they":[93],"limitations":[95],"solving":[97,131,181,281],"large-scale":[98],"problems":[100,133,165],"an":[102],"number":[104,169],"due":[107],"to":[108,216],"limited":[109],"parallelism":[110],"significant":[113],"latency":[114],"energy":[116,246,288],"overhead":[117],"arising":[118],"from":[119],"frequent":[120],"memory":[121],"access.":[122],"Alternatively,":[123],"dedicated":[124],"ASIC":[125],"hardware":[126,209],"solvers":[128,210],"demonstrated":[130,160],"using":[134],"various":[135],"methods,":[136],"in-memory":[139,262],"computing":[140],"[1],":[141],"continuous-time":[142],"dynamics":[143],"[3],":[144],"recurrent":[145],"neural":[146],"networks":[147],"[4],":[148],"digital":[150,261],"processing":[151,263,274],"elements":[152],"[6].":[153],"While":[154],"most":[155,193],"prior":[156,208,225],"works":[157],"[3\u20136]":[158],"low":[161],"solvability":[162,179,285,294],"for":[163,180,277,295],"hard":[164,183],"large":[168],"variables,":[171],"recent":[173],"work":[174,226],"[1]":[175,227],"achieved":[177,212],"72%":[178],"3-SAT":[184],"reduced":[188],"at":[192,221],"3":[194],"literals":[195],"per":[196],"clause)":[197],"60":[199],"0.713ms":[202],"while":[203],"consuming":[204,303],"1.098\u03bcJ,":[205],"which":[206,236],"outperforms":[207],"~10\u00d7":[213],"speed-up":[214],"compared":[215],"CPU":[218],"(Xeon":[219],"W-2195":[220],"4.2GHz).":[222],"operates":[228],"popular":[232],"algorithm":[234],"(WalkSAT),":[235],"may":[237],"limit":[238],"further":[239],"advancement":[240],"solvability,":[242],"solution":[243],"time":[244],"consumption.":[247,289],"In":[248],"this":[249],"work,":[250],"we":[251],"propose":[252],"novel":[254],"algorithm-hardware":[255],"co-designed":[256],"solver":[258],"element":[264,275],"architecture":[265],"incorporating":[266],"key":[268],"feature":[269],"parallel":[271],"uncorrelated":[272],"variable":[273],"(VPE)":[276],"column-by-column":[278],"fast":[279],"operations":[282],"high":[284],"minimum":[287],"Measured":[290],"results":[291],"show":[292],"98%":[293],"50":[296],"218":[299],"clauses":[300],"18.7\u03bcs":[302],"20.8nJ.":[304]},"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":8},{"year":2024,"cited_by_count":2}],"updated_date":"2026-06-06T09:05:17.133730","created_date":"2025-10-10T00:00:00"}