A Merry-Go-Round Decoding Scheme for Non-binary Quasi-Cyclic LDPC Codes

被引：0

作者：

Liu, Keke ^{[1
]}

Li, Juane ^{[1
]}

Lin, Shu ^{[1
]}

Abdel-Ghaffar, Khaled ^{[1
]}

机构：

[1] Univ Calif Davis, Dept Elect & Comp Engn, Davis, CA 95616 USA

来源：

2014 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2014) | 2014年

基金：

美国国家科学基金会;

关键词：

DENSITY; CONSTRUCTION;

D O I：

暂无

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper presents a reduced-complexity iterative scheme and an algorithm for decoding non-binary quasi-cyclic (QC) LDPC codes of a specific type. The proposed decoding scheme and the algorithm together significantly reduce the hardware implementation complexity of a decoder with no performance degradation. Also presented in the paper is a simple method for constructing a class of non-binary QC-LDPC codes.

引用

页码：1497 / 1503

页数：7

共 18 条

[1] [Anonymous], 2009, Channel Codes: Classical and Modern
[2] Barnault L, 2003, 2003 IEEE INFORMATION THEORY WORKSHOP, PROCEEDINGS, P70
[3] Chang BY, 2011, 2011 - MILCOM 2011 MILITARY COMMUNICATIONS CONFERENCE, P566, DOI 10.1109/MILCOM.2011.6127733
[4] Near optimum universal belief propagation based decoding of low-density parity check codes
Chen, JH
Fossorier, MPC
[J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2002, 50 (03) : 406 - 414
[5] Overlapped message passing for quasi-cyclic low-density parity check codes
Chen, YN
Parhi, KK
[J]. IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS I-REGULAR PAPERS, 2004, 51 (06) : 1106 - 1113
[6] Diao Q., 2011, P INF THEOR APPL WOR
[7] A Matrix-Theoretic Approach for Analyzing Quasi-Cyclic Low-Density Parity-Check Codes
Diao, Qiuju
Huang, Qin
Lin, Shu
Abdel-Ghaffar, Khaled
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2012, 58 (06) : 4030 - 4048
[8] LOW-DENSITY PARITY-CHECK CODES
GALLAGER, RG
[J]. IRE TRANSACTIONS ON INFORMATION THEORY, 1962, 8 (01): : 21 - &
[9] Hu XY, 2001, GLOB TELECOMM CONF, P995, DOI 10.1109/GLOCOM.2001.965567
[10] Counting Short Cycles of Quasi Cyclic Protograph LDPC Codes
Karimi, Mehdi
Banihashemi, Amir H.
[J]. IEEE COMMUNICATIONS LETTERS, 2012, 16 (03) : 400 - 403

← 1 2 →