Performance Comparison of Latency for RSC-RSC and RS-RSC Concatenated Codes

In this paper, we compare the latency of serially concatenated convolutional codes. In particular, we compare RSC-RSC   concatenated codes using non-iterative concatenated Viterbi decoding to RS-RSC concatenated codes using concatenation of Viterbi & Berklelamp-Massey decoding. We have also used puncturing to obtain different code rates & analyzed the effect of code rate on latency. On the basis of simulations, it is shown that RSC-RSC code is better than RS-RSC codes for low latency applications. It is also shown that a trade-off is needed between BER & latency for concatenated codes

Optimal Thresholds for GMD Decoding with (L+1)/L-extended Bounded Distance Decoders

We investigate threshold-based multi-trial decoding of concatenated codes with an inner Maximum-Likelihood decoder and an outer error/erasure (L+1)/L-extended Bounded Distance decoder, i.e. a decoder which corrects e errors and t erasures if e(L+1)/L + t <= d - 1, where d is the minimum distance of the outer code and L is a positive integer. This is a generalization of Forney's GMD decoding, which was considered only for L = 1, i.e. outer Bounded Minimum Distance decoding. One important example for (L+1)/L-extended Bounded Distance decoders is decoding of L-Interleaved Reed-Solomon codes. Our main contribution is a threshold location formula, which allows to optimally erase unreliable inner decoding results, for a given number of decoding trials and parameter L. Thereby, the term optimal means that the residual codeword error probability of the concatenated code is minimized. We give an estimation of this probability for any number of decoding trials.Comment: Accepted for the 2010 IEEE International Symposium on Information Theory, Austin, TX, USA, June 13 - 18, 2010. 5 pages, 2 figure

HybridConcatenated Coding Scheme for MIMO Systems

Abstract: Inthis paper, two hybrid concatenated super-orthogonal space-time trellis codes(SOSTTC) applying iterative decoding are proposed for flat fading channels. Theencoding operation is based on the concatenation of convolutional codes,interleaving and super-orthogonal space-time trellis codes. The firstconcatenated scheme consists of a serial concatenation of a parallelconcatenated convolutional code with a SOSTTC while the second consists ofparallel concatenation of two serially concatenated convolutional and SOSTTCcodes. The decoding of these two schemes is described, their pairwise errorprobabilities are derived and the frame error rate (FER) performances areevaluated by computer simulation in Rayleigh fading channels. The proposedtopologies are shown to perform better than existing concatenated schemes with aconstituent code of convolutional andspace-time codes in literature

On the Construction and Decoding of Concatenated Polar Codes

A scheme for concatenating the recently invented polar codes with interleaved block codes is considered. By concatenating binary polar codes with interleaved Reed-Solomon codes, we prove that the proposed concatenation scheme captures the capacity-achieving property of polar codes, while having a significantly better error-decay rate. We show that for any $\epsilon > 0$, and total frame length $N$, the parameters of the scheme can be set such that the frame error probability is less than $2^{-N^{1-\epsilon}}$, while the scheme is still capacity achieving. This improves upon 2^{-N^{0.5-\eps}}, the frame error probability of Arikan's polar codes. We also propose decoding algorithms for concatenated polar codes, which significantly improve the error-rate performance at finite block lengths while preserving the low decoding complexity