loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Tenth International Conference on VLSI Design: VLSI in Multimedia Applications
Channel and Switchbox Routing with Minimized Crosstalk - A Parallel Genetic Algorithm Approach
Hyderabad, India
January 04-January 07
ISBN: 0-8186-7755-4
ASCII Text
x 
 
J. Lienig, "Channel and Switchbox Routing with Minimized Crosstalk - A Parallel Genetic Algorithm Approach," VLSI Design, International Conference on, pp. 27, Tenth International Conference on VLSI Design: VLSI in Multimedia Applications, 1997.
 
 
BibTex
x
 
@article{ 10.1109/ICVD.1997.567956,
author = {J. Lienig},
title = {Channel and Switchbox Routing with Minimized Crosstalk - A Parallel Genetic Algorithm Approach},
journal ={VLSI Design, International Conference on},
volume = {0},
year = {1997},
issn = {1063-9667},
pages = {27},
doi = {http://doi.ieeecomputersociety.org/10.1109/ICVD.1997.567956},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - VLSI Design, International Conference on
TI - Channel and Switchbox Routing with Minimized Crosstalk - A Parallel Genetic Algorithm Approach
SN - 1063-9667
SP
EP
A1 - J. Lienig,
PY - 1997
KW - VLSI
KW - minimized crosstalk
KW - interconnection routing
KW - interconnection crosstalk
KW - VLSI design
KW - VLSI channel routing
KW - VLSI switchbox routing
KW - parallel genetic algorithm
KW - distributed workstation network
VL - 0
JA - VLSI Design, International Conference on
ER -
 
J. Lienig, Tanner Res., Pasadena, CA, USA
Reduction of crosstalk between interconnections becomes an important consideration in today's VLSI design. This paper presents a novel approach to solve the VLSI channel and switchbox routing problems with the objective of satisfying crosstalk constraints for the nets. The approach is based on a parallel genetic algorithm which runs on a distributed network of workstations. All our routing results are qualitatively better or as good as the best published results. In addition, our algorithm is able to significantly reduce the occurrence of crosstalk.
Index Terms:
VLSI, minimized crosstalk, interconnection routing, interconnection crosstalk, VLSI design, VLSI channel routing, VLSI switchbox routing, parallel genetic algorithm, distributed workstation network
Citation:
J. Lienig, "Channel and Switchbox Routing with Minimized Crosstalk - A Parallel Genetic Algorithm Approach," vlsid, pp.27, Tenth International Conference on VLSI Design: VLSI in Multimedia Applications, 1997
Usage of this product signifies your acceptance of the Terms of Use.