A VLSI placement method using genetic algorithm considering hierarchical structure of solution space

✍ Scribed by Seiichi Koakutsu; Yuji Urushida; Hironori Hirata

• Publisher: John Wiley and Sons
• Year: 2000
• Tongue: English
• Weight: 237 KB
• Volume: 131
• Category: Article
• ISSN: 0424-7760
• DOI: 10.1002/(sici)1520-6416(20000415)131:1<86::aid-eej9>3.0.co;2-5

✦ Synopsis

This paper proposes a new VLSI placement method using genetic algorithm considering the hierarchical structure of solution space. In the proposed method, we introduce a special solution encoding which represents the hierarchical structure of solution space, and new crossover operators which can maintain the hierarchical structure of the encoded solution. Making use of the hierarchical nature of the solution space, the proposed method can search the solution space efficiently. We demonstrate the efficiency of the proposed method by applying it to VLSI cell placement problems. Computational experiments show that the proposed method obtains better placement results within less computation time compared with conventional genetic algorithm.