Isomorph-redundancy in sequential circuits

Citation
Dk. Das et al., Isomorph-redundancy in sequential circuits, IEEE COMPUT, 49(9), 2000, pp. 992-997
Citations number
20
Categorie Soggetti
Computer Science & Engineering
Journal title
IEEE TRANSACTIONS ON COMPUTERS
ISSN journal
00189340 → ACNP
Volume
49
Issue
9
Year of publication
2000
Pages
992 - 997
Database
ISI
SICI code
0018-9340(200009)49:9<992:IISC>2.0.ZU;2-O
Abstract
Design of irredundant and fully testable nonscan sequential circuits is a m ajor concern of logic synthesis. as the presence of undetectable faults may render an ATPG intractable. This paper outlines some intriguing properties of isomorph faults, which are sequentially undetectable as well as redunda nt. An isomorph fault in a sequential circuit makes the state diagram of th e faulty machine identical to that of the fault-free machine under certain renaming of states. Examples of reduced sequential machines whose circuit r ealization is combinationally irredundant, but isomorph-redundant, are hard to construct and very little is known about them. In this paper, many curi ous examples of such sequential circuits are presented wherein a single stu ck-at fault causes isomorphic faulty machines. An infinite family of such c ircuits may, in fact, be constructed. It is shown that even two-level irred undant circuits obtained by synthesis tools may admit isomorph-redundancy u nder multiple stuck-at faults. Various classifications and related properti es of isomorph faults are also reported. These results reveal new insight a nd understanding of redundancy in sequential circuits.