Publication detail

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

KOTÁSEK, Z. RŮŽIČKA, R.

Original Title

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

Type

article in a collection out of WoS and Scopus

Language

English

Original 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

Authors

KOTÁSEK, Z.; RŮŽIČKA, R.

Released

1. 1. 2000

Publisher

unknown

Location

Košice-Herľany

ISBN

80-88922-25-9

Book

Proc. of the Fourth International Scientific Conference on Electronic Computers and Informatics

Pages from

177

Pages to

182

Pages count

6

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"
}