• Journal of Power Electronics
• /
• v.18 no.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.

• Bulletin of the Korean Mathematical Society
• /
• v.53 no.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
• /
• v.4 no.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
• /
• v.8 no.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.

• Journal of The Institute of Information and Telecommunication Facilities Engineering
• /
• v.5 no.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.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.27 no.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.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.148-154
• /
• 2010

In this paper, we first review LDPC codes in general and a belief propagation algorithm that works in logarithm domain. LDPC codes, which is chosen 802.11n for wireless local access network(WLAN) standard are required a large number of computation due to large size of coded block and iteration. Therefore, we presented three kinds of low computational algorithm for LDPC codes. First, sequential decoding with partial group is proposed. It has same H/W complexity, and fewer number of iteration's are required at same performance in comparison with conventional decoder algorithm. Secondly, we have apply early stop algorithm. This method is reduced number of unnecessary iteration. Third, early detection method for reducing the computational complexity is proposed. Using a confidence criterion, some bit nodes and check node edges are detected early on during decoding. Through the simulation, we knew that the iteration number are reduced by half using subset algorithm and early stop algorithm is reduced more than one iteration and computational complexity of early detected method is about 30% offs in case of check node update, 94% offs in case of check node update compared to conventional scheme.

• Nuclear Engineering and Technology
• /
• v.50 no.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.

• Proceedings of the KIEE Conference
• /
• 1996.11a
• /
• 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.

• The Journal of the Acoustical Society of Korea
• /
• v.13 no.2
• /
• pp.38-49
• /
• 1994

This paper proposes Echo canceller used in simultaneous two-way ('full-duplex') transmission of data signals over two-wire circuits which can be achieved by using a hybrid coupler. This Echo canceller uses sequential processing instead of parallel processing with conventional adaptive digital filter. This structure reduces the number of multipliers. Thus, this structure is much more suitable for IC implementation. This Echo canceller operates according to the 'Stochastic Iteration Algorithm(SIA).' SIA algorithm has merit of good performance and small hardware requirement.