<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<item>
  <id>01747896</id>
  <dt>j</dt>
  <an>01747896</an>
  <augroup>
    <au>M\'{\i}guez, Joaqu\'{\i}n</au>
    <au>Castedo, Luis</au>
  </augroup>
  <ti>Maximum likelihood unsupervised source separation in Gaussian noise.</ti>
  <so>J. VLSI Signal Process. Syst. Signal Image Video Technol. 31, No.1, 7-18 (2002).</so>
  <py>2002</py>
  <pu>Springer, Norwell, MA</pu>
  <lagroup>
    <la>EN</la>
  </lagroup>
  <ccgroup>
  </ccgroup>
  <utgroup>
    <ut>blind source separation</ut>
    <ut>Monte Carlo methods</ut>
    <ut>multiple-input multiple-output channel estimation</ut>
    <ut>expectation maximization algorithm</ut>
    <ut>maximum likelihood</ut>
    <ut>separation of convolutive mixtures</ut>
  </utgroup>
  <cigroup>
  </cigroup>
  <ligroup>
    <li>doi:10.1023/A:1014437019997</li>
  </ligroup>
  <abgroup>
    <ab>Summary: This paper presents a new maximum likelihood (ML) based approach to the separation of convolutive mixtures of unobserved sources in the presence of additive Gaussian noise. The proposed method proceeds in two steps. First, the mixing system coefficients are estimated in the ML sense, and then this information is employed to attain source separation according to either the ML or the linear minimum mean square error criteria. System coefficient estimation is carried out in a block-iterative way using an extension of the expectation maximization method. Both deterministic and stochastic (Monte Carlo) implementations of the resulting estimation algorithm are considered. The proposed algorithms rely on the knowledge of the sources joint probability density function (p.d.f.). This is a fairly realistic assumption in applications such as digital communications, but computer simulations reveal that it is not a stringent requirement. The proposed estimation algorithm can be successfully used with a tentative p.d.f. when this is not known a priori.</ab>
    <rv></rv>
  </abgroup>
</item>