A general solution to blind inverse problems for sparse input signals

In this paper, we present a computationally efficient algorithm which provides a general solution to blind inverse problems for sparse input signals. The method takes advantage of the clustering typical of sparse input signals to identify the channel matrix, solving four problems sequentially: detec...

Full description

Saved in:
Bibliographic Details
Published in:Neurocomputing (Amsterdam) 2005-12, Vol.69 (1), p.198-215
Main Authors: Luengo, David, Santamaría, Ignacio, Vielva, Luis
Format: Article
Language:English
Subjects:
Blind channel identification
Blind deconvolution
Blind equalization
Blind source separation
SIMO and MIMO systems
Sparse input signals
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a computationally efficient algorithm which provides a general solution to blind inverse problems for sparse input signals. The method takes advantage of the clustering typical of sparse input signals to identify the channel matrix, solving four problems sequentially: detecting the number of input signals (i.e. clusters), estimating the directions of the clusters, estimating their amplitudes, and ordering them. Once the channel matrix is known, the pseudoinverse can be used as the canonical solution to obtain the input signals. When the input signals are not sparse enough, the algorithm can be applied after a linear transformation of the signals into a domain where they show a good degree of sparsity. The performance of the algorithm for the different types of problems considered is evaluated using Monte Carlo simulations.
ISSN:0925-2312
1872-8286
DOI:10.1016/j.neucom.2005.02.019