Open PDBF Benchmark Suite
GT PDBF Logic Synthesis Benchmark Suite
Open benchmark specifications for logic synthesis of Partially Defined Boolean Functions (PDBFs), with published GT gate count, logic depth and synthesis runtime.
Purpose of the benchmark suite
This page provides reproducible PDBF synthesis problems in standard PLA format. The benchmark suite collects experimental families used across the GT paper series: Contextual RTL and open-source RTL candidate studies associated with Paper II, real-RTL legal-completion validation associated with Paper III, memory-oriented PDBF experiments associated with Paper IV, and large-input scalability experiments associated with Paper VI. Additional semantic and AI-inspired PDBF benchmarks are provided as supporting open synthesis challenges.
GT synthesis results are reported as simple two-input logic-gate count, maximum logic depth, and synthesis time. The present benchmark release provides the original PLA specifications and synthesis statistics. GT synthesized netlists are not included in this release.
AI-Inspired Contextual PDBF Benchmarks
These benchmarks are synthetic, reproducible AI-like decision and classification functions expressed directly as contextual PDBFs. They are intended to study combinational synthesis over strongly constrained quantized feature domains; they are not results extracted from trained neural-network models and should not be interpreted as AI-accuracy benchmarks.
This table reports 21 benchmarks from the updated result listing. G / L denotes gate count / maximum logic levels. PI/PO/Cubes gives the input count, output count and number of specified care terms.
| Benchmark | PI/PO/Cubes | ABC decpla G / L | ABC deepsyn G / L | ABC transtoch G / L | GT G / L | GT → ABC deepsyn G / L | GT → ABC transtoch G / L | PLA |
|---|---|---|---|---|---|---|---|---|
AI_autonomous_braking | 21 / 4 / 2,187 | 23 / 6 | 20 / 5 | — | 20 / 5 | — | — | PLA |
AI_battery_management | 22 / 5 / 2,304 | 26 / 5 | 23 / 5 | — | 20 / 7 23 / 6 | 18 / 7 20 / 5 | — | PLA |
AI_crop_health | 24 / 6 / 5,184 | 23 / 5 | — | 16 / 6 | 18 / 5 | — | 16 / 6 | PLA |
AI_data_center_cooling | 21 / 6 / 1,728 | 26 / 6 | — | 20 / 5 | 21 / 7 | — | 20 / 5 | PLA |
AI_drone_obstacle | 24 / 6 / 6,561 | 34 / 5 | 30 / 5 | 27 / 7 26 / 10 | 28 / 9 28 / 10 31 / 7 | 27 / 6 28 / 5 | 24 / 7 | PLA |
AI_ecg_arrhythmia | 18 / 4 / 729 | 8 / 4 | — | 8 / 4 | 8 / 4 | — | — | PLA |
AI_financial_fraud | 21 / 5 / 2,187 | 31 / 6 | — | 21 / 5 | 21 / 5 | — | — | PLA |
AI_food_quality | 22 / 6 / 2,304 | 21 / 5 | 20 / 5 | — | 20 / 5 | — | — | PLA |
AI_hand_gesture | 24 / 4 / 6,561 | 12 / 5 | — | 12 / 5 | 12 / 5 14 / 4 | — | — | PLA |
AI_jet_engine_health | 23 / 6 / 3,072 | 67 / 10 | 47 / 7 | 44 / 11 | 31 / 14 | — | 30 / 8 | PLA |
AI_keyword_spotting | 20 / 4 / 1,024 | 9 / 5 | — | — | 9 / 5 | — | — | PLA |
AI_malware_behavior | 24 / 6 / 5,184 | 53 / 9 | 30 / 6 | 32 / 7 | 25 / 13 27 / 6 | 25 / 6 | — | PLA |
AI_maritime_navigation | 24 / 7 / 4,096 | 52 / 9 | 36 / 12 | 45 / 7 41 / 9 | 32 / 9 34 / 8 39 / 7 | 31 / 7 32 / 6 | 30 / 10 | PLA |
AI_medical_triage | 24 / 6 / 6,561 | 32 / 5 | 24 / 5 | 23 / 6 | 25 / 8 | 24 / 5 | 23 / 6 | PLA |
AI_predictive_maintenance | 24 / 6 / 6,561 | 59 / 9 | 42 / 6 31 / 13 | 34 / 8 | 31 / 10 32 / 9 35 / 8 | — | 26 / 7 28 / 6 | PLA |
AI_railway_signal_anomaly | 24 / 6 / 5,184 | 46 / 8 | 30 / 7 | 34 / 6 | 31 / 8 31 / 10 34 / 8 52 / 7 | 49 / 7 | 28 / 9 28 / 8 27 / 11 | PLA |
AI_road_scene | 23 / 6 / 3,072 | 35 / 7 | — | 31 / 7 30 / 10 28 / 8 35 / 5 | 28 / 9 34 / 6 | 27 / 7 31 / 6 | — | PLA |
AI_sepsis_risk | 22 / 6 / 2,304 | 44 / 6 | — | 28 / 8 | 27 / 8 30 / 7 | — | 26 / 6 | PLA |
AI_sonar_target | 22 / 6 / 2,304 | 36 / 6 | — | 23 / 5 22 / 6 | 19 / 12 20 / 10 21 / 7 26 / 5 | — | 25 / 6 | PLA |
AI_wafer_defect | 24 / 5 / 4,096 | 26 / 6 | 19 / 5 | 18 / 6 | 18 / 6 26 / 5 | 25 / 5 | — | PLA |
AI_wildfire_risk | 22 / 6 / 2,304 | 32 / 7 | 34 / 5 | 29 / 6 | 27 / 12 28 / 10 31 / 9 32 / 7 34 / 8 | — | 26 / 7 26 / 5 | PLA |
ABC decpla starts from the PDBF PLA; ABC deepsyn and transtoch report optimized decpla implementations. GT reports the original GT implementations; GT → ABC reports ABC optimization of GT netlists. Multiple entries retain all supplied implementations and their gate/depth tradeoffs; entries in different columns need not correspond by line. Hover over a GT → ABC result to see its source GT gate/level pair and filename. Dashes mean no result was supplied. Times were not supplied. Values are transcribed from filenames, not independently remeasured. Display names omit _contextual.
Medium-input semantic PDBF benchmarks
In this benchmark suite, examples with hundreds primary inputs are classified as medium-input PDBFs. The cases below model networking, security, storage, telecommunications and policy/control hardware.
| Benchmark | PI/PO/Cubes | ABC decpla G / L | ABC deepsyn G / L | ABC Time, s | GT G / L | GT Time, s | PLA |
|---|---|---|---|---|---|---|---|
ipv6_5g_upf_gtpu_policy | 299 / 18 / 16,384 | 2,623 / 22 | 1,677 / 17 | 2,862 | 151 / 23 236 / 21 | 210 337 | PLA |
ipv6_bgp_evpn_route_policy | 398 / 18 / 16,384 | 16 / 3 | 16 / 3 | 272 | 14 / 3 | 1 | PLA |
ipv6_dns_doh_security_policy | 317 / 18 / 16,384 | 1,887 / 18 | 930 / 16 | 1,509 | 118 / 23 | 238 | PLA |
ipv6_firewall_policy_classifier | 96 / 14 / 8,192 | 23,139 / 28 | 19,010 / 19 | 6,876 | 2,383 / 209 2,542 / 102 | 8,286 12,056 | PLA |
ipv6_geneve_nsh_service_chain_policy | 257 / 17 / 16,384 | 2,052 / 18 | 728 / 16 | 1,959 | 641 / 50 | 17,070 | PLA |
ipv6_ids_ips_signature_policy | 300 / 18 / 16,384 | 3,734 / 22 | 2,223 / 17 | 5,102 | 231 / 25 | 601 | PLA |
ipv6_ipsec_sa_security_policy | 216 / 18 / 16,384 | 5,749 / 22 | 3,304 / 17 | 7,061 | 627 / 62 1,009 / 39 | 9,085 16,082 | PLA |
ipv6_mpls_srv6_interworking_policy | 294 / 18 / 16,384 | 10,365 / 27 | 7,751 / 21 | 7,103 | 393 / 26 | 1,240 | PLA |
ipv6_nvmeof_storage_policy | 286 / 18 / 16,384 | 1,404 / 17 | 767 / 13 | 1,312 | 234 / 22 | 596 | PLA |
ipv6_ptp_tsn_policy | 219 / 18 / 16,384 | 1,437 / 18 | 771 / 15 | 1,348 | 216 / 36 | 415 | PLA |
ipv6_quic_ddos_mitigation_policy | 313 / 18 / 16,384 | 2,378 / 24 | 1,355 / 27 | 4,702 | 224 / 18 224 / 26 | 243 123 | PLA |
ipv6_security_telemetry_policy_medium | 246 / 16 / 8,192 | 198 / 10 | 132 / 8 | 112 | 105 / 21 106 / 18 118 / 16 | 19 13 21 | PLA |
ipv6_service_chain_security_policy_narrow | 221 / 16 / 8,192 | 2,364 / 22 | 1,286 / 17 | 2,749 | 445 / 46 459 / 26 | 1,421 326 | PLA |
ipv6_service_mesh_load_balancer_policy | 263 / 18 / 16,384 | 9,677 / 25 | 6,439 / 18 | 9,686 | 1,133 / 66 | 15,048 | PLA |
ipv6_storage_replication_erasure_policy | 253 / 17 / 16,384 | 2,148 / 19 | 780 / 16 | 2,258 | 326 / 31 | 3,076 | PLA |
ipv6_vxlan_microsegmentation_ct_policy | 212 / 18 / 12,288 | 1,677 / 20 | 963 / 15 | 1,647 | 328 / 25 | 178 | PLA |
Results are reported as AIG two-input AND gates / maximum AIG levels. Multiple GT entries are alternative implementations, with times in matching order. ABC adjusted time is the supplied total decpla + deepsyn runtime divided by 8 and rounded to the nearest whole second (half seconds round up); it is not the unadjusted measured runtime. GT times are unchanged. Separate decpla runtimes were not supplied. Results are transcribed from the supplied filenames. The ABC deepsyn column reports the result after decpla followed by deepsyn. Display names omit the _semantic suffix. Logic depth is a structural metric, not physical delay.
Randomly generated PDBFs: cube quantity to netlist parameters comparison
The first eight benchmarks keep the size fixed at 250 primary inputs and 1 primary output while increasing the number of PDBF cubes from 16 to 2,000. An additional benchmark has 250 primary inputs, 100 primary outputs and 2,000 cubes. G / L denotes gate count / maximum logic levels.
| Benchmark | PI/PO/Cubes | ABC decpla G / L | ABC deepsyn G / L | ABC transtoch G / L | GT G / L | GT Time, s | PLA |
|---|---|---|---|---|---|---|---|
E250_1_16 | 250 / 1 / 16 | 1 / 1 | 1 / 1 | 1 / 1 | 1 / 1 | — | PLA |
E250_1_32 | 250 / 1 / 32 | 4 / 3 | 4 / 3 | 4 / 3 | 4 / 3 | — | PLA |
E250_1_64 | 250 / 1 / 64 | 14 / 6 | 14 / 6 | — | 8 / 4 | 0.010 | PLA |
E250_1_128 | 250 / 1 / 128 | 69 / 9 | 49 / 10 | 47 / 17 | 19 / 6 | 0.004 | PLA |
E250_1_256 | 250 / 1 / 256 | 171 / 13 | 102 / 10 | — | 40 / 8 | 0.005 | PLA |
E250_1_500 | 250 / 1 / 500 | 319 / 16 | 227 / 12 223 / 14 | — | 92 / 18 93 / 11 | 1 0.670 | PLA |
E250_1_1000 | 250 / 1 / 1,000 | 636 / 19 | 477 / 14 | — | 194 / 22 220 / 12 | 17 0.871 | PLA |
E250_1_2000 | 250 / 1 / 2,000 | 1,266 / 22 1,290 / 23 | 978 / 16 980 / 15 | — | 392 / 35 460 / 14 | 72 4 | PLA |
Example_250_100_2000 | 250 / 100 / 2,000 | 128,569 / 24 | 109,108 / 18 | — | 25,508 / 366 38,143 / 84 38,701 / 91 50,866 / 16 | 6,543 1,131 1,191 2,108 | PLA |
ABC decpla reports synthesis from the PLA; deepsyn and transtoch report subsequent ABC optimization. Multiple pairs preserve the supplied alternatives. Entries in different columns need not correspond by line or branch. A dash indicates no result supplied. GT times are in seconds and correspond line by line to the GT gate/level pairs; millisecond runtimes have been converted to seconds.
Paper VI — PDBF Input-Scalability Challenge
This Paper VI benchmark series studies PDBF synthesis as the primary-input dimension grows from ten thousand to hundreds of thousands and one million inputs.
| Benchmark | PI | PO | Cubes | GT Gates | GT Levels | GT Time, s | PLA |
|---|---|---|---|---|---|---|---|
Example_10000_1000_5000 |
10,000 | 1,000 | 5,000 | 769,799 | 47 | 26,875 | PLA |
Ex100000_1_1000 |
100,000 | 1 | 1,000 | 89 | 15 | 63 | PLA |
Ex_1000000_1_100 |
1,000,000 | 1 | 100 | 6 | 4 | 4 | PLA |
The results illustrate that primary-input count alone does not determine synthesis difficulty. The care structure, number of outputs, cube structure and interactions among conditions can be equally important.
Reported synthesis metrics
PI — number of primary inputs. PO — number of primary outputs. Cubes — number of PLA product terms.
For the GT results, Gates denotes the number of internal two-input simple/AIG logic nodes. Complemented AIG edges do not count as additional gates. Levels is the maximum logic depth from a primary input to a primary output.
GT Time is the reported synthesis runtime in seconds for the corresponding experiment.
Verification rules and acceptance criteria
A synthesized network is a valid implementation of a benchmark only if it satisfies every specified PDBF output value over the complete care domain of the PLA.
-
For every PLA cube and every output specified as
0, the synthesized output must be0for every concrete binary input assignment covered by that cube. -
For every PLA cube and every output specified as
1, the synthesized output must be1for every concrete binary input assignment covered by that cube. -
An output value
-is unrestricted. A term for which all outputs are-imposes no PDBF constraint and should not be included in the effective truth table. -
Verification must cover the complete input region represented by a cube, not only one representative minterm.
If a PLA input is
-and belongs to the effective support of the synthesized output, all relevant assignments of that free support variable must be checked or proven equivalent. - If all primary inputs in the effective support of an output are fixed within a PLA cube, evaluation of that support assignment proves the output over the complete cube; primary inputs outside the output support cannot affect the result.
-
Two overlapping cubes may not impose contradictory values on the same output.
If two terms require opposite values,
0/1or1/0, for an output, their input cubes must be disjoint. Therefore at least one input position must contain an explicit complementary pair0/1or1/0. - Behavior outside the PDBF care domain is unrestricted. Two valid synthesized networks do not have to be globally equivalent if they make different choices in don't-care regions.
Results obtained with other synthesis tools
We welcome independent experiments with these benchmarks. If you obtain a synthesis result using another combinational logic synthesis tool, please inform us of the result and the synthesis conditions.
For meaningful comparison, please identify the tool and version, synthesis commands/options, hardware platform, runtime, peak memory if available, gate/node count and logic depth. The resulting implementation can be validated against the original PLA using the verification criteria above.
A valid result with fewer gates, fewer levels, or competitive synthesis time is welcome.
Input-size terminology used in this suite
The terms below are benchmark-suite classifications rather than claims of universal EDA terminology:
| Class | Primary inputs |
|---|---|
| Small | < 200 |
| Medium | 200 – 9,999 |
| Large | 10,000 – 99,999 |
| Very large | 100,000 – 999,999 |
| Extreme | ≥ 1,000,000 |
