Abstract
The parity-check matrix of a nonbinary (NB) low-density parity-check
(LDPC) code over Galois field ${\rm GF}(q)$ is constructed by assigning nonzero elements from ${\rm GF}(q)$ to the 1s in corresponding binary LDPC code. In this paper, we
state and prove a theorem that establishes a necessary and sufficient
condition that an NB matrix over ${\rm GF}(q),$ constructed by assigning nonzero elements from ${\rm GF}(q)$ to the 1s in the parity-check matrix of a binary quasi-cyclic
(QC) LDPC code, must satisfy in order for its null-space to define a
nonbinary QC-LDPC (NB-QC-LDPC) code. We also provide a general scheme for
constructing NB-QC-LDPC codes along with some other code construction
schemes targeting different goals, e.g., a scheme that can be used to
construct codes for which the fast-Fourier-transform-based decoding
algorithm does not contain any intermediary permutation blocks between bit
node processing and check node processing steps. Via Monte Carlo
simulations, we demonstrate that NB-QC-LDPC codes can achieve a net
effective coding gain of 10.8 dB at an output bit error rate of $10^{-12}$. Due to their structural properties that can be exploited during
encoding/decoding and impressive error rate performance, NB-QC-LDPC codes
are strong candidates for application in optical communications.
© 2009 IEEE
PDF Article
More Like This
Cited By
You do not have subscription access to this journal. Cited by links are available to subscribers only. You may subscribe either as an Optica member, or as an authorized user of your institution.
Contact your librarian or system administrator
or
Login to access Optica Member Subscription