Cellular Automata with Large Channel Separations

A New, Fast Pseudo-Random Pattern Generator for Advanced Logic Built-In Self-Test Structures

“…Let us denote Ψ as the minimum guaranteed phase shift between binary sequences produced at outputs of any TPG applicable for the STUMPS architecture. Results from Table 1 demonstrate that a single DT-LFSR register used as a pseudo-random TPG enables a pretty high level of phase shift that is much more than the one achieved by means of the methods disclosed in [13,34,35,39].…”

“…The phase shift between binary bitstreams supplied to individual scan paths is also referred to as the separation factor between data channels or between scan paths' content [3] (pp. 184-188), [13,14,34,37,39].…”

“…Please note that in cases when the presumed offset Θ is known, Table 2 makes it possible to find out 𝑛 and 𝑡 parameters of the appropriate DT-LFSR register to enable designing of a TPG that is able to supply test sequences to any number of scan paths, or at least as many as practicable. 15 6.21×10 14 3.11×10 14 1.55×10 14 7.76×10 13 3.88×10 13 12 59 60 1.53×10 14 7.63×10 13 3.82×10 13 1.91×10 13 9.54×10 12 4.77×10 12 13 59 68 3.91×10 16 1.95×10 16 9.77×10 15 4.89×10 15 2.44×10 15 1.22×10 15 14 62 63 1.16×10 15 5.81×10 14 2.91×10 14 1.45×10 14 7.26×10 13 3.63×10 13 15 62 71 2.98×10 17 1.49×10 17 7.44×10 16 3.72×10 16 1.86×10 16 9.30×10 15 16 65 71 2.84×10 17 1.42×10 17 7.09×10 16 3.55×10 16 1.77×10 16 8.87×10 15 17 65 81 2.91×10 20 1.45×10 20 7.27×10 19 3.63×10 19 1.82×10 19 9.08×10 18 18 70 79 6.75×10 19 3.37×10 19 1.69×10 19 78 95 3.97×10 24 1.98×10 24 9.92×10 23 4.96×10 23 2.48×10 23 1.24×10 23 22 84 95 3.68×...…”

“…Please note that when the phase shift Θ is as high as tens of trillions of clock cycles, it is also possible to find a DT-LFSR register with appropriate n and t parameters to use it as the basis to design a DT-LFSR-TPG structure capable of feeding any number of scan paths. 13 5.00×10 12 5.00×10 11 5.00×10 10 5.00×10 9 5.00×10 8 50,025,068 5,002,506 500,250 14 62 1.49×10 12 1.49×10 11 1.49×10 10 1.49×10 9 1.49×10 8 14876406 1,487,640 148,764 14,876 15 62 3.81×10 14 3.81×10 13 3.81×10 12 3.81×10 11 3.81×10 10 3.81×10 9 3.81×10 8 38,083,600 3,808,360 16 65 3.63×10 14 3.63×10 13 3.63×10 12 3.63×10 11 3.63×10 10 3.63×10 9 3.63×10 8 36,325,896 3,632,589 17 65 3.72×10 17 3.72×10 16 3.72×10 15 3.72×10 14 3.72×10 13 3.72×10 12 3.72×10 11 3.72×10 10 3.72×10 9 18 70 8.64×10 16 8.64×10 15 8.64×10 14 8.64×10 13 8.64×10 12 8.64×10 11 8.64×10 10 8.64×10 9 8.64×10 8 19 71 2.72×10 18 2.72×10 17 2.72×10 16 2.72×10 15 2.72×10 14 2.72×10 13 2.72×10 12 2.72×10 11 2.72×10 10 20 74 2.09×10 19 2.09×10 18 2.09×10 17 2.09×10 16 2.09×10 15 2.09×...…”

“…[65][66][67][68][69][70][71][176][177], although Cellular Automata (CA) can also be used for these purposes [3] (pp. 72-75), [10][11][12][13]. Some specific solutions may also comprise other types of linear registers such as PRPG modules, for instance Galois Linear Feedback Shift Register (GLFSR) [14][15][16].…”