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

LR辅助的MMSE格译码对所有近似泛码都是DMT最优的

LR-aided MMSE lattice decoding is DMT optimal for all approximately universal codes

Joakim Jalden, Petros Elia

摘要:

目前对于nt × nr MIMO信道,已知实现关于分集复用折衷(DMT)的最优性的任何显式构造的空时(ST)设计仅在使用最大似然(ML)解码进行解码时才这样做,这可能导致过高的解码复杂度。在本文中,我们证明了MMSE正则化格解码,以及计算高效的格约简(LR)辅助MMSE解码器,允许有效的和DMT最佳解码的任何近似通用的基于格的代码。该结果首次确定了一个明确构造的编码器和一个计算效率高的解码器,实现DMT最优的所有复用增益和所有信道尺寸。无论衰落的统计结果。

英文摘要:

Currently for the nt x nr MIMO channel, any explicitly constructed space-time (ST) designs that achieve optimality with respect to the diversity multiplexing tradeoff (DMT) are known to do so only when decoded using maximum likelihood (ML) decoding, which may incur prohibitive decoding complexity. In this paper we prove that MMSE regularized lattice decoding, as well as the computationally efficient lattice reduction (LR) aided MMSE decoder, allows for efficient and DMT optimal decoding of any approximately universal lattice-based code. The result identifies for the first time an explicitly constructed encoder and a computationally efficient decoder that achieve DMT optimality for all multiplexing gains and all channel dimensions. The results hold irrespective of the fading statistics.

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

↑