Learn More
Concatenated coding schemes with interleavers consist of a combination of two simple constituent encoders and an interleaver. The parallel concatenation known as " turbo code " has been shown to yield remarkable coding gains close to theoretical limits, yet admitting a relatively simple iterative decoding technique. The recently proposed serial(More)
b In this article, we present two versions of a simplified maximum a posteriori decoding algorithm. The algorithms work in a sliding window form, like the Viterbi algorithm, and can thus be used to decode continuously transmitted sequences obtained by parallel concatenated codes, without requiring code trellis termination. A heuristic explanation is also(More)
The paper investigates nonlinear equalisation using a novel symmetric radial basis function (RBF) network. By explicitly exploiting the inherently symmetric structure of the optimal Bayesian equaliser, the proposed symmetric RBF equaliser can be determined from the received noisy training data. Both a block-data based and a sample-by-sample adaptive(More)
In this paper, we show that a "pragmatic" approach to coded CPM schemes suffers from a significant capacity loss. This loss can be greatly reduced by choosing an appropriate mapping different from natural or Gray, adopted so far. We propose to add to the CPM modulator a linear feedback, optimized through capacity arguments, that permits to achieve(More)
— Concatenated coding schemes consist of the combination of two or more simple constituent encoders and interleavers. The parallel concatenation known as " turbo code " has been shown to yield remarkable coding gains close to theoretical limits, yet admitting a relatively simple iterative decoding technique. The recently proposed serial concatenation of(More)
In a previous paper as presented by Tarable et al. (2004), the authors introduced the concept of mapping functions as a tool to cope with the problem of collision-free memory mappings in turbo and LDPC parallel decoder implementations. In this paper, we address some implementation issues of the original solution, define a dual problem, which can be of high(More)
This paper deals with precode-only (PCO) Raptor and turbo fountain codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. We find an expression for the performance of an ML-decoded PCO Raptor code. The performance parameter is the inefficiency of the code, i.e., the average amount of redundancy needed to decode(More)
This paper deals with precode-only (PCO) Raptor codes and turbo fountain codes used on a noiseless channel, as it is the case for the BEC or the AWGN channel with high SNR. The performance measure for such family of codes is the efficiency, i.e., the amount of redundancy needed to decode the information bits. Following a previous paper, we give an exact(More)
In satellite communication deep space mission are the most challenging mission, where system has to work at very low Eb/No. Concatenated codes are the ideal choice for such deep space mission. ISRO is planning to send unmanned mission for Mars and several deep space missions in future to study and detailed understanding of our own universe. This paper(More)
I n this paper we propose new decoding algorithms to be embedded in the iterative decoding strategy of parallel con-catenated convolutional codes. They are derived from the optimum maximum-a-posteriori algorithm and permit a continuous decoding of the coded sequence without requiring trellis termination of the constituent codes. Two basic versions of the(More)