arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.7258cs.ITmath.IT
收藏

信道缩短接收机的信息论特征

An Information Theoretic Charachterization of Channel Shortening Receivers

Fredrik Rusek, Ove Edfors

摘要:

在线性信道上传输的数据的最佳数据检测总是可以通过维特比算法(VA)来实现。然而,在许多感兴趣的情况下,通道的存储器禁止VA的应用。在这种情况下,自70年代初以来研究的一种流行且概念简单的方法是首先对接收到的信号进行滤波以缩短信道的存储器,然后应用以较短存储器操作的VA。我们将其称为信道缩短(CS)接收机。虽然研究了近四十年,但对这种简单的接收器解决方案实际上在做什么的信息理论理解是不可用的。在本文中,我们将表明,一个优化的CS接收机正在实施的互信息的链式规则,但只有到接收机正在操作的缩短的内存。此外,我们将表明,用于分析从优化的CS接收器的随后可实现的速率的工具是完全相同的那些用于分析的最小均方误差(MMSE)接收器的可实现的速率。

英文摘要:

Optimal data detection of data transmitted over a linear channel can always be implemented through the Viterbi algorithm (VA). However, in many cases of interest the memory of the channel prohibits application of the VA. A popular and conceptually simple method in this case, studied since the early 70s, is to first filter the received signal in order to shorten the memory of the channel, and then to apply a VA that operates with the shorter memory. We shall refer to this as a channel shortening (CS) receiver. Although studied for almost four decades, an information theoretic understanding of what such a simple receiver solution is actually doing is not available. In this paper we will show that an optimized CS receiver is implementing the chain rule of mutual information, but only up to the shortened memory that the receiver is operating with. Further, we will show that the tools for analyzing the ensuing achievable rates from an optimized CS receiver are precisely the same as those used for analyzing the achievable rates of a minimum mean square error (MMSE) receiver.

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

↑