Years and Authors of Summarized Original Work
2012; Yan, Chu
2013; Yan, Chu
Problem Definition
Floorplanning is an early stage of the very-large-scale integration (VLSI) design process in which a coarse layout of a set of rectangular circuit blocks is determined. A floorplan enables designers to quickly estimate circuit performance, routing congestion, etc., of the circuit. In modern VLSI design flow, a fixed outline of the floorplanning region is given. On the other hand, many circuit blocks do not have a fixed shape during floorplanning as their internal circuitries have not yet been laid out. Those blocks are called soft blocks. Others blocks with predetermined shapes are called hard blocks. Given the geometric (i.e., left-right and above-below) relationship among the blocks, the block shaping problem is to determine the shapes of the soft blocks such that all blocks can be packed without overlap into the fixed-outline region.
To handle the block shaping problem in fixed-outline...
Keywords
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsRecommended Reading
Yan JZ, Chu C (2012) Optimal slack-driven block shaping algorithm in fixed-outline floorplanning. In: Proceedings of international symposium on physical design, Napa, pp 179–186
Yan JZ, Chu C (2013) SDS: an optimal slack-driven block shaping algorithm for fixed-outline floorplanning. IEEE Trans Comput Aided Design 32(2):175–188
Wang L-T, Chang Y-W, Cheng K-T (eds) (2009) Electronic design automation: synthesis, verification, and test. Morgan Kaufmann, Burlington
Kahng A (2000) Classical floorplanning harmful? In: Proceedings of international symposium on physical design, San Diego, pp 207–213
Otten RHJM (1982) Automatic floorplan design. In: Proceedings of ACM/IEEE design automation conference, Las Vegas, pp 261–267
Stockmeyer L (1983) Optimal orientations of cells in slicing floorplan designs. Inf Control 57:91–101
Wang TC, Wong DF (1992) Optimal floorplan area optimization. IEEE Trans Comput Aided Design 11(8):992–1001
Pan P, Liu CL (1995) Area minimization for floorplans. IEEE Trans Comput Aided Design 14(1):129–132
Kang M, Dai WWM (1997) General floorplanning with L-shaped, T-shaped and soft blocks based on bounded slicing grid structure. In: Proceedings of ASP-DAC, Chiba, pp 265–270
Moh TS, Chang TS, Hakimi SL (1996) Globally optimal floorplanning for a layout problem. IEEE Trans Circuits Syst I 43:713–720
Young FY, Chu CCN, Luk WS, Wong YC (2001) Handling soft modules in general non-slicing floorplan using Lagrangian relaxation. IEEE Trans Comput Aided Design 20(5):687–692
Lin C, Zhou H, Chu C (2006) A revisit to floorplan optimization by Lagrangian relaxation. In: Proceedings of ICCAD, San Jose, pp 164–171
Adya SN, Markov IL (2003) Fixed-outline floorplanning: enabling hierarchical design. IEEE Trans VLSI Syst 11(6):1120–1135
Lin J-M, Hung Z-X (2011) UFO: unified convex optimization algorithms for fixed-outline floorplanning considering pre-placed modules. IEEE Trans Comput Aided Design 30(7):1034–1044
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Chu, C. (2016). Block Shaping in Floorplan. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_743
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_743
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering