I-Q trellis codes are known to increase the time diversity of coded systems.When I-Q codes are used with multiple transmit antennas, the decoding and performance evaluation requires the construction of the high-complexity super-trellis of the component codes. In the paper, the bit error probability and the design criteria of I-Q space-time (ST) codes are derived using the transfer functions of ...

This paper investigates adaptive bit-interleaved coded modulation (BICM) with different iterative decoding schemes for bandwidth efficient transmission. We assume knowledge of the average channel quality at the transmitter. For a fixed modulation scheme, the bandwidth efficiency can be adapted to the channel quality by changing the channel code rate and the iterative decoding procedure can be o...

A maximum a posteriori probability (MAP) symbol decoding supplemented with iterative decoding is proposed as an effective mean for suppression of intrachannel nonlinearities. The MAP detector, based on Bahl-Cocke-Jelinek-Raviv algorithm, operates on the channel trellis, a dynamical model of intersymbol interference, and provides soft-decision outputs processed further in an iterative decoder. A...

An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.

An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.

Iterative decoding in digital data transmission systems has become very popular with invention of turbo coding [1]. Methods of iterative processing have quickly been realized to be applicable not only to turbo coded signals but also to joint decoding of code-division multiple access (CDMA) systems, intersymbol interference limited channels, multiple-input multiple-output (MIMO) systems, and oth...

Turbo-decoding of nonbinary codes Jens Berkmann and Frank Burkert Dept. of Communications Engineering, Technical University of Munich Arcisstr. 21, 80290 Munich, Germany Email [email protected] Abstract | It is shown how parallel concatenation of nonbinary codes can be put into the same framework of iterative decoding as in the binary case. The turbocode(turbo-decoding-) idea is...

We define analog product codes as a special case of analog parallel concatenated codes. These codes serve as a tool to get some more insight into the convergence of “Turbo” decoding. We prove that the iterative “Turbo”-like decoding of analog product codes indeed is an estimation in the least-squares sense and thus correspond to the optimum maximum-likelihood decoding.

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 14 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 1. Preliminaries . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 1.1. Block Codes . . . . . . . . . . . . . . . . . . . . . . . . . . . . 21 1.1.1. Linear Block Codes . . . . . . . . . . . . . . . . . . 22 1.2. Commun...