• Journal of Communications and Networks
• /
• v.15 no.4
• /
• pp.411-421
• /
• 2013

Digital fountain codes are record-breaking codes for erasure channels. They have many potential applications in both wired and wireless communications. Most existing digital fountain codes operate over binary fields using an iterative belief-propagation (BP) decoding algorithm. In this paper, we propose a new iterative decoding algorithm for both binary and nonbinary fields. The basic form of our proposed algorithm considers both degree-1 and degree-2 check nodes (instead of only degree-1 check nodes as in the original BP decoding scheme), and has linear complexity. Extensive simulation demonstrates that it outperforms the original BP decoding scheme, especially for a small number of source packets. The enhanced form of the proposed algorithm combines the basic form of the algorithm and a guess-based algorithm to further improve the decoding performance. Simulation results demonstrate that it can provide better decoding performance than the guess-based algorithm with fewer guesses, and can achieve decoding performance close to that of the maximum likelihood decoder at a much lower decoding complexity. Last, we show that our nonbinary scheme has the potential to outperform the binary scheme when choosing suitable degree distributions, and furthermore it is insensitive to the size of the Galois field.

• Journal of the Earthquake Engineering Society of Korea
• /
• v.26 no.6
• /
• pp.227-235
• /
• 2022

For a member model in nonlinear structural analysis, a lumped plastic model that idealizes its flexural bending, shear, and axial behaviors by springs with the nonlinear hysteretic model is widely adopted because of its simplicity and transparency compared to the other rigorous finite element methods. On the other hand, a challenging task in its numerical solution is to satisfy the equilibrium condition between nonlinear flexural bending and shear springs connected in series. Since the local forces between flexural and shear springs are not balanced when one or both springs experience stiffness changes (e.g., cracking, yielding, and unloading), the additional unbalanced force due to overshooting or undershooting each spring force is also generated. This paper introduces an iterative scheme for numerical solutions satisfying the equilibrium conditions between flexural bending and shear springs. The effect of equilibrium iteration on analysis results is shown by comparing the results obtained from the proposed method to those from the conventional scheme, where the equilibrium condition is not perfectly satisfied.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.8
• /
• pp.61-66
• /
• 2013

In this paper, we propose an iterative soft dimension reduction based multi-input multi-output (MIMO) detection for coded spatial multiplexing system. In spite of better performance of iterative MIMO detection, its computational complexity gives a significant burden to the receivers. To mitigate this problem, we propose a scheme employing all ordering successive interference cancellation (AOSIC) for hard-decision detection and dimension reduction soft demodulator (DRSD) with iterative decoding for soft-decision detectors, respectively. This scheme can reduce complexity of iterative soft MIMO detection and provide better performance than other conventional detectors.

• Journal of applied mathematics & informatics
• /
• v.29 no.5_6
• /
• pp.1179-1191
• /
• 2011

In this paper, we introduce a new iterative scheme for finding a common element of the set of fixed points of a finite family of strict pseudocontractions and the solution set of pseudomonotone and Lipschitz-type continuous equilibrium problems. The scheme is based on the idea of extragradient methods and fixed point iteration methods. We show that the iterative sequences generated by this algorithm converge strongly to the common element in a real Hilbert space.

• Korean Journal of Mathematics
• /
• v.26 no.1
• /
• pp.129-141
• /
• 2018

In this slush pile, we introduce a new kind of variational inclusions problem stated as random extended generalized nonlinear variational inclusions for random fuzzy mappings. We construct an iterative scheme for the this variational inclusion problem and also discuss the existence of random solutions for the problem. Further, we show that the approximate solutions achieved by the generated scheme converge to the required solution of the problem.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.1140-1145
• /
• 1989

A general dynamic iterative learning control scheme is proposed for a class of nonlinear systems. Relying on stabilizing high-gain feedback loop, it is possible to show the existence of Cauchy sequence of feedforward control input error with iteration numbers, which results in a uniform convergance of system state trajectory to the desired one.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.81-86
• /
• 1991

The iterative learning operation has been utilized in the temperature Control of a batch reactor. A generic form of feedback-assisted first-order learning control scheme was constructed and then various design and operation modes were derived through convergence and robustness analysis in the frequency domain. The proposed learning control scheme was then implemented on a bench scale batch reactor with the heat of reaction simulated by an electric heater. The results show a great improvement in the performance of control as the number of batch operations progressed.

• East Asian mathematical journal
• /
• v.29 no.3
• /
• pp.303-314
• /
• 2013

In this paper, we introduce an iterative scheme for finding a common element of the set of solutions of a generalized equilibrium problem and the set of common fixed points of a finite family of asymptotically ${\kappa}$-strict pseudo-contractions in Hilbert spaces. Weak and strong convergence theorems are established for the iterative scheme.

• East Asian mathematical journal
• /
• v.26 no.3
• /
• pp.337-350
• /
• 2010

Strong convergence theorem of the explicit viscosity iterative scheme involving the sunny nonexpansive retraction for nonexpansive nonself-mappings is established in a reflexive and strictly convex Banach spaces having a weakly sequentially continuous duality mapping. The main result improves the corresponding result of [19] to the more general class of mappings together with certain different control conditions.

• Journal of applied mathematics & informatics
• /
• v.27 no.3_4
• /
• pp.557-566
• /
• 2009

In this paper, we present the three-step mean value iterative scheme and prove that the iteration sequence converge strongly to a common element of the set of fixed points of a nonexpansive mappings and the set of the solutions of the variational inclusions under some mild conditions. The results presented in this paper extend, generalize and improve the results of Noor and Huang and some others.