This article has been accepted for publication in a future issue of this journal, but has not been

fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2016.2537812, IEEE
Communications Letters

Hard-information Bit-reliability Based Decoding

Algorithm for Majority-logic Decodable Non-binary
LDPC Codes
Xiangcheng Li, Tuanfa Qin, Haiqiang Chen, Youming Sun, Qi Liang, and Liping Luo

Abstract—A modified bit-reliability based decoding algorithm
is presented based on a recent work by Huang et al.. For the
presented algorithm, only one Galois field element is passed and
exchanged along the edges of the Tanner graph. At variable
nodes, full messages rather than extrinsic messages are processed
to further reduce the computational complexity. At check nodes,
only hard reliability is considered and the main operation
is to compute the check-sum and send one extrinsic symbol
back to variable nodes. Simulation results show that, even with
lower complexity and less memory consumption, the presented
algorithm still can perform very closely to the original wBRB
algorithm with low quantization bits (3 ∼ 4bits) when decoding
the majority-logic decodable non-binary LDPC codes. For codes
constructed in high order fields, the presented algorithm can even
outperform the original wBRB algorithm.
Index Terms—Hard information, LDPC decoding, majority-
logic decoding, non-binary LDPC codes, reliability-based.
I. I NTRODUCTION
First introduced by Gallager [1], and then investigated by
Davey and Mackay [2], non-binary low density parity check
(NB-LDPC) codes are shown to outperform their binary coun-
terparts when decoded by message-passing (MP) decoding
algorithms, such as the q-ary sum-product algorithm (QSPA)
and the FFT-QSPA [3]. However, the performance gain is
obtained at the expense of extremely high decoding complexity
and thus it is difficult for hardware implementations in prac-
tice. In [4], Declercq et al. proposed an extended min-sum
(EMS) algorithm, which can reduce both the computational
and the storage complexities. Several variations of the EMS
algorithm were proposed [5][6]. Besides the MP algorithms,
there exists an important class of reduced-complexity decoding
algorithms for NB-LDPC codes, known as the majority-logic
decoding (MLgD) algorithms, which is specially designed
for the codes with heavy column weights. Related works
include the iterative MlgD algorithm [7] and the iterative
soft reliability-based (ISRB) algorithm [8] and the improved
Manuscript received September 15, 2015. The associate editor coordinating
the review of this paper and approving it for publication was H. Saeedi. This
work was supported by NSF of China (No.61102090,61261023,61362010)
and NSF of Guangxi (No.2015GXNSFAA139290, 2014GXNSFBA118276,
2012GXNSFAA053217).
X. Li is with the School of Electronic and Information Engineering, South
China University of Technology, Guangzhou, 510641, China. T. Qin, H. Chen,
Y. Sun and Q. Liang are with the School of Computer, Electronics and
Information, Guangxi University, Nanning, 530004, China. L. Luo is with
the School of Information Science and Engineering in Guangxi University
for Nationalities, China.
(Corresponding author: Haiqiang Chen, e-mail: haiqiang@gxu.edu.cn)
ISRB (IISRB) algorithm and its re-selection scheme (RS-
IISRB) [9][10].
Recently, Huang et al. proposed a weighted bit-reliability
based (wBRB) decoding algorithm [11][12] for NB-LDPC
codes. Different from the existing NB-LDPC decoders, the
wBRB algorithm updates the reliability in terms of bits rather
than field elements. Combined with distance-based coeffi-
cients, the wBRB algorithm can achieve good error perfor-
mance for NB-LDPC codes with various column weights, but
the complexity and memory consumption are greatly reduced
compared with the existing MP and MLgD algorithms.
This letter presents a modified algorithm, referred to as the
hard-information bit-reliability based decoding algorithm (HI-
BRB) based on the work in [11]. Similarly, the presented algo-
rithm updates reliability messages bit-by-bit in the iterations.
Our work however can be differentiated from that of [11] based
on the following facts:
• Full messages rather than extrinsic messages are passed
from variable nodes to check nodes, which can save
integer operations introducing by the extrinsic informa-
tion computing and thus can further reduce the decoding
complexity;
• At variable nodes, the reliability message for each bit
within a symbol is modified to its binary constellation
signal, which actually corresponds to the bit-based hard
reliability. Such modification can save memory loads and
integer operations since no soft reliability is involved;
• At check nodes, the bit-reliability of the extrinsic infor-
mation is also changed to its hard counterpart and hence
can save much integer comparisons introducing by the
min operations;
• Finally, an efficient non-uniform quantization scheme is
combined with the presented algorithm to further reduce
the memory consumption.
Simulation results show that the presented HI-BRB algo-
rithm can perform very closely to the original wBRB algorithm
with low quantization bits (3 ∼ 4bits) when decoding the NB-
LDPC codes with heavy column weights. More interestingly,
for the NB-LDPC codes constructed in high order fields (say,
larger than 64), the HI-BRB algorithm can even outperform
the wBRB algorithm with a more detailed optimized distance-
based parameter. Therefore, the presented algorithm can make
an efficient tradeoff between performance and complexity.

1089-7798 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2016.2537812, IEEE
Communications Letters

II. S YSTEM M ODEL C. Updating at Variable Nodes

A regular NB-LDPC code Cq [n, k] over the Galois field For each variable node Vj , the weighted extrinsic informa-
of order q = 2ℓ (Fq ) can be defined as the null space of a tion is computed by
sparse parity-check matrix H = [hi,j ]m×n (hi,j ∈ Fq ). For (k)
X
convenience, we define two index sets as follows: ξj,t = θd(σ(k) ,z(k) ) Rσ(k)
i→j,t
, (4)
i,j j
i∈Mj
Ni = {j : 0 ≤ j ≤ n − 1, hi,j 6= 0},
for 0 ≤ j ≤ n − 1, 0 ≤ t ≤ ℓ − 1 and θd(σ(k) ,z(k) ) is a
i,j j
for each row i of H and (ℓ + 1)−tuple vector of distance-based weighting coefficients
Mj = {i : 0 ≤ i ≤ m − 1, hi,j 6= 0}, to enhance the performance. The updating is performed bit-
by-bit as follows:
for each column j of H. (k)
Let c = (c0 , c1 , · · · , cn−1 ) ∈ Fnq be a codeword to be Rz(k+1)
j,t
= Rz(0)
j,t
+ ξj,t , (5)
transmitted over the AWGN channel. The codeword c can for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1. The soft reliability of
be interpreted as a binary vector of length ℓn by replacing (k)
ej→i,t is updated by
each component cj with its ℓ-tuple binary representation
cj = (cj,0 , cj,1 , · · · , cj,ℓ−1 ). Each bit cj,t can be mapped into Re(k+1)
j→i,t
= Rz(k+1)
j,t
− Rσ(k)
i→j,t
, i ∈ Mj (6)
a real signal xj,t with a mapping rule φ(•). For simplicity, we
can use the BPSK mapping as follows: for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1.
Note: When each component of θd(σ(k) ,z(k) ) is set to unity,
i,j j
xj,t = φ(cj,t ) = 1 − 2cj,t , (1) we obtain the BRB algorithm; when the quantization step is
for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1. Let y = replaced by the hard-decision, the algorithm results in the
(y0 , y1 , · · · , yn−1 ) be the received vector. Each component wBRB-H algorithm. See [11] for details.
yj can be represented by yj = (yj,0 , yj,1 , · · · , yj,ℓ−1 ) with
yj,t = xj,t +nj,t , where nj,t is a white Gaussian noise sample, IV. T HE P RESENTED A LGORITHM
for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1. The signal yj will be
A. The Non-uniform Quantization
quantized into an integer vector qj = (qj,0 , qj,1 , · · · , qj,ℓ−1 )
based on a well-designed quantization scheme. Let 0 < r < 1 and b > 1 be two parameters to be designed.
The signal yj,t is clipped and quantized into qj,t by defining
III. R EVIEW OF THE W EIGHTED B IT- RELIABILITY BASED quantization function as follows:
D ECODING A LGORITHM 
b
sign(yj,t )(2 − 1),
 |yj,t | ≥ r0
A. Initializations
(k) (k) (k) qj,t , sign(yj,t )(2 − 1 − p), rp+1 ≤ |yj,t | < rp , (7)
b
Let z(k) = (z0 , z1 , · · · , zn−1 ) ∈ Fnq be the hard decision b
0 ≤ |yj,t | < r2 −2

sign(yj,t ),

(k) (k) (k) (k)
vector with zj = (zj,0 , zj,1 , · · · , zj,ℓ−1 ) ∈ Fℓ2 at the k-th
(k) (k) (0)
iteration. Let Rzj,t be the bit-reliability of zj,t and set Rzj,t = for 0 ≤ j ≤ n − 1 and p = 0, 1, · · · , 2b − 3. The parameter r
qj,t initially, for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1. is used to adjust the quantization resolution. Obviously, qj,t is
Let ej→i
(k)
be the extrinsic information from an integer reliability ranging from −(2b − 1) to +(2b − 1) and
(k) has a non-uniform distribution. The quantization step for the
variable node Vj to check node Ci with ej→i = small received signals may be more refined than that for the
(k) (k) (k) (k)
(ej→i,0 , ej→i,1 , · · · , ej→i,ℓ−1 ) ∈ Fℓ2 . Similarly, let Rej→i,t be large ones. This is reasonable since the decision threshold for
(k) (0)
the bit-reliability of ej→i,t and set Rej→i,t = qj,t initially, for discrete binary AWGNC signals is exactly zero in the case of
0 ≤ j ≤ n − 1, i ∈ Mj and 0 ≤ t ≤ ℓ − 1. equal priors. Therefore, we tend to use a higher quantization
resolution for the received signals that are closer to the origin.
B. Processing at Check Nodes
(k)
For 0 ≤ i ≤ m − 1 and j ∈ Ni , let σi→j ∈ Fq denote the B. Algorithm
extrinsic information from check node Ci to variable node Vj ,
Combined with the quantization method described above,
which is determined by
we present a hard information bit-reliability based decoding
(k) (k)
X
σi→j = h−1i,j hi,j ′ ej ′ →i . (2) algorithm (HI-BRB) in this section. The presented algorithm
j ′ ∈Ni \j can further reduce the complexity and the memory consump-
(k) (k) (k)
tion by the following modifications.
Let (σi→j,0 , σi→j,1 , · · · , σi→j,ℓ−1 ) ∈ Fℓ2 be the binary vector Firstly, full messages rather than extrinsic messages are
(k) (k) (k)
of σi→j . The bit-based soft reliability of σi→j,t is defined by employed at the variable nodes. Let ẽj→i be the symbol from
(k) variable node Vj to check node Ci , with binary representation
Rσ(k)
i→j,t
= φ(σi→j,t ) ′ min min |Re(k)
j ′ →i,t
| . (3) (k) (k) (k) (k)
ẽj→i = (ẽj→i,0 , ẽj→i,1 , · · · , ẽj→i,ℓ−1 ) ∈ Fℓ2 . The bit-based
j ∈Ni \j t
full message is simply defined by
Then the extrinsic information along with its soft reliability
(k) (k)
will pass back from Ci to Vj . ẽj→i,t = zj,t , i ∈ Mj (8)

1089-7798 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2016.2537812, IEEE
Communications Letters

TABLE I
COMPUTATIONAL COMPLEXITIES REQUIRED FOR VARIOUS DECODING ALGORITHMS, WHERE δ = nγ = mρ

Computation Complexities Example for C256 [255, 175]

Decoding Algorithm
GA GM IA/IC/RA/RC IM GA GM IA/IC/RA/RC IM
BRB per iter. 2δ − m 2δ (4ℓ + 1)δ − 3m 7905 8160 133875 0
wBRB per iter. 2δ − m 2δ (4ℓ + 1)δ − 3m δ 7905 8160 133875 4080
IHRB per iter. 2δ − m 2δ δ + 3nq − 2n 7905 8160 199410
per iter. 2δ − m 2δ δ + 3nq − 2n 7905 8160 199410
ISRB
init. nqℓ + mn(3ρ − 6)(q − 1) nq 6.97 × 108 65280
per iter. 2δ − m 2δ 2δ 7905 8160 8160
IISRB
init. nqℓ + δ(ρ − 2) nq + δρ 579360 130560
per iter. 2(δ + γ) − m 2δ + γ 5δ + 6n + 2 7937 8176 21932
RS-IISRB
init. nqℓ + δ(ρ − 2) + n(ℓ − 1) nq + δρ 581145 130560
Presented HI-BRB per iter. 2δ − m 2δ 3δℓ 7905 8160 97920 0
GA: Galois Field Addition GM: Galois Field Multiplication IA: Integer Addition
IC: Integer Comparison RA: Real Addition RC: Real Comparison RM: Real Multiplication

P (k)
for 0 ≤ j ≤ n−1 and 0 ≤ t ≤ ℓ−1. This modification can save 2) for 0 ≤ i ≤ m − 1, compute si = zj hi,j ;
integer operations introducing by the extrinsic information j∈Ni
3) if s = (s0 , s1 , ..., sm−1 ) = 0, exit the iteration;
computing thus it can further reduce the decoding complexity.
Secondly, hard reliability rather than soft reliability message 4) for 0 ≤ i ≤ m − 1, 0 ≤ t ≤ ℓ − 1 and j ∈ Ni , compute
(k) (k) the extrinsic information and its bit-based reliability
is used for each bit of ẽj→i . Let R̃ẽj→i,t denote the bit-
(k) (k) (k)
reliability of the ẽj→i,t Ṫhen we just set
X
σi→j = h−1 i,j hi,j ′ ẽj→i ,
(k) j ′ ∈Ni \j
R̃ẽj→i,t = φ(ẽj→i,t ), i ∈ Mj (9)
and
for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1. Such modification can R̃σ(k)
(k)
= φ(σi→j,t ) ;
i→j,t
save temporary memory loads and some integer operations,
since no soft reliability is involved in the iterations. 5) for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1, compute the
(k)
Thirdly, since each bit-based reliability of ẽj→i is set to be bit-based weighted extrinsic information
φ(ẽj→i,t ), the reliability with respect to the extrinsic informa-
(k)
ξ˜j,t =
X
(k)
tion σi→j is consequently changed to its hard counterparts. θd(σ(k) ,z(k) ) R̃σ(k)
i→j,t
, (11)
i,j j
(k) (k) (k) i∈Mj
Let (R̃σi→j,0 , R̃σi→j,1 , · · · , R̃σi→j,ℓ−1 ) denote the bit-based
(k) and update the reliability information bit-by-bit
hard reliability vector of σi→j , then each component can be
computed as follows: (k)
(k)
Rz(k+1)
j,t
= Rz(0)
j,t
+ ξ̃j,t ;
R̃σ(k)
i→j,t
= φ(σi→j,t ), j ∈ Ni (10)
6) increment k by 1.
for 0 ≤ i ≤ m−1 and 0 ≤ t ≤ ℓ−1. Compared to the original (k) (k) (k)
• Output (z0 , z1 , · · · , zn−1 ) as the decoded codeword.
wBRB algorithm, this modification can reduce much integer
comparison operations that are related to the min operations
C. Complexity and Memory Consumption
at check nodes. Moreover, the memory consumption is also
reduced since we do not require to store the soft reliability in At check nodes, we need m(ρ − 1) Galois field addi-
the iterations. tions (GA) and δ Galois field multiplications (GM) (δ =
Based on the description above, the presented HI-BRB mρ = nγ) to compute the m check-sums. To compute the
(k),
algorithm can be summarized as follows. extrinsic information σi,j s, it requires δ GAs and δ GMs.
Algorithm 1 (The Hard Information Bit-reliability Based At variable nodes, it requires δℓ integer comparisons (IC) to
Decoding Algorithm - HI-BRB ): compute the distance vector and δℓ real additions (RA) to
(k),
• Input compute the weighted extrinsic information ξ˜j,t s. To update
received vector (y0 , y1 , · · · , yn−1 ) , quantization parameters the reliabilities of n variable nodes, we need δℓ RAs. The total
r, b and maximum iteration number Imax . computational complexities are shown in Table I. We observe
• Initialization that the complexity of the presented algorithm is equivalent
1) quantize each component yj into the integer vector qj ; to that of IHRB, but is lower than that of other algorithms.
2) set the loop counter k = 0; Besides this, the HI-BRB algorithm also has low memory
(0)
3) for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1 , set Rzj,t = qj,t . consumptions. Firstly, we do not need any memory to store the
• Iterations: while k < Imax , do the following steps. soft reliabilites in the iterations. Secondly, it is shown in the
(k) next section that the HI-BRB algorithm can work efficiently
1) for 0 ≤ j ≤ n − 1 and 0 ≤ t ≤ ℓ − 1, compute zj
where at very low quantization bits (3 ∼ 4bits), which is significant
(
(k) (k) for extremely memory-limited scenarios.
zj,t = 0, Rzj,t > 0 Note that the IISRB and the RS-IISRB algorithm have less
(k) (k) ;
zj,t = 1, Rzj,t ≤ 0 IA/IC/RA/RC operations than the presented algorithm at each

1089-7798 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.
This article has been accepted for publication in a future issue of this journal, but has not been fully edited. Content may change prior to final publication. Citation information: DOI 10.1109/LCOMM.2016.2537812, IEEE
Communications Letters

0 0
10 10
wBRB−H wBRB−H
2.6,1.5,0.3 2,1,0.5
−1 wBRB Un−12bits −1 wBRB Un−12bits
10 2.4,1.8,0.2 10 5,5,1/3
IHRB−MLgD IHRB−MLgD
−2 ISRB−MLgD Un−12bits −2 ISRB−MLgD Un−12bits
10 10
IISRB−MLgD Un−12bits IISRB−MLgD Un−12bits
RS−IISRB−MLgD Un−12bits RS−IISRB−MLgD Un−12bits
−3 −3
10 HI−BRB NonUn−3bits 10 HI−BRB NonUn−4bits
2,2,0.8,0.7,0.5 5,5,1.1,0.7,0.7
HI−BRB NonUn−3bits
3,3,0.6,0.4,0.4
BER

BER
−4 −4
10 10

−5 −5
10 10

−6 −6
10 10

−7 −7
10 10

−8 −8
10 10
4.5 5 5.5 6 6.5 4 4.5 5 5.5 6
E /N (dB) E /N (dB)
b 0 b 0

Fig. 1. Performances of the PEG-C32 [1800, 1200] with column weight 9. Fig. 2. Performances of the EG-C256 [255, 175] with column weight 16.

iteration. However, their total complexity can be higher due V. C ONCLUSION

to large operations at initialization step.
D. Performance
Let [θ0 , θ1 , · · · , θℓ ] be the distance-based parameters.
In [11], the first three coefficients, denoted by [θ0 , θ1 , θ2 ], are
considered to be optimized and the remaining coefficients are
set to be θ2 . However, for codes constructed in relatively high
order fields (say, larger than 64), we suggest to use a more
detailed optimized parameter to enhance the performance.
For example, we have considered the first five coefficients
[θ0 , θ1 , θ2 , θ3 , θ4 ] in our simulations. Such slight modification
may achieve performance gains, as verified by the following
simulations. Other simulation parameters are listed as follows:
1) for 12-bit uniform quantization, the interval is 0.0039; 2) for
4-bit non-uniform quantization, the parameter r is 0.894; 3)
for 3-bit non-uniform quantization, the parameter r is 0.787.
The maximum iteration number is set to be 50.
Example 1: Consider the C32 [1800, 1200] constructed
in [13]. The simulation results are shown in Fig. 1. We observe
that with 3-bit non-uniform quantization: 1) the presented
algorithm can outperform other two hard-reliability based
MLgD algorithms. For example, it achieves about 1.08 dB
and 1.35 dB performance gains respectively, compared to the
IHRB and the wBRB-H algorithms around BER=10−4 ; 2)
the presented algorithm performs very closely to the wBRB,
the IISRB and the RS-IISRB algorithms (within 0.18 dB) but
outperforms the ISRB algorithm.
Example 2: Consider the C256 [255, 175] constructed
in [14]. The simulation results are shown in Fig. 2. It is shown
that: 1) with 4-bit non-uniform quantization, the presented
HI-BRB algorithm can outperform all other algorithms. For
example, it achieves about 0.16 dB, 0.12dB and 0.08 dB per-
formance gains respectively, compared to the wBRB, IISRB
and RS-IISRB algorithms around BER=10−4 ; 2) with 3-bit
non-uniform quantization, the HI-BRB algorithm performs
very closely to the RS-IISRB algorithm (within 0.02 dB);
while it can still outperform other decoding algorithms.
Note that the presented algorithm is particularly efficient
for decoding NB-LDPC codes with relative large column
weight (say, larger than 9); when decoding those with small
column weights, it may suffer serious error-floor.
In this letter, we have presented a new variant of the original
wBRB algorithm, called the HI-BRB algorithm for the NB-
LDPC codes. Simulation results show that the HI-BRB algo-
rithm can perform very closely to the original wBRB algorithm
with low quantization bits. For codes constructed in high order
fields, the presented algorithm can even outperform the wBRB
algorithm. However, the HI-BRB algorithm requires lower
complexity and less memory consumption compared with the
wBRB algorithm and some existing MP/MLgD algorithms.
R EFERENCES
[1] R. G. Gallager, “Low-density parity-check codes,” IEEE Trans. Inf. The-
ory, vol. 8, pp. 21–28, Jan. 1962.
[2] M. C. Davey and D. J. C. MacKay, “Low-density parity-check codes
over GF(q),” IIEEE Commun. Lett., vol. 6, pp. 165–167, Jun. 1998.
[3] L. Barnault and D. Declercq, “Fast decoding algorithm for LDPC over
GF(2q ),” in Proc. of ITW2003, pp. 70–73, 2003.
[4] D. Declercq and M. Fossorier, “Decoding algorithms for nonbinary
LDPC codes over GF(q),” IEEE Trans. Commun., vol. 55, pp. 633–643,
Apr. 2007.
[5] X. Ma et al., “Low complexity X-EMS algorithms for nonbinary LDPC
codes,” IEEE Trans. Commun., vol. 60, pp. 9–13, Jan. 2012.
[6] S. Zhao, Z. Lu, X. Ma, and B. Bai, “A variant of the ems decoding
algorithm for nonbinary LDPC codes,” IEEE Commun. Lett., vol. 17,
pp. 1640–1643, Agu. 2013.
[7] D. Zhao, X. Ma, C. Chen, and B. Bai, “A low complexity decoding
algorithm for majority-logic decodable nonbinary LDPC codes,” IEEE
Commun. Lett., vol. 14, pp. 1062–1064, Nov. 2010.
[8] C.-Y. Chen, Q. Huang, and C.-C. Chao, “Two low-complexity relia-
bilitybased message-passing algorithms for decoding non-binary LDPC
codes,” IEEE Trans. Commun., vol. 58, pp. 3140–3147, Nov. 2010.
[9] C. Xiong and Z. Yan, “Improved iterative soft-reliability-based ma-
joritylogic decoding algorithm for non-binary low-density parity-check
codes,” in Proc. IEEE Signals, Syst. Comput., pp. 894–898, 2011.
[10] C. Xiong and Z. Yan, “Improved iterative hard- and soft-reliability based
majority-logic decoding algorithms for non-binary low-density parity-
check codes,” IEEE Trans. Signal Process., vol. 62, pp. 5449–5457,
Oct. 2014.
[11] Q. Huang, M. Zhang, Z. Wang, and L. Wang, “Bit-reliability based
low-complexity decoding algorithms for non-binary LDPC codes,” IEEE
Trans. Commun., vol. 62, pp. 4230–4240, Dec. 2014.
[12] L. Song, M. Zhang, Q. Huang, and Z. Wang, “Low error-floor majority-
logic decoding based algorithm for non-binary LDPC codes,” in Proc.
IEEE ICC., (London, UK), pp. 4072–7076, Jun. 2015.
[13] X.-Y. Hu, E. Eleftheriou, and D. Arnold, “Regular and irregular pro-
gressive edge-growth tanner graphs,” IEEE Trans. Inf. Theory, vol. 51,
pp. 386–398, Apr. 2005.
[14] L.-Q. Zeng et al., “Constructions of nonbinary cyclic, quasi-cyclic and
regular LDPC codes: A finite geometry approach,” IEEE Trans. Com-
mun., vol. 56, no. 3, pp. 378–387, 2008.

1089-7798 (c) 2015 IEEE. Personal use is permitted, but republication/redistribution requires IEEE permission. See http://www.ieee.org/publications_standards/publications/rights/index.html for more information.