Product codes based on binary block codes are considered. The aim is to use simple block codes as component codes in the constructions. Then, by using interleaving, large codes can be obtained. The fundamental aim of the interleaving is to obtain codes with a structure that is suitable for iterative decoding. We present interleaving strategies for iterative (turbo) decoding of block codes. A si...

Abstract: Since joint source-channel decoding is capable of exploiting the residual redundancy in the source signals for improving the attainable error resilience, it has attracted substantial attention. Motivated by the principle of exploiting the source redundancy at the receiver, in this treatise, the authors study the application of iterative source-channel decoding (ISCD) aided video commu...

It is speculated that the most probable channel noise realizations (instantons) that cause the iterative decoding of lowdensity parity-check codes to fail make the decoding not to converge. A simple example is given of an instanton that is not a pseudo-codeword and causes iterative decoding to cycle. A method of finding the instantons for large number of iterations is presented and tested on Ta...

− In this paper, we investigate an improved upper bound on the bit error probability of turbo codes for the maximum likelihood (ML) decoding with imperfect channel state information (CSI) in a fully interleaved Rayleigh fading channel. The upper bound is based on recently introduced Viterbi & Viterbi bound and is also compared with iterative decoding using the Log-MAP algorithm. It is shown tha...

| A simple receiver structure recently proposed by the authors [1] for convolutional coded M{ary di erential phase shift keying (MDPSK) transmission over at Rayleigh fading channels without channel state information is analyzed in detail. We present a thorough discussion of the iterative decoding procedure, which is referred to as iterative decision{feedback di erential demodulation (iterative ...

We track the density of extrinsic information in iterative turbo decoders by actual density evolution, and also approximate it by consistent Gaussian density functions. The approximate model is verified by experimental measurements. We view the evolution of these density functions through an iterative decoder as a nonlinear dynamical system with feedback. Iterative decoding of turbo codes and o...

This paper presents an adaptive hybrid Chase-like algorithm for Reed-Solomon codes, which is based on the list decoding algorithm. The adaptive hybrid algorithm is based on the reliability threshold to exclude the more reliable bits from being processed by the list decoding algorithm and reduce the complexity of the hybrid algorithm. Simulation results show that the decoding complexities of the...

It is well-known that optimal receivers for many wireless communication systems employ joint channel estimation and decoding. Since this is almost always too computationally complex, we consider iterative receivers that approximate joint estimation and decoding by iterative algorithms. Continuous-valued variables such as the channel phase response are often difficult to handle in these algorith...

In this work, we consider the problem of reduced latency of low-density parity-check (LDPC) codes with iterative detection and decoding (IDD) receiver in multiuser multipleantenna systems. The proposed knowledge-aided IDD (KA-IDD) system employs a minimum mean-square error detector with refined iterative processing and a reweighted belief propagation (BP) decoding algorithm. We present reweight...

This paper investigates the issue of labeling design in the BICM-ID (bitinterleaved coded modulation-iterative decoding) systems with Type-I HARQ (hybrid auto-retransmission request). Based on the EXIT (extrinsic information transfer) chart, an algorithm is developed in search of good labelings that well match with the outer code. The concept of link adaptation is realized by using different la...