B103 Hierarchical Cellular Automata Model for VLSI Testing(Session : Computer Science)

概要

論文の詳細を見る
In recent years, the Cellular Automata (CA) technology has been gaining wider acceptance in various fields-image processing, language recognition, pattern recognition, VLSI testing, study of fractals and chaos, etc. The user community look forward for higher versatility and robustness of CA based models employed to study hierarchical systems. In this context, this paper introduces a new concept of Hierarchical Cellular Automata (HCA). Theory of HCA is developed over the Galois extension field GF (2^<P^<q^<r^<・・>>>>), where each HCA cell can store a symbol from the set {0, 1, 2, …, 2^<pqr-1>}. The potential application of HCA has been demonostrated for test solution of VLSI circuits specified in hierarchical structural description. The test solution is designed to meet the test requirements of the circuit by exploiting its structural dependencies.
一般社団法人日本機械学会の論文
2001-11-14