Given the notation used above for sources
and
, we may
express the magnitude estimator in equation 3 as
We plot an example showing numeric approximations to such
distributions in figure 1. In this example, the
mixing parameters are as in the table below, and sources
and
are active.
| source | ||
| 1 | 1.005 | -6.5e-5 |
| 2 | 0.995 | -2.5e-5 |
| 3 | 0.960 | 2.0e-5 |
Each ring seen in the plot corresponds to a particular value of
. When
is near zero, source
(source 1 in this example)
is much stronger than source
(source 2 in this case) and the
mixing parameter estimates lie very near to the mixing parameter
values for source 1, shown with a yellow star. As
increases
toward 1, the rings grow larger in this space. When
, the
rings begin to center on the mixing parameter estimate for source
(source 2 here), and as
grows large, the rings converge
there.
Each point within a given ring in the plot corresponds to a
different value of
, the aforementioned phase offset
between
and
. Here we have used 1000 evenly spaced
values on the range
to simulate a uniform distribution. It
can be seen in the large shape of the rings that
has a
great effect on the estimates generated. We still see general
trends in parameter locations, such as the very high density of
parameter estimates in the region between the two sources' mixing
parameter values. In figure 2, we plot the same
data as in figure 1, but while assuming a larger
value of
. As expected from equation 17, the data is not the same,
necessitating different distributions for each
.
Though we have obtained and plotted the desired data
for one combination of sources, we must do more
before we may fully represent the data
for each
. We must numerically calculate two dimensional
histograms with many data points, by choosing
grid blocks in
space. We choose to partition the
parameter space in figure 1 into
amplitude partitions by
delay partitions. We count the
number of blue circle data points in a given partition of
figure 1 corresponding to a specific source
combination
and magnitude ratio
. Thus, for each
frequency,
, we have a set of two dimensional histograms
for each
combination. The quantity
is then
represented by a total of
values for each
combination.
Though the numeric approach incurs great computational expense,
the mathematical intractability of obtaining closed form
expressions from equation 3 makes such an approach
necessary. (The phase estimator is as intractable as the magnitude
estimator.) This expense can be prohibitive, however. As an
illustration, if we have 4 sources and 2 are active, we have 6
possible combinations. For each, we may have 1024 distinct
points in our STFT, and might want to consider 40 values
of
(as in the example plot). To smoothly represent
, we may
want
. Thus we have
distribution
values of
to calculate, each of which might
use 1000 evenly spaced
values. These are nearly
prohibitive numbers with current processing speed. The good news
is that once the distributions are calculated, it is simple to
search the values
by matching a newly detected value
of
to the appropriate two dimensional histogram bin. Then we
may search a space of 240 distributions (in our example) to find
the optimal one in expression 14.
Given the computational issue (and a certain lack of elegance), we have considered two alternatives: ignoring delay information entirely, which shrinks the parameter space, and using DASSS data instead of the equation 3 DUET estimators. Each is considered below.