DocumentCode :
1068038
Title :
On routability for FPGAs under faulty conditions
Author :
Roy, Kaushik ; Nag, Sudip
Author_Institution :
Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA
Volume :
44
Issue :
11
fYear :
1995
fDate :
11/1/1995 12:00:00 AM
Firstpage :
1296
Lastpage :
1305
Abstract :
The field programmable gate array (FPGA) routing resources are fixed and their usage is constrained by the location of programmable interconnects (PIs) such as antifuses. The routing or the interconnect delays are determined by the length of segments assigned to the nets of various lengths and the number of PIs programmed for routing of each net. Due to the use of PIs certain unconventional faults may appear. In this paper we model the PI faults and address the design and routability of the FPGA channel architecture to achieve 100% routing with minimum performance penalty in the presence of PI faults. A channel routing algorithm has also been developed which routes nets in the presence of PI faults. Experiments were performed by randomly injecting faults of different types into the routing channel and then using the routing algorithm to determine the routability of the synthesized architecture. Results on a set of industrial designs and MCNC benchmark examples show the feasibility of achieving routability with minimum performance penalty when a large number of faults are present in the channel
Keywords :
fault tolerant computing; field programmable gate arrays; logic design; logic testing; network routing; programmable logic arrays; FPGAs; channel routing algorithm; fault-tolerance; interconnect delays; programmable interconnects; routability; Delay; Electric resistance; Fault tolerance; Field programmable gate arrays; Joining processes; Logic arrays; Logic programming; Pins; Programmable logic arrays; Routing;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.475125
Filename :
475125
Link To Document :
بازگشت