Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Zhezheng Ren

dblp:430/1910 · DBLP profile ↗
← Back
1ranked-venue papers
1as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Hardware accelerators and domain-specific architectures · 77% Reconfigurable computing and FPGAs · 23%
Theoretical computer science
1 paper
Automated reasoning and model checking · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Reconfigurable computing and FPGAs
FPGA implementation
0.312026
A PN-Free Digital 3-SAT Accelerator Using Crossbar Architecture and Frequency-Controlled Counters · HPCA 2026
Automated reasoning and model checking
satisfiability
0.312026
A PN-Free Digital 3-SAT Accelerator Using Crossbar Architecture and Frequency-Controlled Counters · HPCA 2026

Methods — techniques the papers use, named apart from their topics

stochastic computing · 2.0frequency-controlled counter · 2.0crossbar architecture · 2.0
YearPublicationVenuePosition
2026 A PN-Free Digital 3-SAT Accelerator Using Crossbar Architecture and Frequency-Controlled Counters
abstract
Boolean satisfiability (SAT) solving is a foundational problem in computer science and serves as a core engine for a wide range of combinatorial optimization tasks. It underpins critical applications across formal verification, electronic design automation (EDA), artificial intelligence (AI) reasoning, crypt-analysis, bioinformatics, and constraint programming. While significant progress has been made in algorithmic improvements, these advances are gradually reaching saturation, motivating increasing attention toward domain-specific hardware accelerators beyond the von Neumann architecture. However, existing hardware SAT accelerators often face significant deployment barriers due to reliance on pseudo-random number (PN) generators, specialized analog components with sufficient intrinsic noise, or unconventional fabrication technologies such as memristors. These limitations hinder scalability, portability, and integration into mainstream digital design flows. This paper presents an intrinsically stochastic, fully digital SAT accelerator inspired by analog mixed-signal crossbar architectures. The proposed design eliminates the need for analog noise sources, PN generators, or true-random number (TN) generators, enabling a fully synthesizable, standard-cell-based implementation compatible with conventional digital flows. Digital counters are employed as “spins”, acting as oscillatory elements that store and flip variable states, thus supporting robust and scalable stochastic behavior. Stochasticity is achieved through a novel polynomial clause-to-variable feedback mechanism, which dynamically modulates oscillator frequencies based on clause satisfaction states, allowing effective exploration of the solution space without external randomness. A highly parallel crossbar structure further accelerates problem-solving by enabling concurrent evaluation of multiple clauses, aided by a proposed polynomial clause-to-variable feedback function. To validate the proposed architecture, we implemented prototypes on FPGA and three ASIC platforms including 12 nm FinFET, 22 nm and 65 nm CMOS technologies. The designs were evaluated on a suite of hard SAT benchmark problems with 20 to 250 variables. Our 22nm ASIC accelerator achieves an approximately$3.06 \times$speedup than the state-of-the-art 28 nm 3-SAT accelerator. Compared with prior 65 nm designs, ours achieves 100% solvability with comparable runtime. Notably, we present the first 3-SAT accelerator capable of handling 250 variables with 100% solvability, marking a significant advancement in scalability for digital SAT accelerators.
Zhezheng Ren, Chenao Yuan, Shiyu Su
HPCA1