Constant testability of combinational cellular tree structures
- 1 May 1992
- journal article
- design for-testability
- Published by Springer Nature in Journal of Electronic Testing
- Vol. 3 (2) , 139-148
- https://doi.org/10.1007/bf00137251
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Fault detection and design complexity in C-testable VLSI arraysIEEE Transactions on Computers, 1990
- C-Testability of Two-Dimensional Iterative ArraysIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1986
- An Efficient Unsorted VLSI Dictionary MachineIEEE Transactions on Computers, 1985
- A Generalized Dictionary Machine for VLSIIEEE Transactions on Computers, 1985
- Hypertree: A Multiprocessor Interconnection TopologyIEEE Transactions on Computers, 1981
- Design of Testable Structures Defined by Simple LoopsIEEE Transactions on Computers, 1981
- A Testable Design of Iterative Logic ArraysIEEE Transactions on Computers, 1981
- Fault Detection in Bilateral Arrays of Combinational CellsIEEE Transactions on Computers, 1978
- Diagnosis of Faults in Linear Tree NetworksIEEE Transactions on Computers, 1977
- Easily Testable Iterative SystemsIEEE Transactions on Computers, 1973