Block Markov Superposition Transmission of Repetition and Single-Parity-Check Codes

Hu, Jingnan; Ma, Xiao; Liang, Chulong

doi:10.1109/lcomm.2014.2382588

Cited by 21 publications

(11 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The construction of BMST codes is flexible, in the sense that it applies to any short basic codes. Hence, it delivers a wide range of code rates with Hadamard transform coset codes as the basic codes [18] and essentially all code rates of interest in the interval (0, 1) with basic codes consisting of repetition codes and single-parity-check codes [19]. The BMST codes are also capable of supporting a wide range of delays but with a small amount of extra implementation complexity [20].…”

Section: Introductionmentioning

confidence: 99%

Successive Cancellation List Decoding of Semi-random Unit Memory Convolutional Codes

Lin¹,

Cai²,

Wei³

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we propose a statistical learning aided list decoding algorithm, which integrates a serial list Viterbi algorithm (SLVA) with a soft check instead of the conventional cyclic redundancy check (CRC), for semi-random block oriented convolutional codes (SRBO-CCs). The basic idea is that, compared with an erroneous candidate codeword, the correct candidate codeword for the first sub-frame has less effect on the output of Viterbi algorithm (VA) for the second sub-frame. The threshold for testing the correctness of the candidate codeword is then determined by learning the statistical behavior of the introduced empirical divergence function (EDF). With statistical learning aided list decoding, the performance-complexity tradeoff and the performance-delay tradeoff can be achieved by adjusting the statistical threshold and extending the decoding window, respectively. To analyze the performance, a closed-form upper bound and a simulated lower bound are derived. Simulation results verify our analysis and show that: 1) The statistical learning aided list decoding outperforms the sequential decoding in high signal-to-noise ratio (SNR) region; 2) under the constraint of equivalent decoding delay, the SRBO-CCs have comparable performance with the polar codes.

show abstract

Section: Introductionmentioning

confidence: 99%

Successive Cancellation List Decoding of Semi-random Unit Memory Convolutional Codes

Lin¹,

Cai²,

Wei³

et al. 2019

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…However, due to the weakness of SPC codes, it usually requires large encoding memories to approach Shannon limit. For example, an encoding memory (see the following section for its definition) of 33 is needed at rate 2/10 (see Table II in [4]). Moreover, large encoding memories lead to large decoding complexities and delays.…”

Section: Introductionmentioning

confidence: 99%

“…. Recently, a new coding technique called block Markov superposition transmission (BMST) was proposed in [3], based on which a new class of fixed-length multiple-rate codes was constructed by BMST of repetition (R) and single-parity-check (SPC) codes [4]. Simulation results show that the resulting BMST-RSPC codes can perform close to Shannon limits over a wide range of code rates.…”

mentioning

confidence: 99%

Multiple‐rate codes from block Markov superposition transmission of first‐order Reed–Muller and extended Hamming codes

et al. 2016

View full text Add to dashboard Cite

Block Markov superposition transmission (BMST) of first-order Reed-Muller and extended Hamming (RMEH) codes is investigated. Multiple code rates can be easily realised by adjusting the mixture ratio of Reed-Muller and extended Hamming codes. Compared with the original BMST of repetition and single-parity-check (RSPC) codes, the proposed BMST-RMEH codes can perform close to Shannon limits over a wide range of code rates with about only half the encoding memories of BMST-RSPC codes. As a result of the reduction of encoding memories, the decoding complexity and delay of BMST-RMEH codes are approximately half (or even lower than) those of BMST-RSPC codes.

show abstract

“…In [21], short Hadamard transform (HT) codes are taken as the basic codes, resulting in a class of multiplerate codes with fixed code length, referred to as BMST-HT codes. An even simpler construction for multiple-rate BMST codes was proposed in [22], where the involved basic codes consist of repetition (R) codes and single-parity-check (SPC) codes, resulting in BMST-RSPC codes.…”

Section: Introductionmentioning

confidence: 99%

Systematic Block Markov Superposition Transmission of Repetition Codes

Huang

Bai

2016

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper, we propose systematic block Markov superposition transmission of repetition (BMST-R) codes, which can support a wide range of code rates but maintain essentially the same encoding/decoding hardware structure. The systematic BMST-R codes resemble the classical rate-compatible punctured convolutional (RCPC) codes, except that they are typically non-decodable by the Viterbi algorithm due to the huge constraint length induced by the block-oriented encoding process. The information sequence is partitioned equally into blocks and transmitted directly, while their replicas are interleaved and transmitted in a block Markov superposition manner. By taking into account that the codes are systematic, we derive both upper and lower bounds on the bit-error-rate (BER) under maximum a posteriori (MAP) decoding. The derived lower bound reveals connections among BER, encoding memory and code rate, which provides a way to design good systematic BMST-R codes and also allows us to make trade-offs among efficiency, performance and complexity. Numerical results show that: 1) the proposed bounds are tight in the high signal-to-noise ratio (SNR) region; 2) systematic BMST-R codes perform well in a wide range of code rates; and 3) systematic BMST-R codes outperform spatially coupled low-density parity-check (SC-LDPC) codes under an equal decoding latency constraint.

show abstract

Block Markov Superposition Transmission of Repetition and Single-Parity-Check Codes

Cited by 21 publications

References 10 publications

Successive Cancellation List Decoding of Semi-random Unit Memory Convolutional Codes

Successive Cancellation List Decoding of Semi-random Unit Memory Convolutional Codes

Multiple‐rate codes from block Markov superposition transmission of first‐order Reed–Muller and extended Hamming codes

Systematic Block Markov Superposition Transmission of Repetition Codes

Contact Info

Product

Resources

About