Result Details

The Implementation of RTL Testability Analysis Algorithms trough the Discrete Mathematics Concepts

KOTÁSEK, Z.; RŮŽIČKA, R. The Implementation of RTL Testability Analysis Algorithms trough the Discrete Mathematics Concepts. Proc. of the Fourth International Scientific Conference on Electronic Computers and Informatics. Košice-Herľany: unknown, 2000. p. 177-182. ISBN: 80-88922-25-9.
Type
conference paper
Language
English
Authors
Kotásek Zdeněk, doc. Ing., CSc.
Růžička Richard, doc. Ing., Ph.D., MBA, FEEC (FEEC)
Abstract

In the paper a formal approach to the RT level testability analysis will be presented. It will be shown how the discrete mathematics concepts can be used for the testability analysis. The elements of the circuit are classified into sets according to their function in the design and role during the test application. Then, other sets, relation and mappings are defined to reflect the role of registers and the structure of i path in the circuit. These formal tools are then used to prove the testability of the circuit under analysis.

Keywords

i path, design-for-testability, testability analysis

Published
2000
Pages
177–182
Proceedings
Proc. of the Fourth International Scientific Conference on Electronic Computers and Informatics
ISBN
80-88922-25-9
Publisher
unknown
Place
Košice-Herľany
BibTeX 
@inproceedings{BUT191623,
  author="Zdeněk {Kotásek} and Richard {Růžička}",
  title="The Implementation of RTL Testability Analysis Algorithms trough the Discrete Mathematics Concepts",
  booktitle="Proc. of the Fourth International Scientific Conference on Electronic Computers and Informatics",
  year="2000",
  pages="177--182",
  publisher="unknown",
  address="Košice-Herľany",
  isbn="80-88922-25-9"
}
Projects
Methodology and tools for digital circuits testability analysis, GACR, Standardní projekty, GA102/98/1463, start: 1998-01-01, end: 2006-03-31, completed
Departments
Faculty of Information Technology (FIT)
Back to top