关于朴素格译码的局限性
On The Limitations of The Naive Lattice Decoding
摘要：
本文研究了MIMO衰落系统中朴素格型译码的固有缺陷。我们表明，使用朴素格解码MIMO系统的速率多样性权衡方面有相当大的不足。与最大似然译码不同的是，在这种情况下，即使是具有非零行列式性质的完美格型空时码也不能达到最佳的速率分集折衷。事实上，我们表明，在朴素格解码的情况下，当我们固定的基础格，所有的代码的基础上全速率格具有相同的速率多样性的权衡作为V-BLAST。此外，我们驱动的固定速率MIMO系统（具有相等数量的接收和发射天线）的朴素格解码的符号错误概率的下限。该界限表明，与最大似然解码相比，朴素格型解码在所需SNR方面具有无限的损失。
英文摘要：
In this paper, the inherent drawbacks of the naive lattice decoding for MIMO fading systems is investigated. We show that using the naive lattice decoding for MIMO systems has considerable deficiencies in terms of the rate-diversity trade-off. Unlike the case of maximum-likelihood decoding, in this case, even the perfect lattice space-time codes which have the non-vanishing determinant property can not achieve the optimal rate-diversity trade-off. Indeed, we show that in the case of naive lattice decoding, when we fix the underlying lattice, all the codes based on full-rate lattices have the same rate-diversity trade-off as V-BLAST. Also, we drive a lower bound on the symbol error probability of the naive lattice decoding for the fixed-rate MIMO systems (with equal numbers of receive and transmit antennas). This bound shows that asymptotically, the naive lattice decoding has an unbounded loss in terms of the required SNR, compared to the maximum likelihood decoding.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
