Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

CEC
2005
IEEE

favoriteEmaildiscussreport

128views Artificial Intelligence» more CEC 2005»

FPGA segmented channel routing using genetic algorithms

13 years 10 months ago

FPGA segmented channel routing using genetic algorithms

Download www3.ntu.edu.sg

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.

Lipo Wang, Lei Zhou, Wen Liu

Real-time Traffic

Artificial Intelligence | CEC 2005 | Channel Routing | Channel Routing Problem | Segmented Channel |

claim paper

Related Content

» Customized regular channel design in FPGAs

» TORCH a design tool for routing channel segmentation in FPGAs

» Wire type assignment for FPGA routing

» An architecturedriven metric for simultaneous placement and global routing for FPGAs

» A Genetic Algorithm for Channel Routing using InterCluster Mutation

» Automatic Design of FPGA Processor for the Backtracking of DNA Sequences Evolution Using C...

» Placement and routing of Boolean functions in constrained FPGAs using a distributed geneti...

» Genetic Algorithm for Restrictive Channel Routing Problem

» New PerformanceDriven FPGA Routing Algorithms

Post Info
More Details (n/a)

Added	24 Jun 2010
Updated	24 Jun 2010
Type	Conference
Year	2005
Where	CEC
Authors	Lipo Wang, Lei Zhou, Wen Liu

Comments (0)