Pseudorandom construction of low-density parity-check codes using linear congruential sequences Academic Article

abstract

• We consider maximal-length linear congruential sequences generated using a simple recursion to generate the bipartite graph of a low-density parity-check (LDPC) code. The main advantage is that the graph structure of the codes (edge connections) can be generated using a recursion, rather than having to store the graph connections in memory, which facilitates hardware implementation of the decoder. For this class of codes, sufficient conditions on the recursion parameters are derived, such that regular LDPC codes can be constructed with no cycles of length four or less. Simulation results show that these codes provide almost the same performance of a constrained pseudorandom construction that explicitly avoids cycles of length less than or equal to four.

authors

• Narayanan, Krishna

published proceedings

• IEEE TRANSACTIONS ON COMMUNICATIONS

altmetric score

• 3

author list (cited authors)

• Prabhakar, A., & Narayanan, K.

citation count

• 17

complete list of authors

• Prabhakar, A||Narayanan, K

publication date

• September 2002

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE TRANSACTIONS ON COMMUNICATIONS  Journal

keywords

• Algebraic Construction
• Linear Congruential Sequences
• Low-density Parity-check (ldpc) Codes

Digital Object Identifier (DOI)

• 10.1109/TCOMM.2002.802537

start page

• 1389

end page

• 1396

volume

• 50

issue

• 9

URL

• http://dx.doi.org/10.1109/tcomm.2002.802537