• The Journal of Korean Institute of Communications and Information Sciences
• /
• 제40권9호
• /
• pp.1728-1730
• /
• 2015

In this letter, a parity check based iterative IC scheme is proposed for LDPC coded MIMO systems. After the decoding procedures in each iteration of the proposed scheme, each decoded codeword is utilized for the IC procedures only when the ratio of the check nodes satisfying the parity check equations to the total number of check nodes is not smaller than the pre-defined threshold value. Simulation results verify that the proposed scheme can achieve an improved BLER at the high SNR region compared to the conventional iterative IC scheme.

• Geophysics and Geophysical Exploration
• /
• 제7권1호
• /
• pp.51-55
• /
• 2004

This paper presents a fast and stable imaging scheme using the localized nonlinear (LN) approximation of integral equation (IE) solutions for inverting electromagnetic data obtained in a crosswell survey. The medium is assumed to be cylindrically symmetric about a source borehole, and to maintain the symmetry a vertical magnetic dipole is used as a source. To find an optimum balance between data fitting and smoothness constraint, we introduce an automatic selection scheme for a Lagrange multiplier, which is sought at each iteration with a least misfit criterion. In this selection scheme, the IE algorithm is quite attractive for saving computing time because Green's functions, whose calculation is a most time-consuming part in IE methods, are repeatedly re-usable throughout the inversion process. The inversion scheme using the LN approximation has been tested to show its stability and efficiency, using both synthetic and field data. The inverted image derived from the field data, collected in a pilot experiment of water-flood monitoring in an oil field, is successfully compared with that derived by a 2.5-dimensional inversion scheme.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• 제31권2호
• /
• pp.211-220
• /
• 2007

This work presents an iterated improved reduced system (IIRS) procedure combined with sub-structuring scheme for large structures. Iterated IRS methods are usually more efficient than others because the dynamic condensation matrix is updated repeatedly until the desired convergent values are obtained. However, using these methods simply for large structures causes expensive computational cost and even makes analyses intractable because of the limited computer storage. Therefore, the application of sub-structuring scheme is necessary. Because the large structures are subdivided into several (or more) sub-domains, the construction of dynamic condensation matrix does not require much computation cost in every iteration. This makes the present method much more efficient to compute the eigenpairs both in lower and intermediate modes. In Part I, iterated IRS method combined with sub-structuring scheme for undamped structures is presented. The validation of the proposed method and the evaluation of computational efficiency are demonstrated through the numerical examples.

• 한국정보통신설비학회:학술대회논문집
• /
• 한국정보통신설비학회 2005년도 하계학술대회
• /
• pp.406-414
• /
• 2005

In this paper, we propose 128bits chaotic block encryption scheme using a PLCM(Piece-wise Linear Chaotic Map) having a good dynamical property. The proposed scheme has a block size of 128 bits and a key size of 128 bits. In proposed scheme we use four 32bi1s sub-keys of session key and four 32bit sub-blocks of block to decide the initial value and the number of iteration of PLCM. The encrypted code is generated from the output of PLCM. With results of test and analyses of security we show the proposed scheme is very secure against statistical attacks and have very good Avalanche Effect and Randomness properties.

• Journal of the Korean Mathematical Society
• /
• 제39권2호
• /
• pp.319-330
• /
• 2002

The method of quasilinearization generates a monotone iteration scheme whose iterates converge quadratically to a unique solution of the problem at hand. In this paper, we apply the method to two families of three-point boundary value problems for second order ordinary differential equations: Linear boundary conditions and nonlinear boundary conditions are addressed independently. For linear boundary conditions, an appropriate Green\`s function is constructed. Fer nonlinear boundary conditions, we show that these nonlinearities can be addressed similarly to the nonlinearities in the differential equation.

• Proceedings of the KIEE Conference
• /
• 대한전기학회 2004년도 학술대회 논문집 정보 및 제어부문
• /
• pp.240-242
• /
• 2004

A channel allocation algorithm of multi-user OFDM(orthogonal frequency division multiplexing) system is presented. The proposed algorithm is to reduce the complexity of the system, using the GNN(gradual neural network) with gradual expansion scheme and the algorithm attempts to allocate channel with good channel gain to each user. The method has lower computational complexity and less iteration than other algorithms.

• Communications for Statistical Applications and Methods
• /
• 제5권3호
• /
• pp.581-589
• /
• 1998

An algorithm is proposed for the $L_1$-estimation with linear equality and inequality constraints in linear regression model. The algorithm employs a linear scaling transformation to obtain the optimal solution of linear programming type problem. And a special scheme is used to maintain the feasibility of the updated solution at each iteration. The convergence of the proposed algorithm is proved. In addition, the updating and orthogonal decomposition techniques are employed to improve the computational efficiency and numerical stability.

• Journal of applied mathematics & informatics
• /
• 제29권3_4호
• /
• pp.603-619
• /
• 2011

To the best of our knowledge, it would probably be the first time in the literature that we clarify the relationship between Yamada's method and viscosity iteration correctly. We design iterative methods based on the hybrid steepest descent algorithms for solving variational inclusions, equilibrium problems. Our results unify, extend and improve the corresponding results given by many others.

• Communications of the Korean Mathematical Society
• /
• 제27권1호
• /
• pp.167-174
• /
• 2012

In this paper, we introduce an asymptotically $\phi$-hemicontractive mapping with a $\phi$-normalized duality mapping and obtain some strongly convergent result of a kind of multi-step iteration schemes for asymptotically $\phi$-hemicontractive mappings.

• East Asian mathematical journal
• /
• 제26권1호
• /
• pp.81-93
• /
• 2010

In this paper, a strong convergence theorem of multi-step iterative schemes with errors for asymptotically quasi-nonexpansive type nonself mappings is established in a real uniformly convex Banach space. Our results extend the corresponding results of Wangkeeree [12], Xu and Noor [13], Kim et al.[1,6,7] and many others.