Show simple item record

dc.contributor.authorMohd Nasir, Ayob
dc.contributor.authorZulkifli, Md Yusof
dc.contributor.authorAsrul, Adam
dc.contributor.authorAmar Faiz, Zainal Abidin
dc.contributor.authorIsmail, Ibrahim
dc.contributor.authorZuwairie, Ibrahim, Prof. madya
dc.contributor.authorShahdan, Sudin, Dr.
dc.contributor.authorNasir, Shaikh Husin
dc.contributor.authorMohamed Khalil, Mohd Hani
dc.date.accessioned2014-06-11T02:05:17Z
dc.date.available2014-06-11T02:05:17Z
dc.date.issued2010
dc.identifier.citationp. 49-53en_US
dc.identifier.isbn978-076954158-7
dc.identifier.urihttp://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=5614755&tag=1
dc.identifier.urihttp://dspace.unimap.edu.my:80/dspace/handle/123456789/35339
dc.descriptionProceeding of The 2nd International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN 2010) at Liverpool, United Kingdom on 28 July 2010 through 30 July 2010. Link to publisher's homepage at http://ezproxy.unimap.edu.my:2080/Xplore/dynhome.jspen_US
dc.description.abstractThe performance of very large scale integration (VLSI) circuits is depends on the interconnected routing in the circuits. In VLSI routing, wire sizing, buffer sizing, and buffer insertion are techniques to improve power dissipation, area usage, noise, crosstalk, and time delay. Without considering buffer insertion, the shortest path in routing is assumed having the minimum delay and better performance. However, the interconnect delay can be further improved if buffers are inserted at proper locations along the routing path. Hence, this paper proposes a heuristic technique to simultaneously find the optimal routing path and buffer location for minimal interconnect delay in VLSI based on particle swarm optimization (PSO). PSO is a robust stochastic optimization technique based on the movement and information sharing of swarms. In this study, location of doglegs is employed to model the particles that represent the routing solutions in VLSI. The proposed approach has a good potential in VLSI routing and can be further extended in future.en_US
dc.language.isoenen_US
dc.publisherIEEE Conference Publicationsen_US
dc.relation.ispartofseriesProceeding of The 2nd International Conference on Computational Intelligence, Communication Systems and Networks (CICSyN 2010);
dc.subjectBuffer insertionen_US
dc.subjectInterconnecten_US
dc.subjectParticle swarm optimizationen_US
dc.subjectRoutingen_US
dc.titleA particle swarm optimization approach for routing in VLSIen_US
dc.typeWorking Paperen_US
dc.identifier.url10.1109/CICSyN.2010.42
dc.contributor.urlkhalil@fke.utm.myen_US
dc.contributor.urlnasirsh@utm.myen_US
dc.contributor.urlshahdan@fke.utm.myen_US
dc.contributor.urlzuwairiee@fke.utm.myen_US
dc.contributor.urlamarfaiz@fke.utm.myen_US
dc.contributor.urlasruldm@gmail.comen_US
dc.contributor.urlzmdyusof@fke.utm.myen_US
dc.contributor.urlnasirayob@unimap.edu.myen_US
dc.contributor.urlzuwairie@ump.edu.myen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record