FPGA segmented channel routing using genetic algorithms

Lipo Wang; Lei Zhou; Wen Liu

FPGA segmented channel routing using genetic algorithms

Lipo Wang^*, Lei Zhou, Wen Liu

^*Corresponding author for this work

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

16 Citations (Scopus)

Abstract

A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (FSCRP) is formulated as a special case of a matrix row matching problem which is known to be NP-complete. The goal of FSCRPS is to find a conflict-free net assignment in the tracks within the channel with the minimum routing cost. Simulations on 30 benchmark instances show that GA is able to obtain better solutions compared to the gradual neural network (GNN) approach.

Original language	English
Title of host publication	2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
Pages	2161-2165
Number of pages	5
Publication status	Published - 2005
Externally published	Yes
Event	2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005 - Edinburgh, Scotland, United Kingdom Duration: 2 Sept 2005 → 5 Sept 2005

Publication series

Name	2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings
Volume	3

Conference

Conference	2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005
Country/Territory	United Kingdom
City	Edinburgh, Scotland
Period	2/09/05 → 5/09/05

Cite this

@inproceedings{38bb39c7b33c46e69397f57432f51bc4,

title = "FPGA segmented channel routing using genetic algorithms",

abstract = "A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (FSCRP) is formulated as a special case of a matrix row matching problem which is known to be NP-complete. The goal of FSCRPS is to find a conflict-free net assignment in the tracks within the channel with the minimum routing cost. Simulations on 30 benchmark instances show that GA is able to obtain better solutions compared to the gradual neural network (GNN) approach.",

author = "Lipo Wang and Lei Zhou and Wen Liu",

year = "2005",

language = "English",

isbn = "0780393635",

series = "2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings",

pages = "2161--2165",

booktitle = "2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings",

note = "2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005 ; Conference date: 02-09-2005 Through 05-09-2005",

}

Wang, L, Zhou, L & Liu, W 2005, FPGA segmented channel routing using genetic algorithms. in 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings. 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings, vol. 3, pp. 2161-2165, 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005, Edinburgh, Scotland, United Kingdom, 2/09/05.

FPGA segmented channel routing using genetic algorithms. / Wang, Lipo; Zhou, Lei; Liu, Wen.
2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings. 2005. p. 2161-2165 (2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings; Vol. 3).

Research output: Chapter in Book or Report/Conference proceeding › Conference Proceeding › peer-review

TY - GEN

T1 - FPGA segmented channel routing using genetic algorithms

AU - Wang, Lipo

AU - Zhou, Lei

AU - Liu, Wen

PY - 2005

Y1 - 2005

N2 - A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (FSCRP) is formulated as a special case of a matrix row matching problem which is known to be NP-complete. The goal of FSCRPS is to find a conflict-free net assignment in the tracks within the channel with the minimum routing cost. Simulations on 30 benchmark instances show that GA is able to obtain better solutions compared to the gradual neural network (GNN) approach.

AB - A genetic algorithm approach for segmented channel routing in field programmable gate arrays (FPGA's) is presented in this paper. The FPGA segmented channel routing problem (FSCRP) is formulated as a special case of a matrix row matching problem which is known to be NP-complete. The goal of FSCRPS is to find a conflict-free net assignment in the tracks within the channel with the minimum routing cost. Simulations on 30 benchmark instances show that GA is able to obtain better solutions compared to the gradual neural network (GNN) approach.

UR - http://www.scopus.com/inward/record.url?scp=27144467749&partnerID=8YFLogxK

M3 - Conference Proceeding

AN - SCOPUS:27144467749

SN - 0780393635

T3 - 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

SP - 2161

EP - 2165

BT - 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005. Proceedings

T2 - 2005 IEEE Congress on Evolutionary Computation, IEEE CEC 2005

Y2 - 2 September 2005 through 5 September 2005

ER -

FPGA segmented channel routing using genetic algorithms

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this