Abstract
A novel built-in self test architecture for locally controlled cube-type N×N multistage interconnection networks (MINs) is presented. First, a state-based pseudoexhaustive test procedure for this class of MINs is outlined. Then, a labelling algorithm on a binary n-cube is described which generates the necessary inputs for the tests. From the dependence graph of this algorithm a tree architecture is derived which results in a hardware overhead of O(1/log N).
| Original language | English |
|---|---|
| Pages (from-to) | 176-180 |
| Number of pages | 5 |
| Journal | Proceedings of European Design and Test Conference |
| State | Published - 1996 |
| Externally published | Yes |
| Event | Proceedings of the 1996 European Design & Test Conference - Paris, Fr Duration: 11 Mar 1996 → 14 Mar 1996 |