• Journal of Power Electronics
• /
• 제18권1호
• /
• pp.92-102
• /
• 2018

A sliding mode control (SMC) for servo motors based on the differential evolution (DE) algorithm, called DE-SMC, is proposed in this study. The parameters of SMC should be designed exactly to improve the robustness, realize the precision positioning, and reduce the steady-state speed error of the servo drive. The main parameters of SMC are optimized using the DE algorithm according to the speed feedback information of the servo motor. The most significant influence factor of the DE algorithm is optimization iteration. A suitable iteration can be achieved by the tested optimization process profile of the main parameters of SMC. Once the parameters of SMC are optimized under a convergent iteration, the system realizes the given performance indices within the shortest time. The experiment indicates that the robustness of the system is improved, and the dynamic and steady performance achieves the given performance indices under a convergent iteration when motor parameters mismatch and load disturbance is added. Moreover, the suitable iteration effectively mitigates the low-speed crawling phenomenon in the system. The correctness and effectiveness of DE-SMC are verified through the experiment.

• 대한수학회보
• /
• 제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 applied mathematics & informatics
• /
• 제4권2호
• /
• pp.487-500
• /
• 1997

In this paper we introduce a multigrid method for solving the nonliear Urysohn integral equation. The algorithm is derived from a discrete resolvent equation which approximates the continuous resolvent equation of the nonlinear Urysohn integral equa-tion. The algorithm is mathematically equivalent to Atkinson's adap-tive twogrid iteration. But the two are different computationally. We show the convergence of the algorithm and its equivalence to Atkinson's adaptive twogrid iteration. in our numerical example we compare our algorithm to other multigrid methods for solving the nonliear Urysohn integral equation including the nonlinear multigrid nethod introduced by hackbush.

• Journal of information and communication convergence engineering
• /
• 제8권2호
• /
• pp.228-233
• /
• 2010

In this paper, the iteration localization algorithm that NLOS signal is iteratively removed to get the exact location in the wireless sensor network is proposed. To evaluate the performance of the proposed algorithm, TDOA location estimation method is used, and readers are located on every 150m intervals with rectangular shape in $300m{\times}300m$ searching field. In that searching field, the error distance is analyzed according to increasing the number of iteration, sub-blink and the estimated sensor node locations which are located in the iteration range. From simulation results, the error distance is diminished according to increasing the number of the sub-blink and iteration with the proposed location estimation algorithm in NLOS environment. Therefore, to get more accurate location information in wireless sensor network in NLOS environments, the proposed location estimation algorithm removing NLOS signal effects through iteration scheme is suitable.

• 정보통신설비학회논문지
• /
• 제5권1호
• /
• pp.25-36
• /
• 2006

This paper discusses the implementation and performance evaluation of a DSP-based digital beamformer using the Texas Instrument TMSC6711 DSP processor for smart antenna applications. Two adaptive beamforming algorithms which served as the brain for the beamformer, the Normalized Least-Mean-Square (NLMS) and the Constant Modulus Algorithms (CMA) were embedded into the processor and evaluated. Result shows that the NLMS-based digital beamformer outperforms the CMA-based digital beamformer: 1)For NLMS algorithm, the antenna steers to the direction of the desired user even at low iteration value and the suppression level towards the interferer increases as the number of iteration increase. For CMA algorithm, the beam radiation pattern slowly steers to the desired user as the number of iteration increased, but at arate slower than NLMS algorithm and the sidelobe level is shown to increases as the number of iteration increase. 2) The NLMS algorithm has faster convergence than CMA algorithm and the error convergence for CMA algorithm sometimes is subject to misadjustment.

• 대한기계학회논문집A
• /
• 제27권4호
• /
• pp.551-558
• /
• 2003

An efficient and reliable subspace iteration algorithm using the block algorithm is proposed. The block algorithm is the method dividing eigenpairs into several blocks when a lot of eigenpairs are required. One of the key for the faster convergence is carefully selected initial vectors. As the initial vectors, the proposed method uses the modified Ritz vectors for guaranteering all the required eigenpairs and the quasi-static Ritz vectors for accelerating convergency of high frequency eigenvectors. Applying the quasi-static Ritz vectors, a shift is always required, and the proper shift based on the geometric average is proposed. To maximize efficiency, this paper estimates the proper number of blocks based on the theoretical amount of calculation in the subspace iteration. And it also considers the problems generated in the process of combining various algorithms and the solutions to the problems. Several numerical experiments show that the proposed subspace iteration algorithm is very efficient, reliable ,and accurate.

• 한국통신학회논문지
• /
• 제35권2C호
• /
• pp.148-154
• /
• 2010

본 연구에서는 무선 랜 표준안인 802.11n에서 채널 부호화 알고리즘으로 채택된 LDPC부호의 복호 알고리즘의 저복잡도에 대해 연구를 하였다. 샤논의 한계에 근접하기 위해서는 큰 블록 사이즈의 LDPC 부호어 길이와 많은 반복횟수를 요구한다. 이는 많은 계산량을 요구하며, 그리고 이에 따른 전력 소비량(power consumption)을 야기시키므로 본 논문에서는 세 가지 형태의 저복잡도 LDPC 복호 알고리즘을 제시한다. 첫째로 큰 블록 사이즈와 많은 반복 횟수는 많은 계산량과 전력 소모량을 요구하므로 성능 손실 없이 반복횟수를 줄일 수 있는 부분 병렬 방법을 이용한 복호 알고리즘, 둘째로 early stop 알고리즘에 대해 연구 하였고, 셋째로 비트 노드 계산과 체크 노드 계산 시 일정한 신뢰도 값보다 크면 다음 반복 시 계산을 하지 않는 early detection 알고리즘에 대해 연구 하였다.

• Nuclear Engineering and Technology
• /
• 제50권6호
• /
• pp.854-859
• /
• 2018

Calculating minimal cut sets is a typical quantification method used to evaluate the top event probability for a fault tree. If minimal cut sets cannot be calculated or if the accuracy of the quantification result is in doubt, the Monte Carlo method can provide an alternative for fault tree quantification. The Monte Carlo method for fault tree quantification tends to take a long time because it repeats the calculation for a large number of samples. Herein, proposal is made to improve the quantification algorithm of a fault tree with circular logic. We developed a top-down iteration algorithm that combines the characteristics of the top-down approach and the iteration approach, thereby reducing the computation time of the Monte Carlo method.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 추계학술대회 논문집 학회본부
• /
• pp.179-181
• /
• 1996

In conventional hydrothermal coordination problem, the lambda-gamma iteration method is generally used for generation schedule. The procedure of classical lambda-gamma iteration method consists of 3 main loops and it is very complex. Therefore, it needs many iterative calculations. This paper proposes an advanced hydrothermal algorithm based on newly developed lambda-gamma iteration method. As lambda calculation loop is removed in the newly developed iteration method, iterative calculations are reduced and whole procedure is simplified. The proposed algorithm is verified on simple system.

• 한국음향학회지
• /
• 제13권2호
• /
• pp.38-49
• /
• 1994

본 논문에서는 3선 가입자 선로상에서 전-이중 데이타 전송시 발생하는 반향을 제거하기 위해서, 기존의 TDL(Tapped Delay Line) 구조와는 다른 반향제거기를 제안하였다. TDL 구조의 반향제거기는 탭 수만큼의 승산기를 이용하여 병렬처리 동작을 수행하는 반면에 본 논문에서 제안한 방식은 단지 2개의 승산기를 이용하여 순차적인 동작을 수행한다. 따라서, 기존의 반향제거기에 있어서의 집적화의 어려움을 개선한 방식이라고 할 수 있다. 본 논문에서 사용한 반향제거 알고리즘으로는 SIA(Stochastic Iteration Algorithm)을 사용하였고 baseband modem에 알맞는 신호율을 처리하도록 설계하였다.