Synthesis of Self-Testable Sequential Logic Using Programmable Cellular Automata
S. Misra, B. Mitra, Sharmila Sengupta, P.P. Chaudhuri · 2005
We introduce the concept of programmable cellular automata (PCA) and present a procedure for synthesis of Finite State Machines (FSM) using PCA. Designs synthesised using this scheme are very effecient in terms of area and speed performance, while being very regular, and self-testable. We present some impressive results obtained by using this scheme on the MCNC benchmarks.