A Novel Scheme for Synthesis of Easily Testable Finite State Machines Using Cellular Automata
S. Misra, B. Mitra, P.P. Chaudhuri · 2005
In this paper, we have presented a novel srheme for synthesizing easily testable finite state machines (FSM) using local neighbourhood additive cellular automata (CA). A new state assignment strategy has been proposed. Designs synthesized using this scheme are found to be ef$cient in terms of area and speed performance, while being very regular and easily testable. A test model based on sharing of test structures has been used for testing the synthesized designs. Using this model reduction of BIST (Built-In Sey Est) overhead is possible without sacripcing test quality. Thi;? is confirmed through experimental results.