全分集酉预编码整数强迫
Full Diversity Unitary Precoded Integer-Forcing
摘要：
我们考虑一个点对点的平坦衰落MIMO信道，信道状态信息在发送端和接收端都已知。在发射机侧，在每个天线处采用网格编码方案以将信息符号映射到从相同码本中提取的独立网格码字。然后，将每个格形码字乘以酉预编码矩阵${\bf P}$，并通过信道发送。在接收器侧，采用整数强制（IF）线性接收器。我们将该方案表示为酉预编码整数强迫（UPIF）。我们表明，UPIF可以实现全分集的约束下，基于最短向量的预编码矩阵${\bf P}$产生的格。这个约束和一个更简单的版本提供了两种类型的全分集UPIF的设计标准。类型I使用在每个信道实现时适配的酉预编码器。类型II使用酉预编码器，其对于所有信道实现保持固定。然后，我们验证了我们的结果，在$2\times2$，和$4\times 4$ MIMO使用不同的QAM星座的计算机模拟。我们最后表明，建议的类型II UPIF优于MIMO预编码X-码在高数据率。
英文摘要：
We consider a point-to-point flat-fading MIMO channel with channel state information known both at transmitter and receiver. At the transmitter side, a lattice coding scheme is employed at each antenna to map information symbols to independent lattice codewords drawn from the same codebook. Each lattice codeword is then multiplied by a unitary precoding matrix ${\bf P}$ and sent through the channel. At the receiver side, an integer-forcing (IF) linear receiver is employed. We denote this scheme as unitary precoded integer-forcing (UPIF). We show that UPIF can achieve full-diversity under a constraint based on the shortest vector of a lattice generated by the precoding matrix ${\bf P}$. This constraint and a simpler version of that provide design criteria for two types of full-diversity UPIF. Type I uses a unitary precoder that adapts at each channel realization. Type II uses a unitary precoder, which remains fixed for all channel realizations. We then verify our results by computer simulations in $2\times2$, and $4\times 4$ MIMO using different QAM constellations. We finally show that the proposed Type II UPIF outperform the MIMO precoding X-codes at high data rates.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
