.png){kind=icon}
返回
Sparse channel estimation with zero tap detection
.png){kind=icon}
PRE
AI
DOI：10.1109/TWC.2007.360376.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Algorithms for the estimation of a channel whose impulse response is characterized by a large number of zero tap coefficients are developed and compared. Estimation is conducted in a two-stage fashion where an estimate of the non-zero taps is followed by channel estimation. Tap detection is transformed into an equivalent on-off keying detection problem. Several tap detection algorithms are investigated which tradeoff between complexity and performance. The proposed methods are compared to an unstructured least squares channel estimate as well as a structured approach based on matching pursuit. Three schemes in particular are developed: a sphere decoder based scheme, a Viterbi algorithm based method and a simpler iterative approach. The latter offers a better tradeoff between estimation accuracy and computational cost. A joint estimation and zero tap detection scheme is also considered. All solutions exhibit a significant gain in terms of mean-squared error and bit error rate over conventional schemes which do not exploit the sparse nature of the channel, as well as the matching pursuit approach which does endeavor to exploit the sparsity.
Keyword:
Cramer Rao bound
OOK detection
sparse channels
sphere decoder
Viterbi algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
10.7
论文数:
1.3W
被引数:
5.3W
机构
暂无机构信息
引用论文
.png){kind=icon}
分享收藏Characterization of ultra-wide bandwidth wireless indoor channels: A communication-theoretic view
OAAI
OAAI分享收藏The extrapolation of the Drucker–Prager/Cap material parameters to low and high relative densities
PREAI
分享收藏
查看更多内容