Abstract
Interconnect resource(IR) test is one of the most crucial parts in Field Programmable Gate Arrays(FPGA ) test. The Ford-Fulkerson algorithm of graph theory has already been applied in FPGA IRs testing. However, with the expansion of the FPGA scale, the efficiency of the Ford-Fulkerson algorithm is reduced. This paper improves the Ford-Fulkerson algorithm by dividing the FPGA IRs into three graphs, the horizontal graph, the vertical one and the oblique one, which reduces the algorithm complexity in large-scale FPGAs. This improved algorithm has been verified on mathematic model of XC5V110T FPGA IRs. Compared to the previous test methods, the efficiency of this improved algorithm has raised by 8 times.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
