论文标题
最慢的下降方法的整数线性接收器设计
Integer-Forcing Linear Receiver Design with Slowest Descent Method
论文作者
论文摘要
计算 - 前向（CPF）策略是网络编码的一种类别，其中继电器将根据观察到的通道系数根据晶格代码的代数结构来计算源消息的线性组合。最近，基于CPF的想法，已提出了用于MIMO系统的整数强迫（IF）线性接收器体系结构，以恢复晶格代码字的不同整数组合，以进一步进行原始消息检测。在本文中，我们考虑了线性接收器是否相对于通道条件的问题。我们没有详尽的搜索，而是提出了实用有效的次优算法，以设计具有完整等级的IF系数矩阵，以便基于最慢的下降方法，最大程度地提高了总可实现的速率。数值结果证明了我们提出的算法的有效性。
Compute-and-forward (CPF) strategy is one category of network coding in which a relay will compute and forward a linear combination of source messages according to the observed channel coefficients, based on the algebraic structure of lattice codes. Recently, based on the idea of CPF, integer forcing (IF) linear receiver architecture for MIMO system has been proposed to recover different integer combinations of lattice codewords for further original message detection. In this paper, we consider the problem of IF linear receiver design with respect to the channel conditions. Instead of exhaustive search, we present practical and efficient suboptimal algorithms to design the IF coefficient matrix with full rank such that the total achievable rate is maximized, based on the slowest descent method. Numerical results demonstrate the effectiveness of our proposed algorithms.
