Abstract
The relationships between redundant logic and don't care conditions in combinational circuits are well known. Redundancies in a combinational circuit can be explicitly identified using test generation algorithms or implicitly eliminated by specifying don't cares for each gate in the combinational network and minimizing the gates, subject to the don't care conditions.
In this article, we explore the relationships between redundant logic and don't care conditions in sequential circuits. Stuck-at faults in a sequential circuit may be testable in the combinational sense, but may be redundant because they do not alter the terminal behavior of a nonscan sequential machine. These sequential redundancies result in a faulty State Transition Graph (STG) that is equivalent to the STG of the true machine.
We present a classification of redundant faults in sequential circuits composed of single or interacting finite state machines. For each of the different classes of redundancies, we define don't care sets which if optimally exploited will result in the implicit elimination of any such redundancies in a given circuit. We present systematic methods for the exploitation of sequential don't cares that correspond to sequences of vectors that never appear in cascaded or interacting sequential circuits. Using these don't care sets in an optimal sequential synthesis procedure of state minimization, state assignment, and combinational logic optimization results in fully testable lumped or interacting finite state machines. We present experimental results which indicate that medium-sized irredundant sequential circuits can be synthesized with no area overhead and within reasonable CPU times by exploiting these don't cares.
Similar content being viewed by others
References
K. Bartlett, R.K. Brayton, G.D. Hachtel, R.M. Jacoby, C.R. Morrison, R.L. Rudell, A. Sangiovanni-Vincentelli, and A.R. Wang, “Multilevel logic minimization using implicit don't cares,” IEEE Trans. on CAD, 7: 723–740, June 1988.
D. Brand, “Redundancy and don't cares in logic synthesis,” IEEE Trans. on Computers, C-32: 947–952, October 1983.
R. Brayton, R. Rudell, A. Sangiovanni-Vincentelli, and A. Wang, “MIS: A multiple-level logic optimization system,” IEEE Trans. on CAD, 6: 1062–1081, November 1987.
R.K. Brayton and F. Somenzi, “Boolean relations and the incomplete specification of logic networks,” Proc. VLSI 89, August 1989.
S. Devadas, H-K.T. Ma, and A.R. Newton, “Easily testable PLA-based finite state machines,” Proc. 19th Fault Tolerant Comput. Symp., pp. 102–109, June 1989.
S. Devadas, H-K.T. Ma, and A.R. Newton, and A. Sangiovanni-Vincentelli, “Irredundant sequential machines via optimal logic synthesis,” IEEE Trans. on CAD 9, January 1990.
S. Devadas, H-K.T. Ma, A.R. Newton, and A. Sangiovanni-Vincentelli, “Mustang: state assignment of finite state machines targeting multilevel logic implementations,” IEEE Trans. on CAD, 7: 1290–1300, December 1988.
S. Devadas, H-K.T. Ma, A.R. Newton, and A. Sangiovanni-Vincentelli, “A synthesis and optimization procedure for fully and easily testable sequential machines,” IEEE Trans. on CAD, 8:1100–1107, October 1989.
P. Goel, “An implicit enumeration algorithm to generate tests for combinational logic circuits,” IEEE Trans. on Computers, 0–30:215–222, March 1981.
H-K.T. Ma, S. Devadas, A.R. Newton, and A. Sangiovanni-Vincentelli, “Test generation for sequential circuits,” IEEE Trans. on CAD, 7: 1081–1093, October 1988.
M.C. Paull and S.H. Unger, “Minimizing the number of states in incompletely specified sequential circuits,” IRE Trans. on Electron. Comput., EC-8: 356–357, September 1959.
J.P. Roth, “Diagnosis of automata failures: a calculus and a method,” IBM jour. Res. Develop., pp. 278–291, July 1966.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Devadas, S., Ma, HK.T. & Newton, A.R. Redundancies and don't cares in sequential logic synthesis. J Electron Test 1, 15–30 (1990). https://doi.org/10.1007/BF00134012
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00134012