optimal no of inputs to be given in a test bench

[chetan]

hi all,

lets say there is a system in which there are N -inputs and 1 -
output. lets say N-100 or 1000 etc.

if we want to test it completely we have to give all 2 power N inputs
and examine the functionality which will take more time and impossible
as N goes high.
so my question is how many no of optimum inputs one should give to
test the functionality of such system.

 

[mike]

On Feb 14, 11:30 pm, chetan <chaitanyakurm...@gmail.com> wrote:

hi all,

lets say there is a system in which there are N -inputs and 1 -
output. lets say N-100 or 1000 etc.

if we want to test it completely we have to give all 2 power N inputs
and examine the functionality which will take more time and impossible
as N goes high.
so my question is how many no of optimum inputs one should give to
test the functionality of such system.

3

 

[Andy]

On Feb 16, 2:18 pm, mike <gosenator...@hotmail.com> wrote:

On Feb 14, 11:30 pm, chetan <chaitanyakurm...@gmail.com> wrote:

hi all,

lets say there is a system in which there are N -inputs and 1 -
output. lets say N-100 or 1000 etc.

if we want to test it completely we have to give all 2 power N inputs
and examine the functionality which will take more time and impossible
as N goes high.
so my question is how many no of optimum inputs one should give to
test the functionality of such system.

3

As many as it takes...

Is this a strictly single-input-set to single-output-set problem, or
does this involve sequences of inputs to provide one or a sequence of
outputs?

If we look at monte carlo type analog simulations (somewhat akin to
directed random stimulus) you typically want 100n < t < 10,000n trials
for a reasonable look at a system with n random inputs. But that is
based on variables that have much more than two possible values each.

With more knowledge of the input-output algorithm being tested, more
efficient tests can be determined. Code coverage analysis, in
conjunction with directed random stimulus, can give you some hints
too.

Andy