arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1401.1480cs.ITmath.IT
收藏

ISI信道信息速率的下界与近似

Lower Bounds and Approximations for the Information Rate of the ISI Channel

Yair Carmon, Shlomo Shamai

摘要:

我们考虑离散时间符号间干扰(ISI)信道模型,加性高斯噪声和固定的i.i.d.。输入。在这种情况下,我们研究了Shamai和Laroia提出的表达式,作为应用MMSE-DFE接收机后输入-输出互信息的简化下界。一个低信噪比的扩展被用来证明,在一般条件下的约束不成立,并表征输入,它是特别不适合。一个这样的输入是用来构建一个反例,表明Shamai-Laroia表达式并不总是约束甚至可实现的信道速率,从而排除了自然放松的原始约束。然而,当SNR足够高时,这种放松的界限对于任何有限熵输入和ISI信道都是成立的。最后,新的简单的界限的可实现的速率证明,并与其他已知的界限。信息估计关系和估计理论界在建立我们的结果中起着关键作用。

英文摘要:

We consider the discrete-time intersymbol interference (ISI) channel model, with additive Gaussian noise and fixed i.i.d. inputs. In this setting, we investigate the expression put forth by Shamai and Laroia as a conjectured lower bound for the input-output mutual information after application of a MMSE-DFE receiver. A low-SNR expansion is used to prove that the conjectured bound does not hold under general conditions, and to characterize inputs for which it is particularly ill-suited. One such input is used to construct a counterexample, indicating that the Shamai-Laroia expression does not always bound even the achievable rate of the channel, thus excluding a natural relaxation of the original conjectured bound. However, this relaxed bound is then shown to hold for any finite entropy input and ISI channel, when the SNR is sufficiently high. Finally, new simple bounds for the achievable rate are proven, and compared to other known bounds. Information-Estimation relations and estimation-theoretic bounds play a key role in establishing our results.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑