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).
Originalsprache | Englisch |
---|---|
Seiten (von - bis) | 176-180 |
Seitenumfang | 5 |
Fachzeitschrift | Proceedings of European Design and Test Conference |
Publikationsstatus | Veröffentlicht - 1996 |
Extern publiziert | Ja |
Veranstaltung | Proceedings of the 1996 European Design & Test Conference - Paris, Fr Dauer: 11 März 1996 → 14 März 1996 |