返回
Efficient Maximum-Likelihood Decoding of Spherical Lattice Codes
DOI:10.1109/TCOMM.2009.08.070329.png)
摘要
En 中文
A new framework for efficient exact Maximum-Likelihood (ML) decoding of spherical lattice codes is developed. It employs a double-tree structure: The first is that which underlies established tree-search decoders; the second plays the crucial role of guiding the primary search by specifying admissible candidates and is our present focus. Lattice codes have long been of interest due to their rich structure, leading to decoding algorithms for unbounded lattices, as well as those with axis-aligned rectangular shaping regions. Recently, spherical Lattice Space-Time (LAST) codes were proposed to realize the optimal diversity-multiplexing tradeoff of MIMO channels. We address the so-called boundary control problem arising from the spherical shaping region defining these codes. This problem is complicated because of the varying number of candidates to consider at each search stage; it is not obvious how to address it effectively within the frameworks of existing decoders. Our proposed strategy is compatible with all sequential tree-search detectors, as well as auxiliary processing such as the MMSE-GDFE and lattice reduction. We demonstrate the superior performance and complexity profiles achieved when applying the proposed boundary control in conjunction with two current efficient ML detectors and show an improvement of 1dB over the state-of-the-art at a comparable complexity.
Keyword:
Spherical lattice codes
lattice space-time codes
boundary control
maximum-likelihood decoding
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Prognostic and Predictive Relevance of Primary Tumor Location in Patients With RAS Wild-Type Metastatic Colorectal CancerRAS 野生型转移性结直肠癌患者原发肿瘤位置的预后和预测相关性

