Optimized Synthesis of Self-Testable Finite State Machines (FSM) Using BIST-PST Structures in Altera Structures

The testing of PCBs containig ASICs, e.g., Altera FPGA is an important problem which needs consideration. One of the ideas of solving this problem is using BIST architecture for each ASIC. With the use of built-in testers, the additional cost, in the form of overhead of macrocells is added. A certain idea of built-in tester structures is BIST-PST [1]. The disadventage of this idea is, that the FSM memory block in form of MISR with a given characteristic polynomial may be realized only in form of: IE-MISR and EE-MISR. In our paper, the new kind of MISR registers consisting of D and T flip-flops has been used in BIST-PST. They make it possible for a given characteristic polynomial to achieve a wide range of possible realizations of MISR type memory block, ranging from tens to thousands. In effect, it is possible to choose the minimal excitation function saving a considerable number of Altera FPGA macrocells.

[1]  Edward A. Lee,et al.  Scheduling dynamic dataflow graphs with bounded memory using the token flow model , 1993, 1993 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[2]  Gilles Kahn,et al.  The Semantics of a Simple Language for Parallel Programming , 1974, IFIP Congress.

[3]  Edward A. Lee,et al.  Software Synthesis from Dataflow Graphs , 1996 .

[4]  Thomas Martyn Parks,et al.  Bounded scheduling of process networks , 1996 .

[5]  Hans-Joachim Wunderlich,et al.  Optimized synthesis of self-testable finite state machines , 1990, [1990] Digest of Papers. Fault-Tolerant Computing: 20th International Symposium.

[6]  Edward A. Lee,et al.  Static Scheduling of Synchronous Data Flow Programs for Digital Signal Processing , 1989, IEEE Transactions on Computers.