Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

International Journal of Future Computer and Communication

Masking Matrix Design of Quasi-Cyclic LDPC Codes for High-speed Optical Communications

Shuling Che, Xinmei Wang

Published Jan 1, 2013• 0 citations
Publisher
DOI
10.7763/ijfcc.2013.v2.171

Related papers

DESIGN OF QUASI-CYCLIC LDPC CODES BASED ON EUCLIDEAN GEOMETRIES

Liu, Yuanhua, Niu +5 more

Journal of Electronics (China)•Jan 1, 2010•1 citation

Construction of Regular and Irregular QC-LDPC Codes: a Finite Field Approach and Masking

Xiaopeng Chen, Lin Zhou, Rui Zhao +1 more

Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes require less hardware resources due to the quasi-cyclic structure of parity-check matrices.In this paper, two improved methods for constructing QC-LDPC codes are proposed.Firstly, in order to make sure the masked LDPC codes have flexible code rate and code length, an improved construction of masking matrix is presented.The proposed regular masking matrix of QC-LDPC codes have the girth at least 6.Then, the irregular codes are constructed by using improved finite field approach and PEG algorithm, which result in large girth and less short cycles.Simulations demonstrate that the proposed QC-LDPC codes have both lower error floor and good waterfall performance.

International Symposium on Advances in Electrical, Electronics and Computer Engineering (ISAEECE)•Jan 1, 2016•1 citation

Design of Quasi-Cyclic LDPC codes based on Euclidean Geometries

Yuanhua Liu, Xinliang Niu, Xinmei Wang +1 more

Journal of Electronics (China)•May 1, 2010•1 citation

Design of masking matrix for QC-LDPC codes

Yang Liu, Ying Li

The masking matrix plays an important role in constructing new classes of regular and irregular quasi-cyclic low density parity check (QC-LDPC) codes. By coupling two identical graphs in a special way, we present a new structure of the masking matrix, whose Tanner graph can be seen as a protograph. From this perspective, we propose a Gaussian Approximation algorithm for protograph-based LDPC codes to analyze the asymptotic performance of this class of codes. It is shown that, although the proposed structure of the masking matrix has almost the same convergence threshold as the conventional one produced randomly by progressive edge growth (PEG) algorithm, the former converges faster than the latter. Simulation results illustrate that the QC-LDPC code constructed by the proposed structure of the masking matrix has about 0.2dB coding gains compared with the conventional one.

IEEE Information Theory Workshop (ITW)•Sep 1, 2013•12 citations

FPGA implementation of high-performance QC-LDPC decoder for optical communications

Ding Zou, Ivan B. Djordjević

Forward error correction is as one of the key technologies enabling the next-generation high-speed fiber optical communications. Quasi-cyclic (QC) low-density parity-check (LDPC) codes have been considered as one of the promising candidates due to their large coding gain performance and low implementation complexity. In this paper, we present our designed QC-LDPC code with girth 10 and 25% overhead based on pairwise balanced design. By FPGAbased emulation, we demonstrate that the 5-bit soft-decision LDPC decoder can achieve 11.8dB net coding gain with no error floor at BER of 10-15 avoiding using any outer code or post-processing method. We believe that the proposed single QC-LDPC code is a promising solution for 400Gb/s optical communication systems and beyond.

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE•Feb 7, 2015•6 citations

Quasi-cyclic LDPC codes using overlapping matrices and their layered decoders

Beomkyu Shin, Hosung Park, Seokbeom Hong +2 more

AEU - International Journal of Electronics and Communications•Nov 12, 2013•5 citations
Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) codes require less hardware resources due to the quasi-cyclic structure of parity-check matrices.In this paper, two improved methods for constructing QC-LDPC codes are proposed.Firstly, in order to make sure the masked LDPC codes have flexible code rate and code length, an improved construction of masking matrix is presented.The proposed regular masking matrix of QC-LDPC codes have the girth at least 6.Then, the irregular codes are constructed by using improved finite field approach and PEG algorithm, which result in large girth and less short cycles.Simulations demonstrate that the proposed QC-LDPC codes have both lower error floor and good waterfall performance.
The masking matrix plays an important role in constructing new classes of regular and irregular quasi-cyclic low density parity check (QC-LDPC) codes. By coupling two identical graphs in a special way, we present a new structure of the masking matrix, whose Tanner graph can be seen as a protograph. From this perspective, we propose a Gaussian Approximation algorithm for protograph-based LDPC codes to analyze the asymptotic performance of this class of codes. It is shown that, although the proposed structure of the masking matrix has almost the same convergence threshold as the conventional one produced randomly by progressive edge growth (PEG) algorithm, the former converges faster than the latter. Simulation results illustrate that the QC-LDPC code constructed by the proposed structure of the masking matrix has about 0.2dB coding gains compared with the conventional one.
Forward error correction is as one of the key technologies enabling the next-generation high-speed fiber optical communications. Quasi-cyclic (QC) low-density parity-check (LDPC) codes have been considered as one of the promising candidates due to their large coding gain performance and low implementation complexity. In this paper, we present our designed QC-LDPC code with girth 10 and 25% overhead based on pairwise balanced design. By FPGAbased emulation, we demonstrate that the 5-bit soft-decision LDPC decoder can achieve 11.8dB net coding gain with no error floor at BER of 10-15 avoiding using any outer code or post-processing method. We believe that the proposed single QC-LDPC code is a promising solution for 400Gb/s optical communication systems and beyond.