File Entry: A Two-Step Binary Particle Swarm Optimization Approach For Routing in VLSI (Appear In Press)
Created: 2012-05-11 01:52:33
Last updated: 2012-05-11 01:52:34
|
License
|
Credits (1)
|
Attributions (0)
|
Tags
|
Featured in Packs (0)
|
Attributed By (0)
|
Favourited By (0)
|
| Version History | Comments (0) |
| Version History | Comments (0) |
| Title | A Two-Step Binary Particle Swarm Optimization Approach For Routing in VLSI (Appear In Press) |
| File name | Z.M.Yusof_A.F.Z.Abidin_A.Adam_K.Khalil_J.A.A.Mukred_M.S.Mohamad_Z.Ibrahim2011-A_Two-Step_Binary_Particle_Swarm_Optimizat.pdf |
| File size | 1363120 |
| SHA1 | 045dd2dc67df23e9bb88ae6e00756c321feb2a3a |
| Content type | Adobe PDF |
Description
Manipitetibn of wdre itzing, buffer sizing, and futffer inseriiai atu a few
techniques that con be used to i,mproae tfune d,eloy 'in aery lorge su,le intqrction (VLSI)
circuit routing- Thi* paper enhances an eri,sting approach, which is based on Particl,e
Swarrn Optimization (PSO) fur sofuing rcuting poblem in VLil circaits. A hoo-step
Binary Particle Swarm Optimizatdon (BPSO) apprcach, which is based on BPSO, is
chosen in thi^s stuily to improue time ilelay through finding the best path of wi,re placement
with buffer insert'i,on from source to sink. The best path o! uti,rc placement'is found, in
the first step by the first BPSO ant then the seund BPSO fazib the best tocotion of
buffer i,nsertion olong the wire. A case studg is token to nxensure the perforrnance of the
proposed, mad,el and, the rcsult is obtaineil comparel with the prcrintrc PSO approoch for
VLSI ruuting.
Download File
No comments yet
Log in to make a comment