IEICE TRANSACTIONS on Communications
Nonbinary Quasi-Cyclic LDPC Cycle Codes with Low-Density Systematic Quasi-Cyclic Generator Matrices
Summary :
In this letter, we propose an appealing class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) cycle codes. The parity-check matrix is carefully designed such that the corresponding generator matrix has some nice properties: 1) systematic, 2) quasi-cyclic, and 3) sparse, which allows a parallel encoding with low complexity. Simulation results show that the performance of the proposed encoding-aware LDPC codes is comparable to that of the progressive-edge-growth (PEG) constructed nonbinary LDPC cycle codes.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E94-B No.9 pp.2620-2623
- Publication Date
- 2011/09/01
- Publicized
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.E94.B.2620
- Type of Manuscript
- LETTER
- Category
- Fundamental Theories for Communications
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Yang YANG, Chao CHEN, Jianjun MU, Jing WANG, Rong SUN, Xinmei WANG, "Nonbinary Quasi-Cyclic LDPC Cycle Codes with Low-Density Systematic Quasi-Cyclic Generator Matrices" in IEICE TRANSACTIONS on Communications,
vol. E94-B, no. 9, pp. 2620-2623, September 2011, doi: 10.1587/transcom.E94.B.2620.
Abstract: In this letter, we propose an appealing class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) cycle codes. The parity-check matrix is carefully designed such that the corresponding generator matrix has some nice properties: 1) systematic, 2) quasi-cyclic, and 3) sparse, which allows a parallel encoding with low complexity. Simulation results show that the performance of the proposed encoding-aware LDPC codes is comparable to that of the progressive-edge-growth (PEG) constructed nonbinary LDPC cycle codes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E94.B.2620/_p
Copy
@ARTICLE{e94-b_9_2620,
author={Yang YANG, Chao CHEN, Jianjun MU, Jing WANG, Rong SUN, Xinmei WANG, },
journal={IEICE TRANSACTIONS on Communications},
title={Nonbinary Quasi-Cyclic LDPC Cycle Codes with Low-Density Systematic Quasi-Cyclic Generator Matrices},
year={2011},
volume={E94-B},
number={9},
pages={2620-2623},
abstract={In this letter, we propose an appealing class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) cycle codes. The parity-check matrix is carefully designed such that the corresponding generator matrix has some nice properties: 1) systematic, 2) quasi-cyclic, and 3) sparse, which allows a parallel encoding with low complexity. Simulation results show that the performance of the proposed encoding-aware LDPC codes is comparable to that of the progressive-edge-growth (PEG) constructed nonbinary LDPC cycle codes.},
keywords={},
doi={10.1587/transcom.E94.B.2620},
ISSN={1745-1345},
month={September},}
Copy
TY - JOUR
TI - Nonbinary Quasi-Cyclic LDPC Cycle Codes with Low-Density Systematic Quasi-Cyclic Generator Matrices
T2 - IEICE TRANSACTIONS on Communications
SP - 2620
EP - 2623
AU - Yang YANG
AU - Chao CHEN
AU - Jianjun MU
AU - Jing WANG
AU - Rong SUN
AU - Xinmei WANG
PY - 2011
DO - 10.1587/transcom.E94.B.2620
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E94-B
IS - 9
JA - IEICE TRANSACTIONS on Communications
Y1 - September 2011
AB - In this letter, we propose an appealing class of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) cycle codes. The parity-check matrix is carefully designed such that the corresponding generator matrix has some nice properties: 1) systematic, 2) quasi-cyclic, and 3) sparse, which allows a parallel encoding with low complexity. Simulation results show that the performance of the proposed encoding-aware LDPC codes is comparable to that of the progressive-edge-growth (PEG) constructed nonbinary LDPC cycle codes.
ER -
English
