Abstract
This paper presents a timing-driven floorplanning algorithm for building block layout. As the interconnection delay model, the proposed algorithm adopts the Elmore delay model. The algorithm consists of two phases. In phase 1, a timing-driven topological arrangement of blocks is generated with the resolution of overlap among blocks using nonlinear programming under the timing constraints. In phase 2, the algorithm performs floorplan sizing which determines the sizes and the shapes of blocks based on the topological arrangement obtained in phase 1 so as to minimize the chip area, and obtains a legal floor-plan. This phase is based on the topological constraint manipulation. Through the experimental results, the proposed algorithm can produce results without any timing violations within a practical computation time.KeywordsFloorplanningElmore delaynonlinear programmingtopological constraint
Published Version (
Free)
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
