期刊名称：International Journal of Computer Science & Technology
印刷版ISSN：2229-4333
电子版ISSN：0976-8491
出版年度：2011
卷号：2
期号：4Ver 2
出版社：Ayushmaan Technologies
摘要：In this paper ANT colony optimization algorithm are used to solve geometric FPGA routing for a route based routing constraint model in FPGA design architecture which is a NP complete problem in nature and many conventional and heuristic algorithms have been developed and proposed for this problem . In this paper ant colony optimization algorithm is applied on the Boolean equation consist of the FPGA routing problem. The ACO based solution to SAT is then compared with the other SAT solver algorithms such as zChaff and GRASP. The experimental results suggest that the developed ant colony optimization algorithm has taken less CPU time as compared to zChaff and GRASP to route a FPGA circuit. This method is implemented and shown to be performed efficiently and can be extended to more complex circuits.
关键词：FPGA routing; route based model; constraint satisfaction;programming; and Boolean satisfiability Ant colony optimization;FPGA Routing; Ant satisfiabilty based detailed routing (ASDR);Classical satisfiabilty based detailed routing (SDR).
