By Topic

Nonbinary LDPC codes constructed based on a cyclic MDS code and a low-complexity nonbinary message-passing decoding algorithm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Chao Chen ; State Key Lab. of ISN, Xidian University, Xi'an, China ; Baoming Bai ; Xinmei Wang ; Ming Xu

In this letter, we propose a construction of nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes based on a cyclic maximum distance separable (MDS) code. The parity-check matrices are significantly rank deficient square matrices and their Tanner graphs have a girth of at least 6. The minimum distances of the codes are very respectable as far as LDPC codes are concerned. Based on plurality voting and iterative mechanism, a low-complexity nonbinary massage-passing decoding algorithm is proposed. It only requires finite field operations, integer additions and integer comparisons. Simulation results show that the decoding algorithm is fit for the proposed codes, providing efficient trade-offs between performance and decoding complexity, which suggests that the coding scheme may find some applications in communication or storage systems with high-speed and low-power consumption requirements.

Published in:

IEEE Communications Letters  (Volume:14 ,  Issue: 3 )