.png){kind=icon}
返回
New Coding Techniques for Codes over Gaussian Integers
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2013.061913.120742.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
This work presents block codes over Gaussian integers. We introduce Gaussian integer rings which extend the number of possible signal constellations over Gaussian integer fields. Many well-known code constructions can be used for codes over Gaussian integer rings, e.g., the Plotkin construction or product codes. These codes enable low complexity decoding in the complex domain. Furthermore, we demonstrate that the concept of set partitioning can be applied to Gaussian integers. This enables multilevel code constructions. In addition to the code constructions, we present a low complexity soft-input decoding algorithm for one Mannheim error correcting codes. The presented decoding method is based on list decoding, where the list of candidate codewords is obtained by decomposing the syndrome into two sub-syndromes. Considering all decompositions of the syndrome we construct lists of all possible errors of Mannheim weight two. In the last decoding step the squared Euclidean distance is used to select the best codeword from the list. Simulation results for the additive white Gaussian noise channel demonstrate that the proposed decoding method achieves a significant coding gain compared with hard-input decoding.
Keyword:
Gaussian integers
set partitioning
quadrature amplitude modulation
Plotkin construction
product codes
soft-input decoding
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
Kinetics of the isomerization of 1-chloro- and 2-chloropentaborane(9) using diethyl ether catalyst
.png){kind=icon}
PREAI
分享收藏
分享收藏
分享收藏分享收藏
查看更多内容