Completion Optimization for Partially Defined Boolean Functions
Introduces Optimization Opportunities, Opportunity Spaces, Legal Completions, GT, experimental validation, and scalability.
Publications
GT Synthesis research papers
Read the foundational trilogy and the continuing GT Synthesis research program directly on the web, or download the current Microsoft Word manuscripts.
Extending Completion Optimization to RTL Designs Through Contextual PDBFs
Introduces contextual reachability, Contextual PDBF extraction, the Vedic multiplier case study, and PDBF Passport reuse.
GT AND Sequential Synthesis: Exploiting Native Sequential Device PDBFs
Establishes that sequential logic is inherently partially defined and introduces the Sequential Opportunity Space.
Design from Semantics: Direct Logic Synthesis under Care-Domain Compatibility
Investigates direct synthesis from semantic care domains and shows how semantic incompleteness can expose substantially different area-depth implementations across processor-control and protocol benchmarks.
What Determines the Implementation Size of Partially Defined Boolean Functions?
Introduces Minimum Care-Separating support (MCS), proves that MCS lower-bounds effective implementation support, and studies the relationship between PDBF care structure, effective PI, gates, and depth.