Tensor-Train Co-Design & Signoff
Import, compress, search, and sign off — in one six-stage flow with a verifiable certificate at the end.
TensorEDA replaces the corner sweeps, canonical Boolean tables, and independent-variance assumptions at the core of legacy EDA with a unified mathematical foundation — tensor-train decomposition, rigorous uncertainty quantification, compiled Boolean execution, adaptive parasitic extraction, power integrity and reliability analysis, and exact formal proof engines — applied across co-design, timing signoff, functional simulation, parasitic extraction, and equivalence checking.
Every TensorEDA module is a different application of the same underlying research program — not eight disconnected point tools. Explore the live platform demo →
Import, compress, search, and sign off — in one six-stage flow with a verifiable certificate at the end.
Technology and circuit design explored together, not in separate loops that fight each other.
Genuine ngspice-driven UQ, cross-validated against brute-force Monte Carlo on every run.
Process, Voltage, Temperature, and Activity modeled as one correlated tensor — not disconnected corners.
Exact full-chip equivalence proofs that dynamically hand hard regions to SAT, datapath, or sequential engines.
Compiles the circuit, not just the simulator — routing each region to packed BitSlice, LUT, GF(2), or gate-fallback execution based on workload and hardware.
Compiles the layout, not just the field solver — routing each region to a closed-form analytic model or a real boundary-element solve based on structure.
Compiles the power grid, not just the field solver — combining coupling-aware spectral graph cuts, exact Schur-complement macromodels, static IR drop, vectorless worst-case analysis, and electromigration checks.
Four techniques. Applied consistently across every module — not reinvented per product.
Compresses high-dimensional variation and logic spaces exponentially. More succinct than canonical BDDs for the routing-style functions common in modern datapaths and NPU logic.
Polynomial chaos and adaptive sampling replace brute-force Monte Carlo — an order of magnitude fewer simulation runs for the same accuracy.
GF(2) relation tensors and worst-case-optimal joins. Live rank monitoring triggers dynamic handoff — never floating-point approximation in the final proof.
Sparse-PCE-guided co-optimization and treewidth-aware partitioning turn combinatorial spaces into tractable Pareto search.
Semiconductor innovation — AI accelerators, chiplets, wide-bandgap power devices — is advancing faster than the corner-based, canonical-table architecture underneath most signoff tools was ever designed for. TensorEDA is building the next generation of design automation on a different foundation: structural tensor compression, rigorous uncertainty quantification, and exact algorithmic proof, so engineering teams can see the correlated, high-dimensional reality of modern designs instead of a handful of disconnected sample points.
Variation and design space are modeled jointly wherever the math is correlated — never decomposed for implementation convenience, then patched back together with margin.
Every claim ships with a reproducible benchmark: real ngspice runs, real netlists, real bug-injection tests — limitations included.
Standard Liberty, SDC, SPEF, and structural Verilog in. An additional signoff layer out — not a flow your team re-architects around.
Whether you're looking for early access, exploring partnership opportunities, or want to evaluate TensorEDA solutions, we'd love to hear from you.