Dataset Viewer
Auto-converted to Parquet Duplicate
answer
stringclasses
2 values
question
stringclasses
2 values
sta_report
stringclasses
2 values
violation_causes
listlengths
2
2
clock_definitions
stringclasses
2 values
repair_directions
listlengths
3
3
design_description
stringclasses
2 values
timing_constraints
stringclasses
2 values
critical_path_summary
stringclasses
2 values
The reported path from u_req_q[31]/Q to u_addr_q[4]/D arrives at 1.040 ns against a 0.900 ns requirement, giving -0.140 ns slack. The design context identifies a combinational priority encoder followed by an address mux, while the report shows 0.420 ns in the priority stage, 0.210 ns in the mux, and 0.180 ns on the fan...
What is the main cause of the setup violation, and which repair directions are supported by the report and design context?
Path group: core_clk; analysis: max/setup. Startpoint: u_req_q[31]/Q. Endpoint: u_addr_q[4]/D. Launch edge: 0.000 ns; launch clock latency: 0.040 ns. Data path (incremental / cumulative): clock-to-Q 0.080 / 0.120 ns; priority AOI stage 0.420 / 0.540 ns; n_req_valid net, fanout 24, 0.180 / 0.720 ns; address-select MUX2 ...
[ "The path combines priority-encoder logic and an address-select mux in one register-to-register cycle, as described for the design and reflected by the reported cell delays.", "The n_req_valid net has fanout 24 and contributes 0.180 ns of reported delay, increasing the path delay." ]
core_clk has a period of 1.000 ns and waveform {0.000, 0.500 ns}. Setup uncertainty is 0.060 ns. The reported setup check uses a 1.000 ns capture edge, 0.040 ns launch-clock latency, and 0.030 ns capture-clock latency. No generated clocks are defined; both path registers are clocked by core_clk.
[ "Evaluate a balanced priority implementation or other logic restructuring to reduce the priority-encode delay.", "Reduce the fanout or physical span of n_req_valid, for example by reviewing its consumers and considering functionally equivalent logic duplication.", "Review placement and routing on the reported p...
The 32-bit request vector is sampled in u_req_q and feeds a combinational priority encoder followed by an address-select mux that drives addr_q. The reported path begins at request bit 31 and passes through priority logic and the address selection before reaching addr_q. The n_req_valid control net drives 24 select or ...
create_clock -name core_clk -period 1.000 [get_ports clk] set_clock_uncertainty -setup 0.060 [get_clocks core_clk] set_input_delay -max 0.180 -clock core_clk [get_ports req_in[*]] set_false_path -from [get_ports rst_n] No multicycle exception applies to the reported register-to-register path.
The max/setup path from u_req_q[31]/Q to u_addr_q[4]/D traverses priority logic, a fanout-24 control net, and an address mux. Arrival is 1.040 ns versus a 0.900 ns requirement, for -0.140 ns slack.
This is a min/hold violation: data arrives at valid_q/D at 0.070 ns, but the hold requirement is 0.150 ns, producing -0.080 ns slack. The data path is short, with only 0.020 ns of net and gate delay after clock-to-Q. At the same time, the capture clock arrives 0.105 ns later than the launch clock, increasing the hold r...
Why does this path fail hold despite having little combinational logic, and what repairs are appropriate?
Path group: core_clk; analysis: min/hold. Startpoint: u_ctrl/flush_q/Q. Endpoint: u_ctrl/valid_q/D. Launch edge: 0.000 ns; launch clock latency: 0.015 ns. Data path (incremental / cumulative): clock-to-Q 0.035 / 0.050 ns; local net 0.005 / 0.055 ns; NAND2 clear gate 0.015 / 0.070 ns. Data arrival time: 0.070 ns. Captur...
[ "The data path is very short: after 0.035 ns clock-to-Q, the local net and NAND2 gate add only 0.020 ns.", "The capture clock arrives 0.105 ns later than the launch clock, increasing the hold requirement for this same-clock path." ]
core_clk has a period of 2.000 ns and waveform {0.000, 1.000 ns}. The path uses the same propagated clock for launch and capture. For the reported hold check, launch-clock latency is 0.015 ns and capture-clock latency is 0.120 ns. Hold uncertainty is 0.000 ns; setup uncertainty is 0.050 ns.
[ "Insert implementation-approved delay cells or other hold-fix elements on the data path, then recheck hold and setup timing.", "Review clock-tree balance and the reported launch and capture branches to determine whether the positive capture skew can be reduced without harming other timing checks.", "Preserve th...
The flush_q register drives the valid_q input through a single NAND2 clear-path gate. There is no intervening register or deeper combinational logic on this path. Both registers use core_clk. In the reported propagated-clock results, the capture clock arrives 0.105 ns later than the launch clock.
create_clock -name core_clk -period 2.000 [get_ports clk] set_clock_uncertainty -setup 0.050 [get_clocks core_clk] set_clock_uncertainty -hold 0.000 [get_clocks core_clk] set_false_path -from [get_ports rst_n] No multicycle exception applies to the reported register-to-register path.
The min/hold path from u_ctrl/flush_q/Q to u_ctrl/valid_q/D contains one NAND2 gate and arrives at 0.070 ns. The 0.150 ns hold requirement, including 0.120 ns capture latency and 0.030 ns hold time, yields -0.080 ns slack; capture latency exceeds launch latency by 0.105 ns.

Static Timing Analysis Diagnostic Question Answering Dataset

Designed for timing analysis in digital circuit systems, this dataset provides long-form contexts combining timing constraints, clock definitions, static timing analysis reports, and relevant RTL or netlist descriptions. Questions address critical paths, causes of timing violations, and potential repair directions, with answers that synthesize report evidence and design context. It supports domain-specific supervised fine-tuning and evaluation of timing-analysis question answering.

Technical Specifications

Field Type Description
answer string A domain-specific answer that combines timing report evidence and design context to address the question.
question string A question about a critical path, the cause of a timing violation, or a possible timing improvement.
sta_report string A static timing analysis report containing path details, arrival and required times, slack, and violation information.
violation_causes array A list of evidence-based causes that may explain the timing violation.
clock_definitions string Clock definition text, including clock periods, waveforms, generated clocks, and relationships between clocks.
repair_directions array A list of possible design or constraint changes that could address the identified timing issue.
design_description string Relevant RTL, netlist, or design explanation that provides context for interpreting the reported timing paths.
timing_constraints string Timing constraint text relevant to the design, such as input and output delays, false paths, and multicycle paths.
critical_path_summary string A concise explanation of the relevant startpoint, endpoint, path characteristics, and timing result.

Compliance Statement

Authorization TypeCC-BY-NC-SA 4.0 (Attribution–NonCommercial–ShareAlike)
Commercial UseRequires exclusive subscription or authorization contract (monthly or per-invocation charging)
Privacy and AnonymizationNo PII, no real company names, simulated scenarios follow industry standards
Compliance SystemCompliant with China's Data Security Law / EU GDPR / supports enterprise data access logs

Source & Contact

contact@mobiusi.com

Downloads last month
14