• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.73-76
• /
• 1999

In this paper, we propose a new design of turbo decoder. It contains the simple additional unit which automatically decides the number of the iteration by detecting of the reliability value as threshold value. We investigate the relationship between the reliability value and the number of the iteration. We find the optimal threshold value without noticeable loss in performance. As a results of the simulation, it reduces the average number of the iteration compared with the conventional turbo decoder.

• 대한수학회보
• /
• 제53권6호
• /
• pp.1831-1844
• /
• 2016

In this paper, we improve the full-Newton step infeasible interior-point algorithm proposed by Mansouri et al. [6]. The algorithm takes only one full-Newton step in a major iteration. To perform this step, the algorithm adopts the largest logical value for the barrier update parameter ${\theta}$. This value is adapted with the value of proximity function ${\delta}$ related to (x, y, s) in current iteration of the algorithm. We derive a suitable interval to change the parameter ${\theta}$ from iteration to iteration. This leads to more flexibilities in the algorithm, compared to the situation that ${\theta}$ takes a default fixed value.

• Journal of the Korean Data and Information Science Society
• /
• 제19권4호
• /
• pp.1371-1377
• /
• 2008

In this paper, we have employed the variational iteration method to solve the boundary value problems. Numerical results reveal that it is a very effective method compared with the results obtained by using the Adomian decomposition method in Wazwaz, A. M. (2000).

• Kyungpook Mathematical Journal
• /
• 제57권4호
• /
• pp.651-665
• /
• 2017

Some computational fluid dynamics problems concerning the thin films flow of viscous fluid with a free surface and draining or coating fluid-flow problems can be delineated by third-order ordinary differential equations. In this paper, the aim is to introduce the numerical solutions of the boundary value problems of such equations by variational iteration method. In this paper, it is shown that the third-order boundary value problems can be written as a system of integral equations, which can be solved by using the variational iteration method. These solutions are gleaned in terms of convergent series. Numerical examples are given to depict the method and their convergence.

• Journal of applied mathematics & informatics
• /
• 제38권3_4호
• /
• pp.277-290
• /
• 2020

We propose and analyze a chord summation algorithm, which combines the ideas of Viète and Archimedes to calculate the value of π. The error of the algorithm decreases exponentially per iteration and becomes pinched at a critical iteration, depending on the accuracy of the first input value, ${\sqrt{2}}$. The critical iteration is also analyzed.

• Journal of applied mathematics & informatics
• /
• 제31권5_6호
• /
• pp.733-745
• /
• 2013

In this paper, we first propose a new technique of the functional iterative methods VIM (Variational iteration method) and NHPM (New homotopy perturbation method) for solving two-point boundary value problems, and then we compare their numerical results with those of the finite difference method (FDM).

• 한국통신학회논문지
• /
• 제34권6A호
• /
• pp.500-505
• /
• 2009

본 논문에서는 QAM 변조의 계층적 변조 특성을 이용하여 Iterative MIMO 수신기에서 LLR(log likelihood ratio)값을 구하기 위한 낮은 복잡도를 가지는 후보 리스트 발생 기법을 소개한다. QAM 변조는 에러에 강인한 HP(high priority) 심볼과 상대적으로 에러에 약한 LP(low priority) 심볼로 분해할 수 있다. 본 논문에서는 HP 심볼에 대해서는 간단한 ZF 수신기의 output 값과 인접 HP 심볼들을 이용하여 먼저 안테나별로 HP 심볼 리스트를 발생하고, 각 HP 심볼 리스트에 대해서 ML(maximum likelihood)의 검파 성능을 가지는 sphere decoder를 사용하여 LP 심볼 리스트를 발생하여 후보 심볼 리스트를 발생하였다. 두 번째 iteration 이후부터는 채널 디코더에서 피드백되는 apriori 값을 이용하여 후보 심볼 리스트를 발생하였다. 실험의 비교군은 MIMO 채널 용량에 근사적으로 접근하는 list sphere decoder(LSD)를 사용하였다. 전산 실험 결과, 제안하는 후보 리스트 발생 기법은 LSD에 비해서 첫 번째 iteration에서는 BER성능이 다소 떨어지나, iteration 이 진행될수록 LSD에 근접하는 성능을 보였으며, 후보 리스트의 발생 시간도 LSD에 비해서 월등히 우수한 성능을 가짐을 볼 수 있었다. 또한 LLR 계산 시 탐색해야 할 후보 리스트의 개수 역시 LSD에 비해서 적은 값을 가지므로, LLR 계산 시 필요한 연산의 복잡도가 낮음을 확인할 수 있었다.

• 산업공학
• /
• 제24권4호
• /
• pp.274-280
• /
• 2011

Delayed access to surgery may lead to deterioration in the patient condition, poor clinical outcomes, increase in the probability of emergency admission, or even death. The purpose of this work is to decide the number of patients selected from a waiting list and to schedule them in accordance with the operating room capacity in the next period. We formulate the problem as an infinite horizon Markov Decision Process (MDP), which attempts to strike a balance between the patient waiting times and overtime works. Structural properties of the proposed model are investigated to facilitate the solution procedure. The proposed procedure modifies the conventional value iteration method along with the binary search technique. An example of the optimal policy is provided, and computational results are given to show that the proposed procedure improves computational efficiency.

• Kyungpook Mathematical Journal
• /
• 제56권1호
• /
• pp.221-233
• /
• 2016

The present paper proposes a new monotone iteration method for existence as well as approximation of the coupled solutions for a coupled periodic boundary value problem of first order ordinary nonlinear differential equations. A new hybrid coupled fixed point theorem involving the Dhage iteration principle is proved in a partially ordered normed linear space and applied to the coupled periodic boundary value problems for proving the main existence and approximation results of this paper. An algorithm for the coupled solutions is developed and it is shown that the sequences of successive approximations defined in a certain way converge monotonically to the coupled solutions of the related differential equations under some suitable mixed hybrid conditions. A numerical example is also indicated to illustrate the abstract theory developed in the paper.

• Structural Engineering and Mechanics
• /
• 제4권5호
• /
• pp.513-527
• /
• 1996

In this paper, both an approximate expression and an exact expression for the contribution factor of an element to the natural frequency of the finite element discretized system of a structure in general and a membrane in particular have been derived from the energy conservation principle and the finite element formulation of structural eigenvalue problems. The approximate expression for the contribution factor of an element is used to predict and determine the elements to be removed in an iteration since it depends only on the quantities associated with the old system in the iteration. The exact expression for the contribution factor of an element makes it possible to check whether the element is correctly removed at the end of an iteration because it depends on both the old system and the new system in the iteration. Thus, the combined use of the approximate expression and the exact expression allows a considerable number of elements to be removed in a single iteration so that the efficiency of the evolutionary structural optimization method can be greatly improved for solving the natural frequency optimization problem of a structure. A square membrane with different boundary supports has been chosen to investigate the general evolutionary path for the fundamental natural frequency of the structure. The related results indicated that if the objective of a structural optimization is to raise the fundamental natural frequency of the structure to an optimal value, the general evolutionary path during its optimization is that the elements are gradually removed along the direction from the area surrounded by the contour of the highest value to that surrounded by the contour of the lowest value.