Improved iterative convergence method in Q-ary LDPC coded high order PR-CPM

The Q-ary low-density parity-check（LDPC） coded high order partial response continuous phase modulation（PR-CPM） with double iterative loops is investigated. This scheme shows significant improvements in power and bandwidth efficiency, but at the expense of long iterative decoding delay and computational complexity induced by the improper match between the demodulator and the decoder. To address this issue, the convergence behavior of Q-ary LDPC coded CPM is investigated for the Q=2 and Q〉2 cases, and an optimized design method based on the extrinsic information transfer chart is proposed to improve the systematic iterative efficiency. Simulation results demonstrate that the proposed method can achieve a perfect tradeoff between iterative decoding delay and bit error rate performance to satisfy real-time applications.

A GLOBAL LINEAR AND LOCAL QUADRATIC SINGLE-STEP NONINTERIOR CONTINUATION METHOD FOR MONOTONE SEMIDEFINITE COMPLEMENTARITY PROBLEMS

A noninterior continuation method is proposed for semidefinite complementarity problem （SDCP）. This method improves the noninterior continuation methods recently developed for SDCP by Chen and Tseng. The main properties of our method are： （i） it is well d.efined for the monotones SDCP; （ii） it has to solve just one linear system of equations at each step; （iii） it is shown to be both globally linearly convergent and locally quadratically convergent under suitable assumptions.

On the generalized Cauchy function and new Conjecture on its exterior singularities

This article studies on Cauchy’s function f （z） and its integral, （2πi）J[ f （z）] ≡ ■C f （t）dt/（t z） taken along a closed simple contour C, in regard to their comprehensive properties over the entire z = x ＋ iy plane consisted of the simply connected open domain D ＋ bounded by C and the open domain D outside C. （1） With f （z） assumed to be C n （n ∞-times continuously differentiable） z ∈ D ＋ and in a neighborhood of C, f （z） and its derivatives f （n） （z） are proved uniformly continuous in the closed domain D ＋ = [D ＋ ＋ C]. （2） Cauchy’s integral formulas and their derivatives z ∈ D ＋ （or z ∈ D ） are proved to converge uniformly in D ＋ （or in D = [D ＋C]）, respectively, thereby rendering the integral formulas valid over the entire z-plane. （3） The same claims （as for f （z） and J[ f （z）]） are shown extended to hold for the complement function F（z）, defined to be C n z ∈ D and about C. （4） The uniform convergence theorems for f （z） and F（z） shown for arbitrary contour C are adapted to find special domains in the upper or lower half z-planes and those inside and outside the unit circle ｜z｜ = 1 such that the four general- ized Hilbert-type integral transforms are proved. （5） Further, the singularity distribution of f （z） in D is elucidated by considering the direct problem exemplified with several typ- ical singularities prescribed in D . （6） A comparative study is made between generalized integral formulas and Plemelj’s formulas on their differing basic properties. （7） Physical sig- nificances of these formulas are illustrated with applicationsto nonlinear airfoil theory. （8） Finally, an unsolved inverse problem to determine all the singularities of Cauchy function f （z） in domain D , based on the continuous numerical value of f （z） z ∈ D ＋ = [D ＋ ＋ C], is presented for resolution as a conjecture.

Painlev-Kuratowski Convergences of the Solution Sets to Perturbed Generalized Systems

In this paper, we obtain the Painleve-Kuratowski Convergence of the efficient solution sets, the weak efficient solution sets and various proper efficient solution sets for the perturbed generalized system with a sequence of mappings converging in a real locally convex Hausdorff topological vector spaces.

Refined Convergents to the Associated Continued Fractions for Binary Sequences

The relation between continued fractions and Berlekamp’s algorithm was studied by some reseachers. The latter is an iterative procedure proposed for decoding BCH codes. However, there remains an unanswered question whether each of the iterative steps in the algorithm can be interpreted in terms of continued fractions. In this paper, we first introduce the so-called refined convergents to the continued fraction expansion of a binary sequence s, and then give a thorough answer to the question in the context of Massey’s linear feedback shift register synthesis algorithm which is equivalent to that of Berlekamp, and at last we prove that there exists a one- to-one correspondence between the n-th refined convergents and the length n segments.