• 検索結果がありません。

[PDF] Top 20 C64 2000 12 ATS 最近の更新履歴 Hideo Fujiwara

Has 10000 "C64 2000 12 ATS 最近の更新履歴 Hideo Fujiwara" found on our website. Below are the top 20 most common "C64 2000 12 ATS 最近の更新履歴 Hideo Fujiwara".

C64 2000 12 ATS 最近の更新履歴  Hideo Fujiwara

C64 2000 12 ATS 最近の更新履歴 Hideo Fujiwara

... In case that both these heuristics cannot justify or prove unjustifiable the sensitized propagation path, the backward justification performs heuristics BJ1* and BJ2* [r] ... 完全なドキュメントを参照

8

C65 2000 12 ATS 最近の更新履歴  Hideo Fujiwara

C65 2000 12 ATS 最近の更新履歴 Hideo Fujiwara

... Given a scheduled data flow graph and a module assignment, we assign variables to registers, such that the area overhead required for a strongly self-testable data pat[r] ... 完全なドキュメントを参照

6

C63 2000 12 ATS 最近の更新履歴  Hideo Fujiwara

C63 2000 12 ATS 最近の更新履歴 Hideo Fujiwara

... One of our future works is to introduce concurrent BIST to reduce test application time. Acknowledgments This work was supported in part by Semiconductor Tech- nology Academic Research Center (STARC) under the Re- search ... 完全なドキュメントを参照

6

C62 2000 12 ATS 最近の更新履歴  Hideo Fujiwara

C62 2000 12 ATS 最近の更新履歴 Hideo Fujiwara

... Theorem 1[3] If a sequential circuit S is an internally balanced structure, S allows test generation with combinational test generation complexity. However, each fault on a separable primary input x in S corresponds to a ... 完全なドキュメントを参照

6

J78 j IEICE 2000 1 最近の更新履歴  Hideo Fujiwara J78 j IEICE 2000 1

J78 j IEICE 2000 1 最近の更新履歴 Hideo Fujiwara J78 j IEICE 2000 1

... 1 プロトコルが提案されていた( n:プロセッサ数) .本論文では ,同期時 間 12n 無待機時計合せプ ロトコルを提案する.また,無待機時計合せプロトコル同期時間下界が n − 1 であることを証明し ,本論文で提案するプ ロト コルが 同期時間に 関し てオーダ 的に ... 完全なドキュメントを参照

11

J84 e JETTA 2000 10 最近の更新履歴  Hideo Fujiwara J84 e JETTA 2000 10

J84 e JETTA 2000 10 最近の更新履歴 Hideo Fujiwara J84 e JETTA 2000 10

... In this paper, we present a new non-scan DFT method for controller circuits of VLSIs which guaran- tees complete fault efficiency. In general, a controller valid states. Moreover, in order to observe responses of the ... 完全なドキュメントを参照

14

J85 e JETTA 2000 10 最近の更新履歴  Hideo Fujiwara J85 e JETTA 2000 10

J85 e JETTA 2000 10 最近の更新履歴 Hideo Fujiwara J85 e JETTA 2000 10

... S832 23 996 1012 23 86.7 12.5 S1488 14 1916 1924 12 91.7 11.11 S1494 14 1926 1952 11 90.8 12.79 In Table 1, we report the results obtained for config- urable LFSR-based TPG synthesis. For each ... 完全なドキュメントを参照

8

C55 2000 1 ASPDAC 最近の更新履歴  Hideo Fujiwara

C55 2000 1 ASPDAC 最近の更新履歴 Hideo Fujiwara

... plans at RTL, where a test plan is a control sequence to prop- agate test patterns from the primary inputs to the inputs of the respective hardware elements and to propagate responses from the output of the respective ... 完全なドキュメントを参照

6

12 WRTLT pptx 最近の更新履歴  Hideo Fujiwara

12 WRTLT pptx 最近の更新履歴 Hideo Fujiwara

... 36 Consider SR-equivalent circuit C 2 . If we assign 8 flip-flops from FF1 to FF8 to the secret register, the contents of the secret register appear at the output because OUT@15 = FF1@0, OUT@14 = FF2@0, OUT@13 = FF3@0, ... 完全なドキュメントを参照

40

Game12 最近の更新履歴  yyasuda's website

Game12 最近の更新履歴 yyasuda's website

... sale, Jerry is willing to pay no more than $1000. The second kind of equilibrium features t·ade of both the lemon and the peach. That is, Jerry selects T and Freddie plays the strategy TPTL. In order for this equilibrium ... 完全なドキュメントを参照

2

J79 j IEICE 2000 2 最近の更新履歴  Hideo Fujiwara J79 j IEICE 2000 2

J79 j IEICE 2000 2 最近の更新履歴 Hideo Fujiwara J79 j IEICE 2000 2

... ,もと 演算間経路は共有し た演算器を通るループ となる. よって ,その演算間経路上にあるいずれか変数は ループ を切断するため スキャンレジ スタに 割り当て なければ なら ない .両立可能な 演算間 経 路 長さ , すなわちその経路上にある変数数が 大きければ ,そ うちいずれか ... 完全なドキュメントを参照

11

C231 2010 12 APCCAS 最近の更新履歴  Hideo Fujiwara

C231 2010 12 APCCAS 最近の更新履歴 Hideo Fujiwara

... • More test resources are given to the upper layer (i.e. layer 2) in order to increase the scheduling flexibility, which would result in a more thermal-efficient test schedule. This is based on our earlier observation on ... 完全なドキュメントを参照

4

J81 e IEICE 2000 8 最近の更新履歴  Hideo Fujiwara J81 e IEICE 2000 8

J81 e IEICE 2000 8 最近の更新履歴 Hideo Fujiwara J81 e IEICE 2000 8

... In a reliable broadcast model, if and only if some process broadcasts an update message in a write operation execution, all correct processes receive the update message.. This does not d[r] ... 完全なドキュメントを参照

11

C54 2000 1 VLD 最近の更新履歴  Hideo Fujiwara

C54 2000 1 VLD 最近の更新履歴 Hideo Fujiwara

... It is shown that sequential circuits can be classified by their structure as follows: {sequential circuits of acyclic structure} ⊃ {sequential circuits of internally balanced structur[r] ... 完全なドキュメントを参照

6

J82 j IEICE 2000 9 最近の更新履歴  Hideo Fujiwara J82 j IEICE 2000 9

J82 j IEICE 2000 9 最近の更新履歴 Hideo Fujiwara J82 j IEICE 2000 9

... は ,核回路が 組合せ回路となるので 組合せ回路用テ スト 生成アルゴ リズムでテ スト 生成が 可能( 以下,組 † 奈良先端科学技術大学院大学情報科学研究科,生駒市 Graduate School of Information Science, Nara Institute of Science and Technology, Ikoma-shi, 630–0101 Japan †† ... 完全なドキュメントを参照

10

C57 2000 9 WRTLT 最近の更新履歴  Hideo Fujiwara

C57 2000 9 WRTLT 最近の更新履歴 Hideo Fujiwara

... On the other hand, in the partial scan design based on balanced structure, the minimum number of scan registers is five, e.g., the set of registers to be scanned is {b,c,e, f , k}. When the kernel is made an ... 完全なドキュメントを参照

7

C56 2000 5 ETW 最近の更新履歴  Hideo Fujiwara

C56 2000 5 ETW 最近の更新履歴 Hideo Fujiwara

... Many indirect implications can be easily derived during static learning, while high level recursive learning has to be applied to find them during branch and bound search2[r] ... 完全なドキュメントを参照

2

C59 2000 9 WRTLT 最近の更新履歴  Hideo Fujiwara

C59 2000 9 WRTLT 最近の更新履歴 Hideo Fujiwara

... The hierarchical test generation of a data path consists of the fol- lowing two steps: for individual combinational hardware el- ements, generate test patterns at gate level and generate[r] ... 完全なドキュメントを参照

10

C60 2000 10 ITC 最近の更新履歴  Hideo Fujiwara

C60 2000 10 ITC 最近の更新履歴 Hideo Fujiwara

... International Test Conference, pp.[r] ... 完全なドキュメントを参照

10

C53 2000 1 VLD 最近の更新履歴  Hideo Fujiwara

C53 2000 1 VLD 最近の更新履歴 Hideo Fujiwara

... Control Forest(stage 1): The path used for propagating any test patterns, from a primary input to the input port of a hardware element, is called a control path to the port.. On reducing[r] ... 完全なドキュメントを参照

6

Show all 10000 documents...