VLSI Design

VLSI Design / 2010 / Article / Tab 1

Research Article

An Approach for Implementing State Machines with Online Testability

Table 1

Example FSM transition table and resulting output equations.

Present stateInputsNext stateOutputs
R3R2R1R 0X1X0Q3Q2Q1Q0F1F 0

110000110001
01101000
10001101
11010111

101000011011
01010110
10001111
11100100

100100110001
01110000
10100110
11100110

011000010101
01011011
10011011
11110010

010100100110
01001100
10010111
11100111

001100110010
01101001
10011001
11010100

F0=  R3R2  (X1+X̅1X̅0)+R3R1  (X̅0)+R3Ro  (X̅1X̅0)+R2R1  (X̅1+X1X̅0)+R2R0  (X1)+R1R0  (X1X̅0+X̅1X0)

F1=  R3R2  (X1X0)+R3R1(X̅1  +  X1X̅0)+R3R0(X1)+R2R1(X1+X̅1X0)+  R2R0  (X1+X̅1X̅0)  +  R1R0(X̅1X̅0)

Article of the Year Award: Outstanding research contributions of 2020, as selected by our Chief Editors. Read the winning articles.