This paper proposes a Satisfiability Modulo Theory based formulation forfloorplanning in VLSI circuits. The proposed approach allows a number of fixedblocks to be placed within a layout region without overlapping and at the sametime minimizing the area of the layout region. The proposed approach isextended to allow a number of fixed blocks with ability to rotate and flexibleblocks (with variable width and height) to be placed within a layout withoutoverlap. Our target in all cases is reduction in area occupied on a chip whichis of vital importance in obtaining a good circuit design. SatisfiabilityModulo Theory combines the problem of Boolean satisfiability with domains suchas convex optimization. Satisfiability Modulo Theory provides a richer modelinglanguage than is possible with pure Boolean SAT formulas. We have conducted ourexperiments on MCNC and GSRC benchmark circuits to calculate the total areaoccupied, amount of deadspace and the total CPU time consumed while placing theblocks without overlapping. The results obtained shows clearly that the amountof dead space or wasted space is reduced if rotation is applied to the blocks.
展开▼
