This paper investigates the superposition-based cooperative transmission system. In this system, a key point is for the relay node to detect data transmitted from the source node. This issued was less considered in existing literature as the channel is usually assumed to be flat fading and a priori known. In practice, however, the channel is not only a priori unknown but subject to frequency se...

In this paper; we propose a method for generating realistic shadows of virtual objects inserted into a real video sequence. Our aim is to improve and extend the work of [ I ] , which is based on a static camera, to the case of a video sequence. This extension consists of several procedures: calibration of a moving video camera and a graphic camera, removing false shadows occurring due to a shor...

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

ABSTRACT In this paper, we investigate the performance of Turbo Trellis Coded Modulation (TTCM) over AWGN, and Rician channels and assume that phase disturbance is available. As we know Turbo Trellis Coded Modulation (TTCM) is similer to binary turbo codes, but employs Trellis Coded Modulation (TCM) codes which include multi-dimensional codes. The combination of turbo codes with trellis codes l...

Classical Turbo code suffers from high error floor due to its small Minimum Hamming Distance (MHD). Newly-proposed 3D-Turbo code can effectively increase the MHD and achieve a lower error floor by adding a rate-1 post encoder. In 3D-Turbo codes, part of the parity bits from the classical Turbo encoder are further encoded through the post encoder. In this paper, a novel Bit-Interleaved Coded Mod...

Coherent detection of received signals is required for turbo decoding. In this paper, we combine iterative channel estimation with Turbo decoding. Two combinations are considered in this paper. One is called outer-turbo channel estimation (OTCE), in which iterative channel estimation is carried out before turbo decoding. The other is called inner-turbo channel estimation (ITCE), in which channe...

The turbo decoding algorithm is a high-dimensional dynamical system parameterized by a large number of parameters (for a practical realization the turbo decoding algorithm has more than 10 variables and is parameterized by more than 10 parameters). In this chapter we treat the turbo decoding algorithm as a dynamical system parameterized by a single parameter that closely approximates the signal...