some algorithms for nding common xed point of a family of mappings isconstructed. indeed, let c be a nonempty closed convex subset of a uniformlyconvex banach space x whose norm is gateaux dierentiable and let {tn} bea family of self-mappings on c such that the set of all common fixed pointsof {tn} is nonempty. we construct a sequence {xn} generated by the hybridmethod and also we give the ...

Recently, noncoherent sequence detection schemes for coded linear and continuous phase modulations have been proposed, which deliver hard decisions by means of a Viterbi algorithm. The current trend in digital transmission systems toward iterative decoding algorithms motivates an extension of these schemes. In this paper, we propose two noncoherent soft-output decoding algorithms. The first sol...

Replica shuffled versions of iterative decoders of low-density parity-check codes and turbo codes are presented in this paper. The proposed schemes can converge faster than standard and plain shuffled approaches. Two methods, density evolution and EXIT charts, are used to analyze the performance of the proposed algorithms. Both theoretical analysis and simulations show that the new schedules of...

In this paper, we extend our work on iterative softinput soft-output (SISO) decoding of high density parity check (HDPC) codes. Edge-local complementation (ELC) is a graph operation which can be used to give structural diversity during decoding with the sum-product algorithm (SPA). We describe the specific subgraphs required for ELC to not increase the weight of the Tanner graph beyond a specif...

The turbo principle (iterative decoding between component decoders) is a general scheme, which we apply to joint source-channel decoding. As a realistic (e.g. speech parameter coding) example we discuss joint source-channel decoding for auto-correlated continuousamplitude source samples. At the transmitter the source samples are quantized and their indexes are appropriately mapped onto bitvecto...

The turbo principle (iterative decoding between component decoders) is a general scheme, which we apply to joint source-channel decoding. As a realistic (e.g. speech parameter coding) example we discuss joint source-channel decoding for auto-correlated continuousamplitude source samples. At the transmitter the source samples are quantized and their indexes are appropriately mapped onto bitvecto...

Today the error correcting codes are present in all the telecom standards, in particular the low density parity check (LDPC) codes. The choice of a good code for a given network is essentially linked to the decoding performance obtained by the bit error rate (BER) curves. This approach requires a significant simulation time proportional to the length of the code, to overcome this problem Exit c...

Analysis and Performance of Iterative Source-Channel Decoding Norbert Görtz Faculty of Engineering, University of Kiel, Kaiserstr. 2, 24143 Kiel / Germany Tel: +49 431 77572 406, Fax: +49 431 77572 403 E-mail: [email protected] Abstract: A new iterative source-channel decoding technique is proposed, which approximates optimal joint source-channel decoding for the channel-encoded quantizer...