Ant Colony Optimization approach for Solving FPGA routing with minimum Channel Width

Journal Title: International Journal on Computer Science and Engineering - Year 2011, Vol 3, Issue 7

Abstract

In this paper ANT colony optimization algorithm has been proposed to solve FPGA routing in FPGA design architecture with minimum umbers of tracks per channel. In our method geometric FPGA routing task is transformed into a Boolean satisfiability (SAT) equation with the property that any assignment of input variables that satisfies the equation specifies a valid route. The satisfiability equation is then modeled as Constraint Satisfaction problem. Satisfying assignment for particular route will result in a valid routing and absence of a satisfying assignment implies that the layout is unroutable. In second phase of this method ant colony optimization algorithm is applied on the Boolean equation for solving routing alternatives utilizing approach of hard combinatorial optimization problems. The ACO based solution to SAT is then compared with the other SAT solver algorithms such as zChaff and GRASP. The experimental results suggested that the developed ant colony optimization algorithm is taking fewer amounts of time and minimum channel width to route a FPGA chip.

Authors and Affiliations

Vinay Chopra , Amardeep Singh

Keywords

Related Articles

A VIEW ON SECURE ROUTING IN ADHOC NETWORKS

In our proposed research work different security attacks from the perspective of layer approach are identified. The impacts of security attacks on each layer are studied. Then we focus on security attacks on network laye...

FUZZY LOGIC BASED SOFTWARE PROCESS IMPROVIZATION FRAMEWORK FOR INDIAN SMALL SCALE SOFTWARE ORGANIZATIONS

In this paper, the authors elaborate the results obtained after analyzing and assessing the software process activities in five small to medium sized Indian software companies. This work demonstrates a cost effective fra...

Edge Detection in Gray Level Images Based on Non-Shannon Entropy

Digital image processing is a subset of the electronic domain, wherein the image is converted to an array of small integers, called pixels, representing a physical quantity. Edges characterize boundaries and edge detecti...

Fingerprint Verification System Using Support Vector Machine

Efficient fingerprint verification system is needed in many places for personal identification to access physical facilities, information etc. This paper proposes robust verification system based on features extracted fr...

An Algorithm for Frequent Pattern Mining Based On Apriori

Frequent pattern mining is a heavily researched area in the field of data mining with wide range of applications. Mining frequent patterns from large scale databases has emerged as an important problem in data mining and...

Download PDF file
  • EP ID EP102879
  • DOI -
  • Views 99
  • Downloads 0

How To Cite

Vinay Chopra, Amardeep Singh (2011). Ant Colony Optimization approach for Solving FPGA routing with minimum Channel Width. International Journal on Computer Science and Engineering, 3(7), 2855-2861. https://europub.co.uk/articles/-A-102879