On the testing of multiplexers
Samy Makar, Edward J. McCluskey · 2003
Minimal test sets for different implementations of multiplexer are derived. The length of the minimal test set of any multiplexer is shown to be at least twice the number of data inputs. A set of pseudoexhaustive patterns is derived for different implementation. In all the implementations investigated, the length of the test was only 1.5 times the minimal length. The detectability profile of the different multiplexer implementations are derived. These profiles are used to determine the expected fault coverage of pseudorandom test patterns as a function of the test length. This fault coverage compared with coverage from actual simulations.>