.png){kind=icon}
返回
Nonbinary LDPC Codes on Cages: Structural Property and Code Optimization
.png){kind=icon}
PRE
AI
DOI：10.1109/TCOMM.2014.2387341.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
A (v, g)-cage is a (not necessarily unique) smallest v-regular graph of girth g. On such a graph, a nonbinary (2, v)-regular low-density parity-check (LDPC) code can be defined such that the Tanner graph has girth 2g and the code length achieves the minimum possible. In this paper, we focus on two aspects of this class of codes, structural property and code optimization. We find that, in addition to those found previously, many cages can be used to construct structured LDPC codes. We show that all cages with even girth can be structured as protograph-based codes, many of which have block-circulant Tanner graphs. We also find that four cages with odd girth can be structured as protograph-based codes with block-circulant Tanner graphs. For code optimization, we develop an ontology-based approach. All possible inter-connected cycle patterns that lead to low symbol-weight codewords are identified to put together the ontology. By doing so, it becomes handleable to estimate and optimize distance spectrum of equivalent binary image codes. We further analyze some known codes from the Consultative Committee for Space Data Systems recommendation and design several new codes. Numerical results show that these codes have reasonably good minimum bit distance and perform well under iterative decoding.
Keyword:
Nonbinary LDPC code
cage
protograph-based code
CCSDS recommendation
minimum distance
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
8.3
论文数:
1.2W
被引数:
3.6W
机构
引用论文
.png){kind=icon}
分享收藏The Seasonal Cycle of the Plankton Diatom, Melosira Italica (EHR.) Kutz. Subsp. Subarctica O. Mull
PREAI
分享收藏Binuclear copper complexes of ligands providing three donors to each metal ion配体的双核铜配合物为每个金属离子提供三个供体
PREAI
分享收藏
查看更多内容