Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalisation for fountain codes operating on erasure channels, and we generalise the problem formalisation to more general channels. We introduce a novel type of rateless codes based on the Turbo Principle: the Turbo-Fountain. The Turbo-Fountain is able to consi...

The input-output weight enumeration (distribution) function of the ensemble of serially concatenated turbo codes is derived, where the ensemble is generated by a uniform choice over the interleaver and a uniform choice of the component codes from the set of time varying recursive systematic convolutional codes. The conventional union bound is employed to obtain an upper bound on the bit error p...

Ingmar Land Information and Coding Theory Lab University of Kiel, Germany e-mail: [email protected] http://www.tf.uni-kiel.de/ict Slim Chaoui Institute for Communications Technology Darmstadt University of Technology, Germany e-mail: [email protected] http://www.nesi.e-technik.tu-darmstadt.de Abstract | Two classes of concatenated codes of rate 1/2 and medium code lengths (600, 2000) ar...

A novel source coding scheme based on turbo codes was presented in [1]. Lossless data compression is thereby achieved by puncturing data encoded with a turbo code while checking the integrity of the reconstructed information during compression. In this paper we apply code optimization tools to serially concatenated turbo source codes. The goal of the optimization is to minimize the area of the ...

In this paper, new upper bounds on the maximum attainable minimum Hamming distance of Turbo codes with arbitrary — including the best — interleavers are established using a combinatorial approach. These upper bounds depend on the interleaver length, on the code rate and on the scramblers employed in the encoder. Examples of the new bounds for particular Turbo codes are given and discussed. The ...

We present a bandwidth-efficient channel coding scheme that has an overall structure similar to binary turbo codes, but employs trellis-coded modulation (TCM) codes (including multidimensional codes) as component codes. The combination of turbo codes with powerful bandwidth-efficient component codes leads to a straightforward encoder structure, and allows iterative decoding in analogy to the bi...

Besides their excellent error performance, multi fold turbo codes [1], [2] are attractive options for transmitting multimedia data due to their scalable structure in terms of variable coding frequency and code length. This article introduces a novel unequal error protection scheme that is based on the least complex member of multifold turbo codes, ie two-fold turbo codes, and its application to...

Partially systematic parallel concatenated (turbo) codes of rate 1/2 are considered. These are generated from a classical rate 1/3 turbo code by puncturing both the parity bits and the systematic bits. The so-called “error-floors” of the resulting codes are lower than those of their systematic counterparts. For some puncturing patterns, even the “waterfall region” is shifted to lower signal-to-...