GT Theory

A shared language for functional optimization

The trilogy introduces a consistent set of concepts for discovering, representing, searching, and reusing functional freedom.

01

Partially Defined Boolean Function

A Boolean specification whose outputs are required only on a subset of input terms.

02

Optimization Opportunity

Each unspecified value is a legal decision that can alter implementation quality.

03

Opportunity Space

The set of all assignments to the Optimization Opportunities.

04

Legal Completion

A Fully Defined Boolean Function that preserves every specified term.

05

Completion Optimization

Searching Legal Completions according to implementation objectives before conventional synthesis.

06

Contextual PDBF

A PDBF exposed by local reachability constraints in a complete RTL design.

07

Sequential Device PDBF

The pair SP=(R,U), where R is reachable behavior and U is unreachable behavior.

08

Sequential Opportunity Space

All legal assignments over U that preserve R exactly.

09

PDBF Passport Library

A reusable library of optimized implementations and measured structural properties.

Discover functional freedom
Represent it as a PDBF
Search Legal Completions
Synthesize the selected function