On the complexity of sequential testing in configurable FPGAs

This paper addresses the issues pertaining to testing field programmable gate arrays (FPGAs) using an array-based technique. In particular, the issues of testing configurable devices (such as multiplexers and flip-flops) in the sequential array process (as the most significant factor for assessing complexity) and the arrangement for pipelining test vectors are treated in detail. Initially testing procedures for a configurable flip-flop and a programmable multiplexer are presented. At system-level, two new pipeline arrangements referred to as the quasi-pipeline and normal pipeline structures are proposed for reducing the number of programming phases. The application of the proposed approaches to the XC4000 FPGA family is also presented.

[1]  Ping Chen,et al.  Evaluation of FPGA Resources for Built-In Self-Test of Programmable Logic Blocks , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.

[2]  Fabrizio Lombardi,et al.  An approach for testing programmable/configurable field programmable gate arrays , 1996, Proceedings of 14th VLSI Test Symposium.

[3]  Fabrizio Lombardi,et al.  On an improved design approach for C-testable orthogonal iterative arrays , 1988, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[4]  Fabrizio Lombardi,et al.  Diagnosing Programmable Interconnect Systems for FPGAs , 1996, Fourth International ACM Symposium on Field-Programmable Gate Arrays.

[5]  Edward J. McCluskey,et al.  Logic design principles - with emphasis on testable semicustom circuits , 1986, Prentice Hall series in computer engineering.

[6]  William H. Kautz,et al.  Testing for Faults in Wiring Networks , 1974, IEEE Transactions on Computers.