Recent Developments in the Theory and Practice of Testable Logic Design*

This paper surveys and summarizes the major contributions to the theory and practice of testable logic design. The first part, dealing with the theoretical procedures, discusses the design of easily testable combinational, sequential, and iterative networks, illustrating major techniques with common running examples. The second part comments on the more practical aspects such as board layout, test point siting, and other facilities for easing the problems associated with testing.

[1]  Edward P. Hsieh,et al.  Checking Experiments ror Sequential Machines , 1971, IEEE Transactions on Computers.

[2]  Kozo Kinoshita,et al.  Sequential Machines Capable of Fault Diagnosis , 1970, IEEE Transactions on Computers.

[3]  Gernot Metze,et al.  A New Representation for Faults in Combinational Digital Circuits , 1972, IEEE Transactions on Computers.

[4]  Arthur D. Friedman,et al.  Test Point Placement to Simplify Fault Detection , 1974, IEEE Transactions on Computers.

[5]  William C. Carter,et al.  A Simple Self-Testing Decoder Checking Circuit , 1971, IEEE Transactions on Computers.

[6]  F. C. Hennine.  Fault detecting experiments for sequential circuits , 1964, SWCT 1964.

[7]  R. Dandapani,et al.  On the Design of Logic Networks with Redundancy and Testability Considerations , 1974, IEEE Transactions on Computers.

[8]  Sudhakar M. Reddy,et al.  A Design Procedure for Fault-Locatable Switching Circuits , 1972, IEEE Transactions on Computers.

[9]  Daniel Eugene Farmer.  Fault-detection experiments for sequential machines , 1970 .

[10]  John P. Robinson,et al.  An Investigation into Redundancy and Testability of Combinational Logic Networks. , 1970 .

[11]  Zvi Kohavi,et al.  Checking experiments for sequential machines , 1974, Inf. Sci..

[12]  Sudhakar M. Reddy,et al.  On Minimally Testable Logic Networks , 1974, IEEE Transactions on Computers.

[13]  Arthur D. Friedman.  Fault Detection in Redundant Circuits , 1967, IEEE Trans. Electron. Comput..

[14]  Arthur D. Friedman,et al.  Fault Detection in Iterative Logic Arrays , 1971, IEEE Transactions on Computers.

[15]  SUDHAKAR M. REDDY,et al.  Easily Testable Realizations ror Logic Functions , 1972, IEEE Transactions on Computers.

[16]  Arthur D. Friedman,et al.  Restricted Checking Sequences for Sequential Machines , 1973, IEEE Transactions on Computers.

[17]  Stephen S. Yau,et al.  Design of Diagnosable Iterative Arrays , 1971, IEEE Transactions on Computers.

[18]  Ben Bennetts,et al.  Fault Diagnosis of Digital Systems - a Review , 1971, Computer.

[19]  Zvi Kohavi,et al.  Design of Sequential Machines with Fault-Detection Capabilities , 1967, IEEE Trans. Electron. Comput..

[20]  Zvi Kohavi,et al.  Machine Distinguishing Experiments , 1973, Comput. J..

[21]  Arthur D. Friedman,et al.  Fault detection in digital circuits , 1971 .

[22]  Tadao Takaoka,et al.  N-Fail-Safe Logical Systems , 1971, IEEE Transactions on Computers.

[23]  SUDHAKAR M. REDDY,et al.  Easily Testable Cellular Realizations for the (Exactly P)-out-of n and (p or More)-out-of n Logic Functions , 1974, IEEE Transactions on Computers.

[24]  Kolar L. Kodandapani.  A Note on Easily Testable Realizations for Logic Functions , 1974, IEEE Transactions on Computers.

[25]  John P. Hayes.  On Modifying Logic Networks to Improve Their Diagnosability , 1974, IEEE Transactions on Computers.

[26]  Yoshihiro Tohma,et al.  Realization of Fail-Safe Sequential Machines by Using a k-out-of-n Code , 1971, IEEE Transactions on Computers.

[27]  C. E. Holborow.  An Improved Bound on the Length of Checking Experiments for Sequential Machines with Counter Cycles , 1972, IEEE Transactions on Computers.

[28]  Ben Bennetts.  A realistic approach to detection test generation for combinatorial logic circuits , 1972, Comput. J..

[29]  Daniel E. Farmer,et al.  Algorithms ror Designing Fault-Detection Experiments ror Sequential Machines , 1973, IEEE Transactions on Computers.

[30]  William H. Kautz.  Testing for Faults in Combinational Cellular Logic Arrays , 1967, SWAT.

[31]  James B. Angell,et al.  Enhancing Testability of Large-Scale Integrated Circuits via Test Points and Additional Logic , 1973, IEEE Transactions on Computers.

[32]  Zvi Kohavi,et al.  Detection of Multiple Faults in Combinational Logic Networks , 1972, IEEE Transactions on Computers.

[33]  R. Bennetts.  On the Analysis of Fault Trees , 1975, IEEE Transactions on Reliability.

[34]  Arthur D. Friedman,et al.  Easily Testable Iterative Systems , 1973, IEEE Transactions on Computers.

[35]  Charles R. Kime,et al.  Structural Factors in the Fault Diagnosis of Combinational Networks , 1971, IEEE Transactions on Computers.

[36]  Attila Tóth,et al.  Automated database-driven digital testing , 1974, Computer.

[37]  Kozo Kinoshita,et al.  Design of Diagnosable Sequential Machines Utilizing Extra Outputs , 1974, IEEE Transactions on Computers.

[38]  Amar Mukhopadhyay,et al.  Minimization of Exclusive or and Logical Equivalence Switching Circuits , 1970, IEEE Transactions on Computers.

[39]  Sheldon B. Akers,et al.  A Modification of Lee's Path Connection Algorithm , 1967, IEEE Trans. Electron. Comput..