Cellular automata based synthesis of easily and fully testable FSMs
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
A Tutorial on Built-in Self-Test. I. Principles
IEEE Design & Test
IEEE Transactions on Computers
Development of combinational circuits using non-uniform cellular automata: initial results
Proceedings of the 11th Annual conference on Genetic and evolutionary computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
| Hi-index | 0.01 |
Characterization of a special class of nongroup CA termed as D1*CA has been proposed previously (1993) along with its application for synthesis of easily testable FSM. This paper extends application of the D1*CA as an ideal test machine for testing combinational logic (CL) blocks and registers of a circuit. Such a test machine can be conveniently embedded in the data path synthesis phase around the function realized by a CL block and the register feeding the input data to the CL. In the normal mode of operation, the register and the CL realize the intended function. During testing, the D1*CA runs in autonomous mode generating the test vectors and also accumulating test responses. It is sufficient to observe the response only from the leftmost CA cell with aliasing error probability approaching zero value. Experiments conducted on CL benchmarks confirm 100% fault coverage of all stuck-at faults in CL and its associated lines. It does not incur any test generation and test application overheads. Further, test parallelism can be achieved through simultaneous testing of multiple combinational modules in a chip. The scheme provides a cost effective alternative to scan path.