This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Design of Testable Structures Defined by Simple Loops
November 1981 (vol. 30 no. 11)
pp. 875-884
J.A. Abraham, Coordinated Science Laboratory, University of Illinois
A methodology is given for generating combinational structures from high-level descriptions (using assignment statements, "if" statements, and single-nested loops) of register-transfer (RT) level operators. The generated structures are cellular, and are interconnected in a tree structure. A general algorithm is given to test cellular tree structures with a test length which grows only linearly with the size of the tree. It is proved that this test length is optimal to within a constant factor. Ways of making the structures self-checking are also indicated.
Index Terms:
tree structures, Design automation, recurrences, register-transfer-level descriptions, self-checking, testing
Citation:
J.A. Abraham, D.D. Gajski, "Design of Testable Structures Defined by Simple Loops," IEEE Transactions on Computers, vol. 30, no. 11, pp. 875-884, Nov. 1981, doi:10.1109/TC.1981.1675718
Usage of this product signifies your acceptance of the Terms of Use.