*Q1:

如果一組patterm 為 
01011
 
它最初進入的是0最後是1
那題目說等一組pattern全部輸出後才下一組pattern在進來
 
那五個位置如下
     0  1  2  3  4  
int  0  0  0  0  0
 1   0  0  0  0  0
 2   1  0  0  0  0
 3   0  1  0  0  0
 4   1  0  1  0  0
 5   1  1  0  1  0
 
 6   ?  1  1  0  1
 7   ?  ?  1  1  0
 8   ?  ?  ?  1  1
 9   ?  ?  ?  ?  1
10   ?  ?  ?  ?  ?
 
那問號的地方是零還是壹呢
計算peak power是從1計算到5
還是1到10呢

*A1:

Only the bit trainsitions inside a word is taken into account. So you may assume all the ?
bits are the same as the last bit of the scan pattern


*Q2:

測試檔裡並沒有Constraint file
請問是每題不一樣 還是是不公佈的呢


*A2:

We will ask 智原 whether they will provide cinstraint
files for the test cases. But you may specify the file
of your own for test purpose, since your algorithm
should be general enough for all kind of constraints.

*Q3: (5/15, 2002)

如果
 
第一組 patterm 為 01011 
第二組 pattern 為 11100
 
 
那五個位置如下
     0  1  2  3  4  
int  0  0  0  0  0
 1   0  0  0  0  0
 2   1  0  0  0  0
 3   0  1  0  0  0
 4   1  0  1  0  0
 5   1  1  0  1  0
 
 6   ?  1  1  0  1
 7   ?  ?  1  1  0
 8   ?  ?  ?  1  1
 9   ?  ?  ?  ?  1
 

    根據之前同學問的問題，我們知道 ?=1
 
1.
  請問一下第二組 pattern 進來時
 
  cell 會不會被清成 0，還是會保有上一個 pattern 最後一位進來的值 也就是 1  ?
 
2.
  在計算 each clock cycle 的 peak power 時,  6~9 這五個步驟是否列入考慮 ?
 
3.
  請問一下，在 constrain file 中，judge index 的佔分比重都會一樣嗎 ? 
  
  還是會隨著每個 testbench 而不同 ?

*A3:

1. The same setting is assumed for all input patterns. So you only need to consider
    transistions inside a test vector.
2. So for each vector, the peak power occurs when the last bit is scanned in.
3. They are the same for all benches.


*Q4: (5/15, 2002)

 Please refer to the same question of Q1 in 問題與回答 on the web site.  In
 this example, the pattern 01011 needs 5 cycles to be shifted IN a scan chain
 and another 5 cycles to be shifted OUT the scan chain.  My question is how
 many cycles, 5 or 10, we should take into account when calculating the peak
 power of this pattern.

*A4:

Since your problem is to reduce the peak power, actually it doesn't matter
how many cycles you have to take into account, as long as the number of
transitions is correct.