.png){kind=icon}
返回
A fast blind SIMO channel indentification algorithm for sparse sources
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2003.810014.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
We address the blind identification of single-input-multiple output (SIMO) finite impulse response systems when the input signal is sparse. The problem is equivalent to under-determined blind source separation (BSS), but with temporal correlation among the sources. Exploiting the sparse character of the input signal, the algorithm solves three different problems: first, to estimate the directions of the columns of the channel matrix; second, to estimate the L-2-norm of the columns; and finally, to find the correct ordering of the columns of the mixing matrix. The last step is not required for the blind source separation (BSS) problem, since any permutation of the columns is admissible for BSS. The performance and computational cost of the algorithm in a noiseless situation is compared against subspace-based techniques.
Keyword:
blind channel identification
blind source separation (BSS)
sparse deconvolution
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏分享收藏
没有更多内容
没有更多内容