Optimal orientations of cells in slicing floorplan designs
Information and Control
Path-delay constrained floorplanning: a mathematical programming approach for initial placement
DAC '89 Proceedings of the 26th ACM/IEEE Design Automation Conference
MHERTZ: a new optimization algorithm for floorplanning and global routing
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
An analytical approach to floorplan design and optimization
DAC '90 Proceedings of the 27th ACM/IEEE Design Automation Conference
Timing influenced force directed floorplanning
EURO-DAC '95/EURO-VHDL '95 Proceedings of the conference on European design automation
DAC '88 Proceedings of the 25th ACM/IEEE Design Automation Conference
A new algorithm for floorplan design
DAC '86 Proceedings of the 23rd ACM/IEEE Design Automation Conference
VISI Physical Design Automation: Theory and Practice
VISI Physical Design Automation: Theory and Practice
Data Structures and Algorithms
Data Structures and Algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
Efficient and effective placement for very large circuits
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
LFF algorithm for heterogeneous FPGA floorplanning
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
| Hi-index | 0.00 |
This paper describes the floorplanning for FPGA based designs. In order to perform placement for very large designs, the currently followed approach of placing flat netlists is extremely time consuming. Also, managing large data sets, as in flat netlist files, is not trivial for performance driven designs. In this paper we describe an approach for the constraint-based FPGA floorplanning of flexible and fixed macro blocks. Our approach is to construct a floorplan of small area that respects the input constraint set. The input constraint set is derived from topological placement of the macro blocks based on both FPGA architectural constraints and ASIC design. Experimental results on FPGA floorplanning are also presented for large benchmark examples.