Paper Info
Title
A New Class of Multiple-rate Codes Based on Block Markov Superposition Transmission
Abstract
The Hadamard transform (HT) over the binary field provides a natural way to implement multiplerate codes (referred to as HT-coset codes), where the code length N = 2p is fixed but the code dimension K can be varied from 1 to N−1 by adjusting the set of frozen bits. The HT-coset codes, including Reed- Muller (RM) codes and polar codes as typical examples, can share the same fundamental encoder/decoder architecture with the implementation complexity of order O(N logN). However, to guarantee that all codes with designated rates perform well, HT-coset coding usually requires a sufficiently large code length, which in turn causes difficulties in the determination of which bits are better for being frozen. In this paper, we propose to transmit short HT-coset codes in the so-called block Markov superposition transmission (BMST) manner. At the transmitter, signals are spatially coupled via superposition, resulting in long codes. At the receiver, these coupled signals are recovered by a sliding-window iterative soft successive cancellation decoding algorithm. Most importantly, the performance around or below the bit-error-rate (BER) of 10􀀀5 can be predicted by a simple genie-aided lower bound. Both these bounds and simulation results show that the BMST of short HT-coset codes performs well (within one dB away from the corresponding Shannon limits) in a wide range of code rates.
Year
DOI
Venue
2015
10.1109/TSP.2015.2439234
Signal Processing, IEEE Transactions
Keywords
DocType
Volume
Fast Hadamard transform (HT),iterative soft successive cancellation,multiple-rate codes,short polar codes,spatial coupling.
Journal
PP
Issue
ISSN
Citations 
99
1053-587X
2
PageRank 
References 
Authors
0.38
12
4
Name
Order
Citations
PageRank
Chulong Liang110312.50
Jingnan Hu220.38
Xiao Ma348764.77
Baoming Bai435363.90