Salvatore Benedetto

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)
In this paper, we propose a new solution to parallel con-catenation of trellis codes with multilevel amplitude/phase modulations and a suitable bit by bit iterative decoding structure. Examples are given for throughput 2 and 4 bits/sec/Hz with 8PSK, 16QAM, and 64QAM modulations. For parallel concatenated trellis codes in the examples, rate 2/3 and 4/5, 8,(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)
Most embedded software is currently developed using the C programming language, even though its low level of abstraction requires a lot of effort to the programmer. The C++ language is a better choice because: it raises the level of abstraction; it is strongly typed, so it prevents many common programming mistakes; it can be made as efficient as C through(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)
Abs t i-ac t The thc ory of geometracally unaform (CL') sagnal constellations arid lanear codes over groups is applzed t o the case of mdtadtmensaonal PSK szgnals. T h e tables of GU pnrtations of multidamensaonal PSI(constellataons recently found an [l] arc used to construct good GU codes over nonbznary abelann groups ?$' e consader Lx4PSK and LxBPSh'(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)
  • 1