Survey on FPGA Routing Techniques
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 7
Abstract
Field Programmable Gate Array (FPGA), a programmable integrated circuit, has gained great popularity in the circuit design. Routing is an important part of FPGA design step which determines the routing in horizontal and vertical channels of FPGA. In this paper, a number of routing techniques are reviewed. FPGA routing can be achieved in various approaches like based on geometric routing, and based on Boolean Satisfiability. The algorithms based on geometric routing are proved to be efficient algorithms for FPGA routing. The advantage of Boolean based algorithm is that it finds routing possibility and simultaneously route all nets.
Authors and Affiliations
Ms. Nagalakshmi Venugopal , R. Manimegalai
Keywords
Related Articles
- EP ID EP92728
- DOI -
- Views 141
- Downloads 0
Implementation and simulation of arithmetic logic unit, shifter and Multiplier in Quantum cellular automata technology
Quantum cellular automata (QCA) is a new technology in the nanometer scale and has been considered as one of the alternative to CMOS technology. QCA have a large potential in the development of circuits with high space d...
ADAPTIVE RESONANCE THEORY (ART1) APPROACH IN CBIR SYSTEM
In these days an image retrieval system has become a challenging task. Many systems based on the text based retrieval but the need of image based retrieval system that takes an image as the input query and retrieves imag...
Performance Comparison and Analysis of DSDV and AODV for MANET
Abstract—A Mobile Ad hoc NETwork (MANET) is a kind of wireless ad-hoc network, and is a self configuring network of mobile routers (and associated hosts) connected by wireless links – the union of which forms an arbitrar...
A Comparative Study of Machine Learning Approaches- SVM and LS-SVM using a Web Search Engine Based Application
Semantic similarity refers to the concept by which a set of documents or words within the documents are assigned a weight based on their meaning. The accurate measurement of such similarity plays important roles in Natur...
Estimation of worst case latency of periodic tasks in a real time distributed environment
Real-time computations require exact bounded response times. For relatively simple models of computation, it is possible to determine conditions under which it is theoretically possible to guarantee that an invocation of...