@inproceedings{5c0854620dba44bd89d66e918b519b98,
title = "New techniques for selecting test frequencies for linear analog circuits",
abstract = "In this paper we show that the problem of minimizing the number of test frequencies necessary to detect all possible faults in a multi-frequency test approach for linear analog circuits can be modeled as a set covering problem. We will show in particular, that under some conditions on the considered faults, the coefficient matrix of the problem has the strong consecutive-ones property and hence the corresponding set covering problem can be solved in polynomial time. For an efficient solution of the problem, an interval graph formulation is also used and a polynomial algorithm using the interval graph structure is suggested. The optimization of test frequencies for a case-study biquadratic filter is presented for illustration purposes. Numerical simulations with a set of randomly generated problem instances demonstrate two different implementation approaches to solve the optimization problem very fast, with a good time complexity.",
keywords = "Analog circuit testing, Consecutive-ones property, Interval graphs, Linear programming, Set covering problem",
author = "Mohand Bentobache and Ahcene Bounceur and Reinhardt Euler and Yann Kieffer and Salvador Mir",
year = "2013",
doi = "10.1109/VLSI-SoC.2013.6673256",
language = "English",
isbn = "9781479905249",
series = "IEEE/IFIP International Conference on VLSI and System-on-Chip, VLSI-SoC",
publisher = "IEEE Computer Society",
pages = "90--95",
booktitle = "2013 IFIP/IEEE 21st International Conference on Very Large Scale Integration, VLSI-SoC 2013 - Proceedings",
address = "United States",
}