Paper Info
Title
Spatial coupling of RUN codes via block Markov superposition transmission
Abstract
In this paper, we propose a simple procedure to construct (decodable) good codes with any given alphabet (of moderate size) for any given (rational) code rate to achieve any given target error performance (of interest) over the additive white Gaussian noise (AWGN) channels. We start with constructing codes over groups for any given code rates. This can be done in an extremely simple way if we ignore the error performance requirement for the time being. Actually, this can be satisfied by repetition (R) codes and uncoded (UN) transmission along with time-sharing technique. The resulting codes are simply referred to as RUN codes for convenience. The encoding/decoding algorithms for RUN codes are almost trivial. In addition, the performance can be easily analyzed. It is not difficult to imagine that a RUN code usually performs far away from the corresponding Shannon limit. Fortunately, the performance can be improved as required by spatially coupling the RUN codes via block Markov superposition transmission (BMST), resulting in the BMST-RUN codes. Simulation results show that the BMST-RUN codes perform well (within one dB away from Shannon limits) for a wide range of code rates.
Year
DOI
Venue
2015
10.1109/HMWC.2015.7353345
2015 International Workshop on High Mobility Wireless Communications (HMWC)
Keywords
Field
DocType
Block Markov superposition transmission (BMST),codes over groups,spatial coupling,time-sharing
Concatenated error correction code,Low-density parity-check code,Fountain code,Turbo code,Block code,Serial concatenated convolutional codes,Expander code,Algorithm,Theoretical computer science,Linear code,Mathematics
Conference
ISSN
Citations 
PageRank 
2469-5564
0
0.34
References 
Authors
9
3
Name
Order
Citations
PageRank
Chulong Liang110312.50
Xiao Ma248764.77
Baoming Bai335363.90