The asymptotic iterative decoding performances of low-density parity-check (LDPC) codes using min-sum (MS) and sum-product (SP) decoding algorithms on memoryless binary-input output-symmetric (MBIOS) channels are analyzed in this paper. For MS decoding, the analysis is done by upper bounding the bit error probability of the root bit of a tree code by the sequence error probability of a subcode ...

The paper introduces a global illumination method that combines continuous and finite-element approaches, preserving the speed of finite-element based iteration and the accuracy of continuous random walks. The basic idea is to decompose the radiance function to a finite-element component that is only a rough estimate and to a difference component that is obtained by Monte-Carlo techniques. Iter...

We show some stability and convergence theorems of the modified Ishikawa iterative sequence with errors for a strongly successively pseudocontractive and strictly asymptotically pseudocontractive mapping in a real Banach space. Additionally, we prove that if T is a uniformly Lipschitzian strongly accretive mapping, the modified Ishikawa iteration sequence with errors converges strongly to the u...

A mapping T : C → C is said to be nonexpansive if ‖Tx − Ty‖ ≤ ‖x − y‖, for all x, y ∈ C. We denote by Fix T {x ∈ C : Tx x} the set of fixed points of T . In the last ten years, many papers have been written on the approximation of fixed point for nonlinear mappings by using some iterative processes see, e.g., 1–18 . An explicit iterative process was initially introduced, in 1967, by Halpern 3 i...