Options
Fast window decoding of BMST codes via step adjustment and universal parity-Check termination
Citation Link: https://doi.org/10.15480/882.17236
Publikationstyp
Conference Paper
Date Issued
2026
Sprache
English
TORE-DOI
Citation
IEEE International Conference on Communications (ICC) 2026
Contribution to Conference
Publisher
IEEE
Peer Reviewed
true
Block Markov Superposition Transmission (BMST) codes are a class of spatially coupled codes, that achieve excellent error correction performance via superposition of simple constituent codes. A BMST encoder consists of an outer basic code and an inner rate-one block-convolutional shift register. The resulting graph representation of the encoder allows slidingwindow decoding, similarly to spatially coupled Low-Density Parity-Check codes. This paper proposes a method to reduce the decoding complexity by adjusting the step size of the sliding window. Furthermore, a low-complexity parity-check-based early termination criterion is introduced, which can be universally applied to recursive BMST structures.
Subjects
Spatially coupled codes
block Markov superposition transmission
sliding-window decoding
DDC Class
006: Special computer methods
621.38: Electronics, Communications Engineering
Publisher‘s Creditline
Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting / republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to server or lists, or reuse of any copyrighted component of this work in other works.
Publication version
acceptedVersion
Loading...
Name
CopyrightReceipt.pdf
Size
104.67 KB
Format
Adobe PDF
Loading...
Name
ICC26_Le_Brüggmann_Mohr_Bauch_HOMEPAGE mit Copryright Note.pdf
Size
563.2 KB
Format
Adobe PDF