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.