Selective Avoidance of Cycles in Irregular LDPC Code Construction

Tian, Tao; Jones, Christopher R.; Villasenor, John; Wesel, Richard D.

doi:10.1109/tcomm.2004.833048

Cited by 328 publications

(239 citation statements)

References 10 publications

Supporting

Mentioning

229

Contrasting

Order By: Relevance

“…The Extrinsic Message Degree (EMD) of a symbol node set (e.g. a set forming a cycle) is the number of extrinsic check nodes of this symbol node set [7]. A set of symbol nodes with large EMD will require concatenation of an additional nodes to become a stopping set.…”

Section: Code Graph Propertiesmentioning

confidence: 99%

“…A set of symbol nodes with large EMD will require concatenation of an additional nodes to become a stopping set. In a bipartite graph free of degree-1 bit nodes, every stopping set contains cycles [7]. Similarly trapping sets are composed of interconnected cycles (Fig.…”

Section: Code Graph Propertiesmentioning

confidence: 99%

“…Hence, if short cycles are eliminated from the graph, also small stopping sets and trapping sets are eliminated. However, not only the length, but also the connectivity of cycles plays importantroles, because cycles having low EMD are more prone to induce small trapping sets [7]. Minimization of short cycles with low EMD is the basis of many published code construction methods, e.g.…”

Section: Code Graph Propertiesmentioning

confidence: 99%

“…Minimization of short cycles with low EMD is the basis of many published code construction methods, e.g. [7], [8], [17]. In this paper the idea of low-EMD short cycles elimination is adopted for structured GF(q) LDPC codes construction.…”

Section: Code Graph Propertiesmentioning

confidence: 99%

“…[7]- [9]. However, the literature concerning construction methods for structured LDPC codes is still quite poor, especially for the nonbinary codes.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

Construction of Structured Nonbinary Low-Density Parity-Check Codes

Sulek¹

2013

IJEEEE

View full text Add to dashboard Cite

Abstract-Low Density Parity Check (LDPC) codes over nonbinary Galois Fields GF(q) are a generalization of the industrial standard binary LDPC codes for forward error correction in communication and information systems. The nonbinary codes can achieve significantly better performance for short and moderate block lengths. A lot of works concerning "good" LDPC codes parity check matrix construction has been published so far. However, it is well known that efficient partially parallel hardware decoder architectures are allowed only for codes with blockwise partitioned structure of the parity check matrix, called structured codes. In this paper we present a versatile algorithm for construction of codes that are both nonbinary and structured. The proposed algorithm aims at optimizing the code graph (Tanner graph) by reducing the existence of small cycles with low external connectivity, while at the same time selecting appropriate nonzero coefficients from the Galois Field under interest. The algorithm can be used for code construction of any field order, block length and code rate.

show abstract

Section: Code Graph Propertiesmentioning

confidence: 99%

Section: Code Graph Propertiesmentioning

confidence: 99%

Section: Code Graph Propertiesmentioning

confidence: 99%

Section: Code Graph Propertiesmentioning

confidence: 99%

“…[7]- [9]. However, the literature concerning construction methods for structured LDPC codes is still quite poor, especially for the nonbinary codes.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations