TIME FRAME EXPANSION

MODULE 4
From Bhavana V
Can u tell me difference between
Combinational ATPG and Sequential
ATPG?
where, xn-Primary inputs
zn-primary output
yn-present state
zn-next state
Development of Time-Frame Expansion
Methods
First idea of time-frame expansion using the five-valued
logic system was published.
Then, in his 1976 paper Muth [481] explained that a nine-
valued logic was necessary.
Just a year later, Snethen’s paper on SOFTG [613]
advanced the idea of backtrace, meant that the justification
of any signal value must be carried out only at primary
inputs.
Backtrace was used by Goel [258] to create a beautiful
algorithm (PODEM) for combinational circuits.
Thereafter, combinational circuit ATPG became quite
practical.
When applied to sequential circuit time-frames, the
complexity of this procedure increases very rapidly.
 2 reasons
Number of time frames increases, number of primary input
increases.

Fault effect may have to be propagated through several

time-frames before reaching primary output.

• .

Marlett proposed [432, 433] a solution for the

problems mentioned above.
Chegg then innovates the BACK algorithm
Time –Frame Expansion
Example
NINE Valued Logic
Example
 Challenges in Sequential ATPG
•Flipflop states are uncontrollable and unobservable.
Basically has unknown initial states.

•Large memory space required.

•Low fault coverage

Sequential ATPG are lot more complex

than combinational ATPG.