On the Decoding Performance of Spatially Coupled LDPC Codes With Sub-Block Access

DOI10.1109/TIT.2022.3152104zbMATH Open1505.94042arXiv2010.10616OpenAlexW3094361367MaRDI QIDQ5088499

Publication date: 13 July 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: We study spatially coupled LDPC codes that allow access to sub-blocks much smaller than the full code block. Sub-block access is realized by a semi-global decoder that decodes a chosen target sub-block by only accessing the target, plus a prescribed number of helper sub-blocks adjacent in the code chain. This paper develops a theoretical methodology for analyzing the semi-global decoding performance of spatially coupled LDPC codes constructed from protographs. The main result shows that semi-global decoding thresholds can be derived from certain thresholds we define for the single-sub-block graph. These characterizing thresholds are also used for deriving lower bounds on the decoder's performance over channels with variability across sub-blocks, which are motivated by applications in data-storage.

Full work available at URL: https://arxiv.org/abs/2010.10616

zbMATH Keywords

semi-global decoding spatially coupled LDPC codes

Mathematics Subject Classification ID

Source coding (94A29)

Recommendations

This page was built for publication: On the Decoding Performance of Spatially Coupled LDPC Codes With Sub-Block Access

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5088499)