Difficult Channel Instance Generator for VLSI Physical Design Automation using Genetic Algorithm

@article{Sau2017DifficultCI,
  title={Difficult Channel Instance Generator for VLSI Physical Design Automation using Genetic Algorithm},
  author={S. S. Sau and R. K. Pal},
  journal={Indian journal of science and technology},
  year={2017},
  volume={10},
  pages={1-8}
}
  • S. S. Sau, R. K. Pal
  • Published 2017
  • Computer Science
  • Indian journal of science and technology
  • Objectives: The wire length minimization of Channel routing problem is NP-hard. There are several heuristic algorithms available in the literature to get the feasible routing solutions using some limited instances. Here we want to generate all possible random channel instances based on Genetic Algorithm (GA). Methods/ Statistical Analysis: The present paper is described in three phases. In the first phase, we generate fixed size initial population based on some strategies and define the fitness… CONTINUE READING

    References

    SHOWING 1-10 OF 27 REFERENCES
    A re-router for optimizing wire length in two-and four-layer no-dogleg channel routing
    • S. S. Sau, R. Pal
    • Engineering, Computer Science
    • 18th International Symposium on VLSI Design and Test
    • 2014
    • 3
    Routing through a dense channel with minimum total wire length
    • 26
    An efficient high performance parallel algorithm to yield reduced wire length VLSI circuits
    • S. S. Sau, R. Pal
    • Engineering
    • 2012 5th International Conference on Computers and Devices for Communication (CODEC)
    • 2012
    • 5