2008
DOI: 10.1109/lcomm.2008.071457
|View full text |Cite
|
Sign up to set email alerts
|

Generalized ACE Constrained Progressive Edge-Growth LDPC Code Design

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

2
70
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
3
3
2

Relationship

0
8

Authors

Journals

citations
Cited by 65 publications
(72 citation statements)
references
References 9 publications
2
70
0
Order By: Relevance
“…In this case, if BP algorithm proceeds for more than three iterations, the receive messages of the involved bit nodes v 2 ,v 4 ,v 5 will partly contain its own message sent three iterations before. For this reason, the minimum cycle length in the Tanner Graph, called "girth", has a strong relationship with its BER performance, and is considered as an important metric in LDPC code construction algorithms (PEG, ACE) [7,8].…”
Section: The Bp Algorithm and Effect Of Cyclementioning
confidence: 99%
See 1 more Smart Citation
“…In this case, if BP algorithm proceeds for more than three iterations, the receive messages of the involved bit nodes v 2 ,v 4 ,v 5 will partly contain its own message sent three iterations before. For this reason, the minimum cycle length in the Tanner Graph, called "girth", has a strong relationship with its BER performance, and is considered as an important metric in LDPC code construction algorithms (PEG, ACE) [7,8].…”
Section: The Bp Algorithm and Effect Of Cyclementioning
confidence: 99%
“…The progressive edge-growth (PEG) algorithm [7] is a girth-aware construction method that tries to make shortest cycle as large as possible. Approximate cycle extrinsic (ACE) message degree constraint is further combined into PEG [8] to lower error floor. However, these performance-aware methods do not take hardware implementation into account, which usually result in low efficiency or high complexity.…”
Section: Introductionmentioning
confidence: 99%
“…Several construction algorithms can be found in literature. The most important ones are the random construction (avoiding only length-4 cycles between degree-2 variable nodes), the ACE (approximate cycle extrinsic message degree) algorithm [33], the PEG (progressive edgegrowth) algorithm [34], and the PEG-ACE algorithm [35]. It is widely believed that an irregular variable node degree distribution is the only requirement to provide UEP, see for example [29,30].…”
Section: Necessary Degree Distribution Properties Of Uep-ldpc Codesmentioning
confidence: 99%
“…The reason for such puncturing pattern is explained in Chapter 7. In order to illustrate the principle of uniform puncturing, we give the indices of first ten punctured bits: [2,8,11,14,17,21,27,29,33,39]. Note that the punctured bits are uniformly distributed among the SCNs.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…When designing FL-LDPC codes, short cycles with small ACE should be avoided. The ACE and PEG can be combined to offer a further improvement on the error floor [27].…”
Section: Emd and Acementioning
confidence: 99%