GT Synthesis

The GT Synthesis Trilogy

One continuous scientific narrative

The trilogy progresses from optimizing a given PDBF, to revealing hidden PDBFs in RTL, to recognizing partial definition as a native property of sequential logic.

I
The optimization engine

Completion Optimization for Partially Defined Boolean Functions

Question: Can the Boolean function itself be optimized before the circuit?

A PDBF represents a family of Fully Defined Boolean Functions. Completion Optimization searches the Opportunity Space and selects Legal Completions according to gate count, depth, fan-out, area, power, wiring, or another objective.

First optimize the Boolean function. Then optimize the circuit.
Read onlineDownload
The next question: where do PDBFs come from in ordinary designs?
II
The RTL extension

Contextual Partially Defined Boolean Functions

Question: Can a block that looks fully specified become partially defined inside a complete RTL design?

Yes. Surrounding circuitry prevents many local input terms from occurring. Contextual PDBF extraction preserves reachable local behavior and exposes all other local terms as hidden contextual don’t-cares.

First discover the Contextual PDBF. Then optimize the PDBF. Then optimize the circuit.
Read onlineDownload
The deepest question: is partial definition exceptional—or intrinsic?
III
The sequential foundation

GT AND Sequential Synthesis

Question: Why do sequential systems inherently contain PDBFs?

Only reachable state/input combinations determine observable behavior. The unreachable region is intrinsically unspecified and forms a Native Sequential Device PDBF.

ONLY reachable behavior defines correctness.
Unreachable behavior defines optimization freedom.
Read onlineDownload