1 results
Filters
Settings
Now showing1 - 1 of 1
- Some of the metrics are blocked by yourconsent settings
Item type:Publication, Access status: with files , Fast window decoding of BMST codes via step adjustment and universal parity-Check terminationBlock 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.Publicationtype: Conference Paper97 45