Survey of the algorithms in the column-matching BIST method
Petr Fišer, Hana Kubátová · 2004
We propose a discussion on possible heuristic algorithms solving the major part of our BIST synthesis method -- the Column Matching. The main part of our BIST design is an output decoder transforming pseudo-random LFSR code words into deterministic tests pre-computed by an ATPG tool. Synthesis of this decoder is based on coupling as many of its outputs with the inputs as possible, which significantly reduces its complexity. This NP-hard problem has to be solved by some heuristic algorithm.