Efficient large scale integration power/ground network optimization based on grid genetic algorithm

Yun Yang, Atsushi Kurokawa, Yasuaki Inoue, Wenqing Zhao

    Research output: Contribution to journalArticle

    1 Citation (Scopus)

    Abstract

    In this paper we propose a novel and efficient method for the optimization of the power/ground (P/G) network in VLSI circuit layouts with reliability constraints. Previous algorithms in the P/G network sizing used the sequence-of-linear-programming (SLP) algorithm to solve the nonlinear optimization problems. However the transformation from nonlinear network to linear subnetwork is not optimal enough. Our new method is inspired by the biological evolution and use the grid-geneticalgorithm (GGA) to solve the optimization problem. Experimental results show that new P/G network sizes are smaller than previous algorithms, as the fittest survival in the nature. Another significant advance is that GGA method can be applied for all P/G network problems because it can get the results directly no matter whether these problems are linear or not. Thus GGA can be adopted in the transient behavior of the P/G network sizing in the future, which recently faces on the obstacles in the solution of the complex nonlinear problems.

    Original languageEnglish
    Pages (from-to)3412-3419
    Number of pages8
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE88-A
    Issue number12
    DOIs
    Publication statusPublished - 2005 Dec

    Fingerprint

    LSI circuits
    Network Optimization
    Genetic algorithms
    Genetic Algorithm
    Grid
    Nonlinear networks
    Integrated circuit layout
    VLSI circuits
    Linear programming
    Nonlinear Problem
    Optimization Problem
    Biological Evolution
    VLSI Circuits
    Transient Behavior
    Nonlinear Optimization
    Layout
    Optimization
    Experimental Results

    Keywords

    • GGA method
    • Global optimum
    • P/G network optimization
    • SLP algorithm

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Hardware and Architecture
    • Information Systems

    Cite this

    Efficient large scale integration power/ground network optimization based on grid genetic algorithm. / Yang, Yun; Kurokawa, Atsushi; Inoue, Yasuaki; Zhao, Wenqing.

    In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E88-A, No. 12, 12.2005, p. 3412-3419.

    Research output: Contribution to journalArticle

    @article{102c32ba77384731989c1ca38d0b648e,
    title = "Efficient large scale integration power/ground network optimization based on grid genetic algorithm",
    abstract = "In this paper we propose a novel and efficient method for the optimization of the power/ground (P/G) network in VLSI circuit layouts with reliability constraints. Previous algorithms in the P/G network sizing used the sequence-of-linear-programming (SLP) algorithm to solve the nonlinear optimization problems. However the transformation from nonlinear network to linear subnetwork is not optimal enough. Our new method is inspired by the biological evolution and use the grid-geneticalgorithm (GGA) to solve the optimization problem. Experimental results show that new P/G network sizes are smaller than previous algorithms, as the fittest survival in the nature. Another significant advance is that GGA method can be applied for all P/G network problems because it can get the results directly no matter whether these problems are linear or not. Thus GGA can be adopted in the transient behavior of the P/G network sizing in the future, which recently faces on the obstacles in the solution of the complex nonlinear problems.",
    keywords = "GGA method, Global optimum, P/G network optimization, SLP algorithm",
    author = "Yun Yang and Atsushi Kurokawa and Yasuaki Inoue and Wenqing Zhao",
    year = "2005",
    month = "12",
    doi = "10.1093/ietfec/e88-a.12.3412",
    language = "English",
    volume = "E88-A",
    pages = "3412--3419",
    journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
    issn = "0916-8508",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "12",

    }

    TY - JOUR

    T1 - Efficient large scale integration power/ground network optimization based on grid genetic algorithm

    AU - Yang, Yun

    AU - Kurokawa, Atsushi

    AU - Inoue, Yasuaki

    AU - Zhao, Wenqing

    PY - 2005/12

    Y1 - 2005/12

    N2 - In this paper we propose a novel and efficient method for the optimization of the power/ground (P/G) network in VLSI circuit layouts with reliability constraints. Previous algorithms in the P/G network sizing used the sequence-of-linear-programming (SLP) algorithm to solve the nonlinear optimization problems. However the transformation from nonlinear network to linear subnetwork is not optimal enough. Our new method is inspired by the biological evolution and use the grid-geneticalgorithm (GGA) to solve the optimization problem. Experimental results show that new P/G network sizes are smaller than previous algorithms, as the fittest survival in the nature. Another significant advance is that GGA method can be applied for all P/G network problems because it can get the results directly no matter whether these problems are linear or not. Thus GGA can be adopted in the transient behavior of the P/G network sizing in the future, which recently faces on the obstacles in the solution of the complex nonlinear problems.

    AB - In this paper we propose a novel and efficient method for the optimization of the power/ground (P/G) network in VLSI circuit layouts with reliability constraints. Previous algorithms in the P/G network sizing used the sequence-of-linear-programming (SLP) algorithm to solve the nonlinear optimization problems. However the transformation from nonlinear network to linear subnetwork is not optimal enough. Our new method is inspired by the biological evolution and use the grid-geneticalgorithm (GGA) to solve the optimization problem. Experimental results show that new P/G network sizes are smaller than previous algorithms, as the fittest survival in the nature. Another significant advance is that GGA method can be applied for all P/G network problems because it can get the results directly no matter whether these problems are linear or not. Thus GGA can be adopted in the transient behavior of the P/G network sizing in the future, which recently faces on the obstacles in the solution of the complex nonlinear problems.

    KW - GGA method

    KW - Global optimum

    KW - P/G network optimization

    KW - SLP algorithm

    UR - http://www.scopus.com/inward/record.url?scp=29144492221&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=29144492221&partnerID=8YFLogxK

    U2 - 10.1093/ietfec/e88-a.12.3412

    DO - 10.1093/ietfec/e88-a.12.3412

    M3 - Article

    AN - SCOPUS:29144492221

    VL - E88-A

    SP - 3412

    EP - 3419

    JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

    JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

    SN - 0916-8508

    IS - 12

    ER -