Full diversity random LDPC codes

Duyck, Dieter; Boutros, Joseph J.; Moeneclaey, Marc

doi:10.1109/scvt.2011.6101300

Cited by 6 publications

(19 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This approach has provided better performance in terms of FER and BER than the works in [7,8]. Duyck et al in [11] proposed the design of a random LDPC codes which are able to achieve full diversity in block-fading channels with F = 2 fadings. Healy and de Lamare in [12] extended the work in [11] for the case of block-fading channels with F = 3 and F = 4 fading per block transmitted.…”

Section: Prior and Related Workmentioning

confidence: 99%

“…Duyck et al in [11] proposed the design of a random LDPC codes which are able to achieve full diversity in block-fading channels with F = 2 fadings. Healy and de Lamare in [12] extended the work in [11] for the case of block-fading channels with F = 3 and F = 4 fading per block transmitted. Uchoa et al in [13] proposed iterative detection and decoding (IDD) algorithms for multiple-input multiple-output (MIMO) systems operating in block fading and fast Rayleigh fading channels.…”

Section: Prior and Related Workmentioning

confidence: 99%

“…Duyck et al in [11] proposed the design of random LDPC codes which are able to achieve full diversity in block-fading channels with F = 2 fading. The principle proposed in [11] is to allow a small reduction in coding rate in order to produce random codes that may achieve the diversity of the channel, i.e.…”

Section: Unstructured Full-diversity Ldpc Codesmentioning

confidence: 99%

“…The principle proposed in [11] is to allow a small reduction in coding rate in order to produce random codes that may achieve the diversity of the channel, i.e. the error rate achieved by the code behaves as 1 SNR 2 .…”

Section: Unstructured Full-diversity Ldpc Codesmentioning

confidence: 99%

“…However, as these codes achieve the desired error rate performance but do not have the maximal rate allowed by the Singleton bound, they may be called full-diversity codes but not blockwise maximum-distance separable (MDS) codes [24]. Specifically, the codes of [11] place the requirements that the nodes associated with the information bits have weight d v = 2 and do not participate in any stopping sets. The code rate is R ∼ = 0.5.…”

Section: Unstructured Full-diversity Ldpc Codesmentioning

confidence: 99%

See 4 more Smart Citations

Structured root-LDPC codes and PEG-based techniques for block-fading channels

Uchôa

Healy

Lamare

2015

J Wireless Com Network

View full text Add to dashboard Cite

In this work, we propose structured root-low-density parity-check (LDPC) codes and design techniques for block-fading channels. In particular, quasi-cyclic root-LDPC codes, irregular repeat-accumulate root-LDPC codes and controlled doping root-LDPC codes based on progressive edge growth (PEG) techniques for block-fading channels are proposed. The proposed root-LDPC codes are both suitable for channels under F = 2, 3 and 4 independent fading per codeword. The performance of the proposed codes is investigated in terms of frame error rate (FER). The proposed root-LDPC codes are capable of achieving the channel diversity and outperform standard LDPC codes. For block-fading channel with F = 2 our proposed PEG-based root-LDPC codes outperform PEG-based LDPC codes by 7.5 dB at a FER close to 10 −3 .

show abstract

Section: Prior and Related Workmentioning

confidence: 99%

Section: Prior and Related Workmentioning

confidence: 99%

Section: Unstructured Full-diversity Ldpc Codesmentioning

confidence: 99%

Section: Unstructured Full-diversity Ldpc Codesmentioning

confidence: 99%

Section: Unstructured Full-diversity Ldpc Codesmentioning

confidence: 99%

See 3 more Smart Citations

Structured root-LDPC codes and PEG-based techniques for block-fading channels

Uchôa

Healy

Lamare

2015

J Wireless Com Network

View full text Add to dashboard Cite

show abstract

Design of LDPC Codes Based on Multipath EMD Strategies for Progressive Edge Growth

Healy

Lamare

2016

IEEE Trans. Commun.

View full text Add to dashboard Cite

Low-density parity-check (LDPC) codes are capable of achieving excellent performance and provide a useful alternative for high performance applications. However, at medium to high signal-to-noise ratios (SNR), an observable error floor arises from the loss of independence of messages passed under iterative graph-based decoding. In this paper, the error floor performance of short block length codes is improved by use of a novel candidate selection metric in code graph construction. The proposed Multipath EMD approach avoids harmful structures in the graph by evaluating certain properties of the cycles which may be introduced in each edge placement. We present Multipath EMD based designs for several structured LDPC codes including quasi-cyclic and irregular repeat accumulate codes. In addition, an extended class of diversity-achieving codes on the challenging block fading channel is proposed and considered with the Multipath EMD design. This combined approach is demonstrated to provide gains in decoder convergence and error rate performance. A simulation study evaluates the performance of the proposed and existing state-of-the-art methods.

show abstract