A novel particle swarm optimization approach for VLSI routing

@article{Khan2013ANP,
  title={A novel particle swarm optimization approach for VLSI routing},
  author={Abhinandan Khan and Sumit Laha and S. K. Sarkar},
  journal={2013 3rd IEEE International Advance Computing Conference (IACC)},
  year={2013},
  pages={258-262}
}
Rapid advances in VLSI technology has increased the chip density by constantly increasing the number of constituents on a single chip, as well as decreasing the chip feature size. In such a complex scenario the primary objective is to limit the power-delay product of the system. It can be done by reducing the interconnect delay by optimizing the wire lengths i.e. by the proper interconnection of all the nodes. The minimum cost of interconnection of all nodes can be found by a Rectilinear… CONTINUE READING
7 Citations
6 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Particle Swarm Optimization

  • J. Kennedy, R. C. Eberhart
  • IEEE International Conference on Neural Networks…
  • 1995
Highly Influential
3 Excerpts

A discrete binary version of the particle swarm algorithm

  • J. Kennedy, R. C. Eberhart
  • Proceedings of the World Multiconference on…
  • 1997
2 Excerpts

Similar Papers

Loading similar papers…