Abstract
In this article we present an approach to the segment channel routing problem that occurs in FPGA design technology. The objective is to find an optimal solution for the k-segmented and unlimited segmented routing problems. A channel with programmable switches is converted to a channel with fixed switches under a chromosome. Both k-segmented and unlimited segmented routing are transformed into a 1-segment routing problem which can be solved in polynomial time. The fitness value of a chromosome is calculated during the process of solving the 1-segment routing. Experiments show that our algorithm can efficiently find a solution.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
