作者: H. Michinishi , T. Yokohira , T. Okamoto , T. Inoue , H. Fujiwara
关键词:
摘要: In this paper we consider testing for programmable interconnect structures of look-up table based FPGAs. The structure considered in the consists interconnecting wires and points (switches) to join them. As fault models, stuck-at faults wires, extra-device missing-device are considered. We heuristically derive test procedures then show their validness complexity.