Non-uniform spatial coupling

Jardel, Fanny; Boutros, Joseph J.

doi:10.1109/itw.2014.6970871

Cited by 8 publications

(8 citation statements)

References 21 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [11], a forward layered spatial coupling technique is proposed to improve the threshold boundary of random LDPC ensembles. In the next section, we apply the forward layered spatial coupling to root-LDPC ensembles in order to improve the coding gain and saturate the threshold bound.…”

Section: Density Evolution Of Root-ldpc Ensemblesmentioning

confidence: 99%

“…In this section, in order to improve the coding gain, we propose a spatial coupling structure for root-LDPC based on the coupling structure in [11] for random LDPC ensembles.…”

Section: Spatial Coupling Of Root-ldpc Ensemblesmentioning

confidence: 99%

“…Construction of the partially-coupled root-LDPC ensemble: Our spatial coupling structure is similar to [11]. L copies of (d b , d c ) root-LDPC ensembles are placed in spatial positions l = 1, 2, ..., L to form a chain of length L. Then, extra edges are added to couple the ensembles.…”

Section: Spatial Coupling Of Root-ldpc Ensemblesmentioning

confidence: 99%

“…The technique of forward layered coupling, described in [11], shows a simple coupling method where local edges and coupling edges are treated separately. In this paper, we propose to apply forward layered coupling to root-LDPC codes and study the effect of spatial coupling on their outage boundary in the fading plane.…”

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

Spatial coupling of root-LDPC: Parity bits doping

Dedeoglu

Jardel

Boutros

2015

2015 22nd International Conference on Telecommunications (ICT)

Self Cite

View full text Add to dashboard Cite

Random low-density parity-check (LDPC) ensembles do not achieve full diversity on block-fading channels. To cope with quasi-static fading, a special LDPC structure, known as root-LDPC, has been introduced. A root-LDPC ensemble guarantees that any information bit receives messages from all channel states. Results in the literature show that the gap between the root-LDPC boundary and the capacity boundary in the fading plane is not small enough. In this paper, we propose to saturate the whole root-LDPC boundary via spatial coupling. For simplicity, we adopt an equivalent erasure channel model rather than a block fading model. It is shown that spatial coupling of parity bits only is sufficient to saturate the root-LDPC threshold boundary in the erasure plane.

show abstract

Section: Density Evolution Of Root-ldpc Ensemblesmentioning

confidence: 99%

“…In this section, in order to improve the coding gain, we propose a spatial coupling structure for root-LDPC based on the coupling structure in [11] for random LDPC ensembles.…”

Section: Spatial Coupling Of Root-ldpc Ensemblesmentioning

confidence: 99%

Section: Spatial Coupling Of Root-ldpc Ensemblesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Spatial coupling of root-LDPC: Parity bits doping

Dedeoglu

Jardel

Boutros

2015

2015 22nd International Conference on Telecommunications (ICT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…To decrease the WD complexity and the rate-loss, we introduced nonuniform coupling in [10] to construct codes with w = 2 and w = 3 having good thresholds as well as improved decoding speeds. It was recognized earlier in [11], [12] that nonuniform protographs can lead to improved thresholds in some circumstances by sacrificing a one-sided convergence of the chain, which is not problematic when using WD. A particular exponential coupling was used in [13] to guarantee anytime reliability.…”

Section: Introductionmentioning

confidence: 99%

Spatially Coupled LDPC Codes with Non-uniform Coupling for Improved Decoding Speed

Schmalen

Aref

2019

2019 IEEE Information Theory Workshop (ITW)

View full text Add to dashboard Cite

We consider spatially coupled low-density paritycheck codes with finite smoothing parameters. A finite smoothing parameter is important for designing practical codes that are decoded using low-complexity windowed decoders. By optimizing the amount of coupling between spatial positions, we show that we can construct codes with improved decoding speed compared with conventional, uniform smoothing constructions. This leads to a significantly better performance under decoder complexity constraints while keeping the degree distribution regular. We optimize smoothing configurations using differential evolution and illustrate the performance gains by means of a simulation.

show abstract