Hello world

Iterative decoding of two-dimensional systematic

convolutional codes has been termed turbo (de)coding. Using

log-likelihood algebra, we show that any decoder can he used

which accepts soft inputs-including a priori values-and delivers

soft outputs that can he split into three terms: the soft channel and

a priori inputs, and the extrinsic value. The extrinsic value is used

as an a priori value for the next iteration. Decoding algorithms in

the log-likelihood domain are given not only for convolutional

codes hut also for any linear binary systematic block code.

The iteration is controlled by a stop criterion derived from

cross entropy, which results in a minimal number of iterations.

Optimal and suboptimal decoders with reduced complexity are

presented. Simulation results show that very simple component

codes are sufficient, block codes are appropriate for high rates

and convolutional codes for lower rates less than 213 . Any

combination of block and convolutional component codes is

possible. Several interleaving techniques are described. At a bit

error rate (BER) of lo-* the performance is slightly above or

around the bounds given by the cutoff rate for reasonably simple

block/convolutional component codes, interleaver sizes less than

1000 and for three to six iterations.

Index Terms- Concatenated codes, product codes, iterative

decoding, soft-inlsoft-out decoder, turbo (de)coding.