Testing of Synchronous Sequential Circuits By Dr. Amin Danial Asham

References An Introduction to Logic Circuit Testing

Transfer Tree It is often necessary to take the circuit into a predetermined state, after the homing sequence has been applied. This is done with the help of a transfer sequence, which is the shortest input sequence that takes a machine from state S i to state S j. Example: for the following machine: we want to drive the it from state B to state C. Shortest path is the input sequence 00

Designing checking Experiments Basically, the purpose of a checking experiment is to verify that the state table of a sequential circuit accurately describes its behavior. If during the execution of the experiment the circuit produces a response that is different from the correctly operating circuit, the circuit is definitely faulty. Such experiments can be used only to determine whether or not something is wrong with a circuit; it is not possible to conclude from these experiments what is wrong with the circuit. A checking experiment can be designed for: 1.A strongly connected sequential circuit 2.There is it at least one distinguishing sequence.

Designing checking Experiments The checking experiment can be divided into three phases: 1.Initialization phase. During the initialization phase, the circuit under test is taken from an unknown initial state to a fixed state by the following method: a.Apply a homing sequence to the circuit and identify the current state of the circuit. b.If the current state is not the desired state, apply a transfer sequence to move the circuit from the current state to the desired state. 2.State identification phase: During this phase, an input sequence is applied so as to cause the circuit to visit each of its states and display its response to the distinguishing sequence. 3.Transition verification phase. During this phase, the circuit is made to go through every state transition; each state transition is checked by using the distinguishing sequence.

Although these three phases are distinct, in practice, the subsequences for state identification and transition verification are combined whenever possible in order to shorten the length of the experiment. The length is the total number of input symbols applied to the circuit during the execution of an experiment; it is a measure of efficiency of the experiment. Designing checking Experiments (continue )

Example Consider FSM Successor Tree (ABCD) 0 (BC) 1 (AB) 0 1 (AD) 1 (AC) 0 (B) 1 (A) 0 (AB) (D) 1 (A) 0 (D) 1 (C) 0 Distinguishing (BC) 1 (B) 1 (B) 0 (A) 1 (C) 0 (AC) Therefore, sequence 01 is HS and DS

Example (cont.) 1.Initialization phase: Response Table Init. StateResponse to 0 1Final StateOutput Sequence AB, 1D,1D1 BA, 0C, 0C0 CB, 0D, 1D0 1 DC, 1A, 0A1 0

Example (cont.) 2.Identification Phase: Time Input State Output A D A B C D A

Example (cont.) 3.Transition Verification Phase: Input State Output A B C B C A D A D C D A C D A B D A B A D A All Possible Transitions

Thanks