We introduce the notion of the stopping redundancy hierarchy of a linear block code as a measure of the tradeoff between performance and complexity of iterative decoding for the binary erasure channel. We derive lower and upper bounds for the stopping redundancy hierarchy via Lovász’s Local Lemma and Bonferroni-type inequalities, and specialize them for codes with cyclic parity-check matrices. ...

In this paper, we consider possible solutions for noncoherent decoding of concatenated codes with spectrally efficient modulations. Two main classes of schemes are considered. A first class is obtained by concatenating parallel coding schemes with differential encoding. A second class considers serially concatenated coding structures and possible schemes derived from turbo trellis coded modulat...

In this paper we compare the decoding latency, i.e., the delay between the time a channel symbol is received and the time it is decoded, of block and convolutional codes. In particular, we compare low density parity check (LDPC) block codes with iterative message-passing decoding to convolutional codes with Viterbi decoding and stack sequential decoding. On the basis of simulations, we show tha...

An iterative soft input soft output (SISO) decoding algorithm for Reed-Solomon (RS) codes using their binary image representations is presented. The novelty of the iterative algorithm is in reducing a submatrix corresponding to the less reliable bits in the binary parity check matrix of the RS code to a sparse nature before each decoding iteration. The proposed algorithm can geometrically be in...

New decoding algorithms for binary linear codes based on the concave-convex procedure are presented. Numerical experiments show that the proposed decoding algorithms surpass Belief Propagation (BP) decoding in error performance. Average computational complexity of one of the proposed decoding algorithms is only a few times greater than that of the BP decoding. key words: concave-convex procedur...

In this paper a truncated turbo decoding with reduced computational complexity is proposed. In the course of iterative decoding, bits are detected that will be changed very unlikely in the current iteration step. These bits are excluded from decoding (in the current iteration step) which yields a turbo decoding with much lower complexity while the loss of bit error rate (BER) is quiet small.

LDPC convolutional codes have been shown to be capable of achieving the same capacity-approaching performance as LDPC block codes with iterative message-passing decoding. However, traditional means of comparing block and convolutional codes tied to the implementation complexity of trellisbased decoding are irrelevant for message-passing decoders. In this paper, we undertake a comparison of LDPC...

Orthogonal Modulation and FEC Rupert Herzog, Andreas Schmidbauer and Joachim Hagenauer Department of Communications Engineering (LNT), Technical University of Munich (TUM), Arcisstr. 21, D-80290 Munich, Germany email: frupert, andreas, [email protected] ABSTRACT: Iterative decoding is applied to code division multiple access (CDMA) systems with two-stage serial concatenated chan...