SC-LDPC codes over the block-fading channel: Robustness to a synchronisation offset

Andriyanova, Iryna; Hassan, Najeeb ul; Lentmaier, Michael; Fettweis, Gerhard

doi:10.1109/blackseacom.2015.7185094

Cited by 4 publications

(3 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…First we allowed the burst erasure to take on any length and assumed that its starting position can occur anywhere in the codeword. Bursts of random starting positions have also been investigated in [22], although for different reasons and applications (synchronization). Additionally, we assumed that the parts of the codeword not affected by the burst are affected by a memoryless noise process.…”

Section: Introductionmentioning

confidence: 99%

Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels

Aref

Rengaswamy

Schmalen

2018

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

Regular Spatially-Coupled LDPC (SC-LDPC) ensembles have gained significant interest since they were shown to universally achieve the capacity of binary memoryless channels under low-complexity belief-propagation decoding. In this work, we focus primarily on the performance of these ensembles over binary channels affected by bursts of erasures. We first develop an analysis of the finite length performance for a single burst per codeword and no errors otherwise. We first assume that the burst erases a complete spatial position, modeling for instance node failures in distributed storage. We provide new tight lower bounds for the block erasure probability (PB) at finite block length and bounds on the coupling parameter for being asymptotically able to recover the burst. We further show that expurgating the ensemble can improve the block erasure probability by several orders of magnitude. Later we extend our methodology to more general channel models. In a first extension, we consider bursts that can start at a random location in the codeword and span across multiple spatial positions. Besides the finite length analysis, we determine by means of density evolution the maximum correctable burst length. In a second extension, we consider the case where in addition to a single burst, random bit erasures may occur. Finally, we consider a block erasure channel model which erases each spatial position independently with some probability p, potentially introducing multiple bursts simultaneously. All results are verified using Monte-Carlo simulations.

show abstract

Section: Introductionmentioning

confidence: 99%

Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels

Aref

Rengaswamy

Schmalen

2018

IEEE Trans. Inform. Theory

View full text Add to dashboard Cite

show abstract

“…in an increased required window length and thus also in an increased complexity. Recently, it has been shown that protograph-based LDPC codes can increase the diversity order of block fading channels and are thus good candidates for block erasure channels [7], [8]; however, they require large syndrome former memories if the burst length becomes large. Closely related structures based on protographs have been proposed in [9] which spatially couple the special class of root-check LDPC codes [10] to improve the finite length performance and thresholds.…”

Section: Introductionmentioning

confidence: 99%

Spatially Coupled LDPC codes affected by a single random burst of erasures

Aref

Rengaswamy

Schmalen

2016

2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC)

View full text Add to dashboard Cite

Abstract-Spatially-Coupled LDPC (SC-LDPC) ensembles achieve the capacity of binary memoryless channels (BMS), asymptotically, under belief-propagation (BP) decoding. In this paper, we study the BP decoding of these code ensembles over a BMS channel and in the presence of a single random burst of erasures. We show that in the limit of code length, codewords can be recovered successfully if the length of the burst is smaller than some maximum recoverable burst length. We observe that the maximum recoverable burst length is practically the same if the transmission takes place over binary erasure channel or over binary additive white Gaussian channel with the same capacity. Analyzing the stopping sets, we also estimate the decoding failure probability (the error floor) when the code length is finite.

show abstract

“…For latency constrained comparison using window decoding, see[3],[11].The increase of d IT for SC-LDPC codes come at increase of m cc and, thus, of the decoding latency.…”

mentioning

confidence: 99%

Protograph design for spatially-coupled codes to attain an arbitrary diversity order

Hassan¹,

Andriyanova²,

Lentmaier³

et al. 2015

2015 IEEE Information Theory Workshop - Fall (ITW)

Self Cite

View full text Add to dashboard Cite

This work focuses on the design of SC-LDPC codes for transmission over non-ergodic, block-fading channels. Our main contribution is an algorithm, allowing to start from a (J, K)-regular, uncoupled LDPC ensemble, from which one can recursively build up a protograph-based SC-LDPC ensemble having any target diversity order d. The diversity order is achieved assuming a low-complexity iterative decoding algorithm. The increase of d comes at the cost of increasing the memory constraint (i.e., the coupling parameter) of the SC-LDPC ensemble.

show abstract

SC-LDPC codes over the block-fading channel: Robustness to a synchronisation offset

Cited by 4 publications

References 8 publications

Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels

Finite-Length Analysis of Spatially-Coupled Regular LDPC Ensembles on Burst-Erasure Channels

Spatially Coupled LDPC codes affected by a single random burst of erasures

Protograph design for spatially-coupled codes to attain an arbitrary diversity order

Contact Info

Product

Resources

About