• The Journal of the Acoustical Society of Korea
• /
• v.7 no.4
• /
• pp.54-76
• /
• 1988

In Part Ⅰ of the paper, we have developed various block least mean-square (BLMS) adaptive digital filters (ADF's) based on a unified matrix treatment. In Part Ⅱ we analyze the convergence behaviors of the self-orthogonalizing frequency-domain BLMS (FBLMS) ADF and the unconstrained FBLMS (UFBLMS) ADF both for the overlap-save and overlap-add sectioning methods. We first show that, unlike the FBLMS ADF with a constant convergence factor, the convergence behavior of the self-orthogonalizing FBLMS ADF is governed by the same autocorrelation matrix as that of the UFBLMS ADF. We then show that the optimum solution of the UFBLMS ADF is the same as that of the constrained FBLMS ADF when the filter length is sufficiently long. The mean of the weight vector of the UFBLMS ADF is also shown to converge to the optimum Wiener weight vector under a proper condition. However, the steady-state mean-squared error(MSE) of the UFBLMS ADF turns out to be slightly worse than that of the constrained algorithm if the same convergence constant is used in both cases. On the other hand, when the filter length is not sufficiently long, while the constrained FBLMS ADF yields poor performance, the performance of the UFBLMS ADF can be improved to some extent by utilizing its extended filter-length capability. As for the self-orthogonalizing FBLMS ADF, we study how we can approximate the autocorrelation matrix by a diagonal matrix in the frequency domain. We also analyze the steady-state MSE's of the self-orthogonalizing FBLMS ADF's with and without the constant. Finally, we present various simulation results to verify our analytical results.

• Geotechnical Engineering
• /
• v.12 no.6
• /
• pp.87-100
• /
• 1996

This paper verifies the accuracy and efficiency of the implicit stress integration algorithm for an anisotropic hardening constitutive model developed in a companion paper[Oh & Lee (1996)3. Simulation of undrained triaxial test results shows the accuracy of the method through an error estimation, and analyses of accuracy and convergence were performed for a numerical excavation problem. As a result, the stress was accurately integrated by the algorithm and the nonlinear solution was converged to be asymptotically quadratic. Furthermore nonlinear FE analysis of a real excavation problem was by performed considering the initial soil conditions and the in-situ construction sequences. The displacements of wall induced by excavation were more accurately estimated by the anisotropic hardening model than by the Cam-clay model.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.8 no.4
• /
• pp.123-133
• /
• 2005

This study has made photographing respectively by changing the converging angle by use of d7 $metric^5$ that is a measurement digital camera. And also in order to minimize the errors happened at the relative orientation, we have sorted out the round target that the relative orientation is automatically on the programming and have calculated RMSE by carrying out the bundle adjustment. We think that such a study could be used as very important basic data necessary in deriving the optimal photographic conditions by the close-range digital photogrammetry and in judging such a degree.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.2
• /
• pp.85-94
• /
• 2002

In this paper, we show that the 2nd-order iterative learning control algorithm with CITE is more effective and has better convergence performance than the algorithm without CITE in the case of the existence of initialization errors, for the trajectory-tracking control of dynamic systems with unidentified parameters. In contrast to other known methods, the proposed learning control scheme utilize more than one past error history contained in the trajectories generated at prior iterations, and a CITE term is added in the learning control scheme for the enhancement of convergence speed and robustness to disturbances and initialization errors. And the convergence proof of the proposed algorithm in the case of the existence of initialization error is given in detail, and the effectiveness of the proposed algorithm is shown by simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1686-1692
• /
• 2015

This paper proposes a modified genetic algorithm that has the same beamforming performance and a fast convergence speed using general genetic algorithm in order to form a beam for the mobile node in a mesh network. The proposed beamforming genetic algorithm selects a part of chromosome a high fitness value in mating process to obtain fast convergence speed, and rest part of chromosome with longer fitness value in order to avoid local solution. Furthermore, the reference beam pattern with Gaussian shape reduces additional convergence speed. Simulation shows that the convergence speed of proposed algorithm improves 20% compared with that of conventional beamforming genetic algorithm.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.32 no.3
• /
• pp.1-9
• /
• 2004

This study concentrates on the upwind schemes for convergence acceleration of the multigrid method for the Navier-Stokes equations. Comparative study of the upwind schemes in the Fourier space has been performed to identify why the second-order upwind scheme with enlarged stencil can be preconditioned better than the classical second-order upwind scheme. The full-coarsening multigrid method with implicit preconditioned multistage scheme has been implemented for verification of analysis. Numerical simulations on the inviscid and turbulent flows with the Spalart-Allmaras turbulent model have been performed. The results showed consistent trend with the analysis.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.2 s.308
• /
• pp.73-81
• /
• 2006

This paper proposes the improved orthogonal projection method as a new technique advancing the performance of the acoustic echo canceller. Comparing with the widely used NLMS adaptive algorithm which is simple and stable, it shows that this method has the improvement of the convergence speed for signals with the large auto-correlation, and has small computational quantities. In order to testify performances of the orthogonal projection method whom this paper proposes, we have coded a simulation program md executed computer simulations. We observed convergence curves by using two adaptive algorithm for noises and speeches. From simulation results for two input signals, the proposed method shows the high ERLE and the fast convergence and the stable operation in case of using speeches as well as noises.

• Journal for History of Mathematics
• /
• v.22 no.1
• /
• pp.25-40
• /
• 2009

This study concerns with John B. Fourier' s life, his teachers, his younger scholars and the $L^1$-convergence of Fourier series. First, we introduce the correlation between the French Revolution and Fourier who is significant in the history of mathematics. Second, we investigate Fourier' s teachers, students and a minor lineage of his younger scholars from 19th century to 20th century. Finally, we compare the theorem of Telyakovskii with the theorem of kolmogorov on $L^1$-convergence of Fourier series.

• Journal for History of Mathematics
• /
• v.26 no.2_3
• /
• pp.163-176
• /
• 2013

This study concerns Stanojevic's academic works on the $\mathfrak{L}^1$-convergence of Fourier series from 1973 to 2002. We review his academic works. Also, we briefly investigate a simple academic lineage for the researchers of $\mathfrak{L}^1$-convergence of Fourier series until 2012. First, we introduce the classical lineage of the researchers for $\mathfrak{L}^1$-convergence Fourier series in section 2. Second, we investigate the backgrounds of Stanojevic's study at Belgrade University and University of Missouri-Rolla respectively. Finally, we compare and consider the $\mathfrak{L}^1$-convergence theorems of Stanojevic's results from 1973 to 2002 successively. In addition, we compose a the simple lineage of $\mathfrak{L}^1$-convergence of Fourier series from 1973 to 2012.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.6B
• /
• pp.1203-1210
• /
• 1999

Coefficients of the adaptive filter are misadjusted by primary signals which are uncorrelated with reference signals of the adaptive filter. In this paper, the normalized sign algorithm is analyzed and compared with the NLMS algorithm by the steady state performance and the transient characteristics when target signals are included in primary signals. The excess mean square error of the NLMS algorithm is proportional to the power of target signals. That of normalized sign algorithm is proportional to the square root of the target signal power. However, the convergence speed of the normalized sign algorithm is slower than that of NLMS algorithm. In this paper, it is shown that theoretical analysis of the steady state performance and the transient characteristics are well consisted with the results of computer simulation.