An improved algorithm for minimum-area retiming
DAC '97 Proceedings of the 34th annual Design Automation Conference
Integration of retiming with architectural floorplanning
Integration, the VLSI Journal - Special issue on timing closure
Delay budgeting in sequential circuit with application on FPGA placement
Proceedings of the 40th annual Design Automation Conference
Continuous retiming: algorithms and applications
ICCD '97 Proceedings of the 1997 International Conference on Computer Design (ICCD '97)
Utilizing the retiming-skew equivalence in a practical algorithm for retiming large circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A delay budgeting algorithm ensuring maximum flexibility in placement
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Design closure driven delay relaxation based on convex cost network flow
Proceedings of the conference on Design, automation and test in Europe
Physical synthesis for FPGA interconnect power reduction by dual-Vdd budgeting and retiming
ACM Transactions on Design Automation of Electronic Systems (TODAES)
| Hi-index | 0.00 |
The constraint-based approach to timing-driven placementrequires delay budgeting to define the delay upper bounds for nets.While most of the previous delay-budgeting works have beenfocused on optimizing combinational circuits, the work in [Delay Budgeting in Sequential Circuit with Application On FPGA Placement]introduces sequential budgeting, which combines budgeting andretiming to optimize sequential circuits better. However, theformulation in [Delay Budgeting in Sequential Circuit with Application On FPGA Placement] does not consider flip-flop (FF) minimization,which is important in practical applications. Here, we propose anew sequential budgeting algorithm, C-SBGT, that not onlycontrols the FF count, but also can be solved more efficientlycompared to [Delay Budgeting in Sequential Circuit with Application On FPGA Placement]. Our formulation has fewer constraints than [Delay Budgeting in Sequential Circuit with Application On FPGA Placement] and the procedure to realize retiming is also simpler. Ourexperiments show that our new min-area sequential budgetingalgorithm produces a good trade-off between the area andbudgeting optimization goals, as well as improving the timingof previous sequential budgeting method by 12%.