Novel Convex Optimization Approaches for VLSI Floorplanning
The floorplanning problem aims to arrange a set of rectangular modules on a rectangular chip area so as to optimize an appropriate measure of performance. This problem is known to be NP-hard, and is particularly challenging if the chip dimensions are fixed. Fixed-outline floorplanning is becoming i...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
2008
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10012/3678 |