ETRI Journal, Volume 28, Number 5, October 2006 ABSTRACT⎯The effect of block interleaving in a low density parity check (LDPC)-turbo concatenated code is investigated in this letter. Soft decoding can be used in an LDPC code unlike the conventional Reed-Solomon (RS) code. Thus, an LDPC-turbo concatenated code can show better performance than the conventional RS-turbo concatenated code. Furtherm...

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...

.................................................................................................................................... iv List of Figures ........................................................................................................................ viii List of Symbols ..........................................................................................................

The spectacular performance offered by turbo codes sparked intense interest in them. A considerable amount of research has simplified, formalized, and extended the ideas inherent in the original turbo code construction. Nevertheless, the nature of the relatively simple ad hoc turbo-decoding algorithm has remained something of a mystery. We present a geometric interpretation of the turbo-decodin...

In this paper, secure channel coding schemes based on turbo codes are suggested for time reversal ultra wideband (TR-UWB) systems. Turbo code has the capability of error correction near Shannon’s limit. Adding security to turbo code is an attractive idea since it could reduce the overall processing cost of providing secure coded data and enjoys the advantages of high-speed encryption and decryp...

Iterative exchange of information between a decoder and a front end receiver was shown to improve the performance when comparing to non-iterative approach. This so-called turbo processing may be described using Extrinsic Information Transfer (EXIT) charts which were already used in case of turbo decoders and turbo-equalizers. This work extends the EXIT charts technique to describe the behavior ...

In this contribution we derive the super-trellis structure of turbo codes. We show that this structure and its associated decoding complexity depend strongly on the interleaver applied in the turbo encoder. We provide upper bounds for the super-trellis complexity. Turbo codes are usually decoded by an iterative decoding algorithm, which is suboptimum. Applying the super-trellis structure, we ca...

This contribution considers turbo synchronization, that is to say, the use of soft data information to estimate parameters like carrier phase, frequency, or timing offsets of a modulated signal within an iterative data demodulator. In turbo synchronization, the receiver exploits the soft decisions computed at each turbo decoding iteration to provide a reliable estimate of some signal parameters...

Reliable wireless broadcast with asynchronous data access based on fountain coding is investigated. We review the traditional problem formalization for fountain codes operating on erasure channels and we generalize the problem formalization to arbitrary types of channels. We introduce a novel type of rateless codes based on the turbo principle: the Turbo-Fountain. The TurboFountain is able to c...