This study provides a general diversity analysis for joint complex diversity coding (CDC) and channel coding-based spacetime-frequency codeing is provided. The mapping designs from channel coding to CDC are crucial for efficient exploitation of the diversity potential. This study provides and proves a sufficient condition of full diversity construction with joint three-dimensional CDC and chann...

We show that expander codes attain the capacity of the binary-symmetric channel under iterative decoding. The error probability has a positive exponent for all rates between zero and channel capacity. The decoding complexity grows linearly with code length.

A new iterative decoding method is proposed for fractal image compression. Convergence properties are provided. Experimental results show the superiority of the new method over the conventional decoding procedure.

A class of error correction codes called ‘low-density parity-check (LDPC)’ codes have been the subject of a great deal of recent study in the coding community as a result of their ability to approach Shannon’s fundamental capacity limit. Crucial to the performance of these codes is the use of an ‘iterative’ decoder. These iterative decoders are effectively high-dimensional, nonlinear dynamical ...

We present a unified graphical model framework for describing compound codes and deriving iterative decoding algorithms. After reviewing a variety of graphical models (Markov random fields, Tanner graphs, and Bayesian networks), we derive a general distributed marginalization algorithm for functions described by factor graphs. From this general algorithm, Pearl’s belief propagation algorithm is...

We propose a general class of concatenated errorcorrecting entropy codes and channel codes. In this way we extend and generalize the existing body of work on iterative decoding of entropy and channel codes. Using the structure and properties of serial concatenated codes, we employ error-correcting entropy codes as the outer code, and a convolutional code as the inner code. The generalization fr...

Sequential modeling has been widely used in a variety of important applications including named entity recognition and shallow parsing. However, as more and more real time large-scale tagging applications arise, decoding speed has become a bottleneck for existing sequential tagging algorithms. In this paper we propose 1-best A*, 1-best iterative A*, k-best A* and k-best iterative Viterbi A* alg...

A turbo decoding scheme for a noncoherent, unitary space-time modulated [3] communication system employing an FEC convolutional code is proposed. The channel is assumed to be Rayleigh fading with neither the transmitter nor the receiver knowing the channel coefficients. The convolutional encoder is applied to the information symbols before performing unitary spacetime coding. Treating the combi...

In this paper, we study the reliability of decisions of e Codes, Channel Reliability, e N comm llular, satellite and we also consider two improved versions, named Log-MAP two different or identical Recursi s, connected in p Fig. 1. The turbo encoder with rate 1/3. The first encoder operat ed b e u, i ond encoder p Lucian Andrei Perişoară, and Rodica Stoian th MAP, Log-MAP, Max-Log-MAP and SOVA ...

We consider a simple method to improve the adaptiveness and flexibility of bit-interleaved coded modulation (BICM) with different iterative decoding schemes for bandwidth efficient transmission. The basic idea is to apply different signal constellations and mappings within one code word. The combination of different signal constellations allows a fine adaptation of the data rate to the channel ...