Abstract
Floor-planning is one of the key design flow of VLSI chip designing process. This paper presents a novel approach to solve the VLSI floor planning problems. This approach is based on iterative prototypes optimization with evolved improvement (POEMS) algorithm. It uses a genetic algorithm (GA) for local search on each iteration, because both algorithms have already proven useful for solving similar problems. It adopts a non-slicing structure B* tree for the placement of rectangle modules. B*-trees are based on ordered binary trees. Inheriting from the nice properties of ordered binary trees, B*-trees are very easy for implementation and can perform the respective primitive tree operations, like search, insertion, and deletion in only O(1), O(1) and O(n) times respectively. While existing representations for non-slicing floor-plans need at least O(n) time for each of these operations, where n is the number of modules. GA has been implemented and tested on popular benchmark problems. Experimental results show that GA can quickly produce optimal solutions for all tested benchmark problems.
Sign-in/Register to access full text options 
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.
