Turbo codes have gained considerable attention since their introduction by Berrou and al. in 1993 due to their near capacity performance and low decoding complexity. The conventional turbo code is a parallel concatenation of two identical recursive systematic convolutional encoders separated by a pseudo-random interleaver. In this work, we propose a modified three Dimensional Turbo Code (3D-TCs...

The serial concatenation of standard convolutional codes with differential spacetime modulation is considered for fast flat fading multiple antenna channels. Decoding is performed iteratively by passing symbol-wise a-posteriori probability information between the decoders of the inner space-time code and the outer convolutional code. An input-output extrinsic information transfer analysis is us...

In this paper we present a new method to decode convolutional codes. The method is based on the Turbo principle which was originally proposed to decode parallel concatenated convolutional codes. It becomes possible because of a reinterpretation of the encoder structure. The newly interpreted code is decoded using an iterative scheme with information exchange between sub-decoders. In a second pa...

| We study the performance of turbo codes for magnetic recording channels using realistic channel models. Our main objective is to provide a benchmark for the future studies on the subject. We examine a variety of schemes including the use of parallel concatenated turbo codes with and without turbo equalization and convolutional codes with an interleaver (can be regarded as a serial concatenati...

Serial Concatenated Convolutional Codes (SCCC) also named Turbo Codes, obtained with different constituent trellis codes are presented with a simple and quick mode of data interleaving. A SCC code has higher error-correction performances than the constituent codes. Optimal convolutional codes are deduced for SCCC. A comparison of the SCCC performances is made using weight enumerating functions.

Abslracf-For any prime-power Q, it is shown that there exist q-ary convolutional codes with the equidistance property that every code word is at the same distance from all code words disagreeing in the information digits to be decoded. These codes are called “uniform codes” and it is shown that they can be encoded in a very simple manner. The block codes most similar to uniform codes are the ma...

In this paper, we present a novel technique based on a mixed Error Correcting Code (ECC)—the convolutional code and the repetition code to enhance the robustness of the embedded watermark. Before embedding, the binary watermark is scanned to one-dimension sequence and later inputted into the (3, 1, 2) convolutional encoder and (3, 1) repetition encoder frame by frame, which will improve the err...

In this paper, we propose and analyze a new hybrid FEC/ARQ scheme using rate compatible punctured serial concatenated convolutional codes (SCCCs) which is suitable for flat-fading channels. Puncturing increases the transmitted code rate, and the rate compatibility criterion allows incremental redundancy to be transmitted after each decoding failure according to a code-combining type-II Hybrid A...

Let C be a rate (n ? r)=n convolutional code with canonical parity-check matrix H(D), and let w 0 denote the minimum average weight per edge over all nonzero cycles in the state diagram for C. The rate of growth per edge of the minimum distance between two nonmerged codewords is given by the value of w 0. For any code C, we show how to obtain an upper bound on w 0 from the columns of H(D). Inde...

A parallel concatenated convolutional coding scheme consists of two constituent systematic convolutional encoders linked by an interleaver. The information bits at the input of the rst encoder are scrambled by the interleaver before entering the second encoder. The codewords of the parallel concatenated code consist of the information bits followed by the parity check bits of both encoders. Par...