This paper presents the behaviour of a turbo coding scheme when the synchronization parameters are not perfectly estimated. The paper proposes improved MAP decoding algorithms for the situations when the timing and phase error are given by the Gaussian probability distribution. It is shown that relatively simple operations can improve the bit error probability without the need of reconstructing the classical decoding algorithm. I. INTRODUCTION The behaviour of turbo codes is usually tested under the assumption of perfect channel knowledge and perfect synchronization. This assumption is, however, rather unrealistic, since the low signal-to-noise region, where such codes operate, causes a great deal of difficulties when it comes to estimati...
A modified MAP algorithm for decoding turbo codes in Rayleigh fading channels is proposed. The algor...
In this article, we present two versions of a simplifled maximum a posteriori decoding algorithm. Th...
In this paper, we consider a coded transmission over a fre-quency selective channel. In [1, 2], we s...
This paper presents behaviour of a turbo coding scheme when the synchronization parameters are not p...
Turbo codes and their unusual properties have attracted significant attentionof the information theo...
This paper presents the behaviour of a turbo coding scheme when the symbol timing is not perfectly k...
This paper presents the behaviour of a turbo coding scheme when the synchronization parameters are n...
International audienceThis paper concerns a new synchronizing scheme designed for block turbo coded ...
In this work, we focus on channel coding, which is used to correct the errors due to the channel in ...
The introduction of turbo and low-density parity- check (LDPC) codes with iterative decoding that al...
In this letter, we investigate the sensitivity of the iterative maximum a posteriori probability (MA...
ABSTRACT-Turbo coding is an advanced error correction technique widely used in the communications in...
In this paper we address the calculation of performance characteristics of turbo-codes. The aim is t...
An algorithm for decoding turbo codes that combines conventional turbo decoding and list sequence (L...
In this study, the authors consider time-varying block (TVB) codes, which generalise a number of pre...
A modified MAP algorithm for decoding turbo codes in Rayleigh fading channels is proposed. The algor...
In this article, we present two versions of a simplifled maximum a posteriori decoding algorithm. Th...
In this paper, we consider a coded transmission over a fre-quency selective channel. In [1, 2], we s...
This paper presents behaviour of a turbo coding scheme when the synchronization parameters are not p...
Turbo codes and their unusual properties have attracted significant attentionof the information theo...
This paper presents the behaviour of a turbo coding scheme when the symbol timing is not perfectly k...
This paper presents the behaviour of a turbo coding scheme when the synchronization parameters are n...
International audienceThis paper concerns a new synchronizing scheme designed for block turbo coded ...
In this work, we focus on channel coding, which is used to correct the errors due to the channel in ...
The introduction of turbo and low-density parity- check (LDPC) codes with iterative decoding that al...
In this letter, we investigate the sensitivity of the iterative maximum a posteriori probability (MA...
ABSTRACT-Turbo coding is an advanced error correction technique widely used in the communications in...
In this paper we address the calculation of performance characteristics of turbo-codes. The aim is t...
An algorithm for decoding turbo codes that combines conventional turbo decoding and list sequence (L...
In this study, the authors consider time-varying block (TVB) codes, which generalise a number of pre...
A modified MAP algorithm for decoding turbo codes in Rayleigh fading channels is proposed. The algor...
In this article, we present two versions of a simplifled maximum a posteriori decoding algorithm. Th...
In this paper, we consider a coded transmission over a fre-quency selective channel. In [1, 2], we s...