A Low-Complexity Decoder With Non-Uniform Quantization for Recursive BMST Codes

Recursive block Markov superposition transmission (rBMST) can be used to construct high-performance spatially coupled codes. When used in power-limited scenarios, low-complexity quantized decoders are required for the rBMST codes. In this letter, we introduce an efficient decoder for rBMST codes by...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE communications letters Vol. 25; no. 8; pp. 2463 - 2467
Main Authors:	Ai, Shengbo, Zhao, Shancheng
Format:	Journal Article
Language:	English
Published:	New York IEEE 01.08.2021 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms Complexity Complexity theory Decoders Decoding Encoding Floating point arithmetic Heuristic algorithms Iterative decoding Low complexity decoding Measurement min-sum algorithm Mutual information non-uniform quantization Quantization (signal) recursive block Markov superposition transmission (BMST) codes
ISSN:	1089-7798, 1558-2558
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!