Presentation
RexBDDs: Reduction-on-Edge Complement-and-Swap Binary Decision Diagrams
DescriptionWe introduce RexBDDs, binary decision diagrams (BDDs) that exploits reduction opportunities beyond those of reduced ordered BDDs (eliminating "redundant'' nodes), zero-suppressed BDDs (eliminating "high-zero'' nodes), and recent proposals allowing multiple reduction rules.
RexBDDs also use (output) complement flags and (input) swap flags to potentially decrease the number of nodes by a factor of four.
We define a reduced form of RexBDDs that ensures canonicity, and show how their storage requirements compare very favorably against previous alternatives, using an extensive set of benchmarks.
RexBDDs also use (output) complement flags and (input) swap flags to potentially decrease the number of nodes by a factor of four.
We define a reduced form of RexBDDs that ensures canonicity, and show how their storage requirements compare very favorably against previous alternatives, using an extensive set of benchmarks.
Event Type
Work-in-Progress Poster
TimeWednesday, July 12th6:00pm - 7:00pm PDT
LocationLevel 2 Lobby
AI
Autonomous Systems
Cloud
Design
EDA
Embedded Systems
RISC-V
Security