• Title/Summary/Keyword: convex combination

Search Result 93, Processing Time 0.028 seconds

Subband Adaptive Algorithm for Convex Combination of LMS based Transversal Filters (LMS기반 트랜스버설 필터의 컨벡스조합을 위한 부밴드 적응알고리즘)

  • Sohn, Sang-Wook;Lee, Kyeong-Pyo;Choi, Hun;Bae, Hyeon-Deok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.1
    • /
    • pp.133-139
    • /
    • 2013
  • Convex combination of two adaptive filters is an efficient method to improve adaptive filter performances. In this paper, a subband convex combination method of two adaptive filters for fast convergence rate in the transient state and low steady state error is presented. The cost function of mixing parameter for a subband convex combination is defined, and from this, the coefficient update equation is derived. Steady state analysis is used to prove the stability of the subband convex combination. Some simulation examples in system identification scenario show the validity of the subband convex combination schemes.

An Efficient Information Fusion Method for Air Surveillance Systems (항공감시시스템을 위한 효율적인 정보융합 기법)

  • Cho, Taehwan;Oh, Semyoung;Lee, Gil-Young
    • Journal of Advanced Navigation Technology
    • /
    • v.20 no.3
    • /
    • pp.203-209
    • /
    • 2016
  • Among the various fields in the communications, navigation, and surveillance/air traffic management (CNS/ATM) scheme, the surveillance field, which includes an automatic dependent surveillance - broadcast (ADS-B) system and a multilateration (MLAT) system, is implemented using satellite and digital communications technology. These systems provide better performance than radar, but still incur position error. To reduce the error, we propose an efficient information fusion method called the reweighted convex combination method for ADS-B and MLAT systems. The reweighted convex combination method improves aircraft tracking performance compared to the original convex combination method by readjusting the weights given to these systems. In this paper, we prove that the reweighted convex combination method always provides better performance than the original convex combination method. Performance from the fusion of ADS-B and MLAT improves an average of 51.51% when compared to the original data.

Multi-loop PID Control Method of Brushless DC Motors via Convex Combination Method

  • Kim, Chang-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.12 no.1
    • /
    • pp.72-77
    • /
    • 2017
  • This paper proposes the explicit tuning rule of multi-loop PID controller for brushless direct current motors to predict the system behaviors in time and frequency domains, using properties of the convex combination method. The convex set of the proposed controllers formulates the envelope to satisfy the performances in time and frequency domains. The final control parameters are determined by solving the convex optimization problem subject to the constraints which are represented as convex set of time domain performances. The effectiveness of the proposed control method is shown in the numerical simulation, in which controller tuning algorithm and dynamics of brushless DC motor are well taken into account.

ON ZEROS OF CERTAIN SUMS OF POLYNOMIALS

  • Kim, Seon-Hong
    • Bulletin of the Korean Mathematical Society
    • /
    • v.41 no.4
    • /
    • pp.641-646
    • /
    • 2004
  • A convex combination of two products with same degree of finitely many finite geometric series with each having even degree does not always have all its zeros on the unit circle. However, in this paper, we show that a polynomial obtained by just adding a finite geometric series multiplied by a large constant to such a convex combination has all its zeros on the unit circle.

On Efficient Estimation of the Extreme Value Index with Good Finite-Sample Performance

  • Yun, Seokhoon
    • Journal of the Korean Statistical Society
    • /
    • v.28 no.1
    • /
    • pp.57-72
    • /
    • 1999
  • Falk(1994) showed that the asymptotic efficiency of the Pickands estimator of the extreme value index $\beta$ can considerably be improved by a simple convex combination. In this paper we propose an alternative estimator of $\beta$ which is as asymptotically efficient as the optimal convex combination of the Pickands estimators but has a better finite-sample performance. We prove consistency and asymptotic normality of the proposed estimator. Monte Carlo simulations are conducted to compare the finite-sample performances of the proposed estimator and the optimal convex combination estimator.

  • PDF

On Convex Combination of Local Constant Regression

  • Mun, Jung-Won;Kim, Choong-Rak
    • Communications for Statistical Applications and Methods
    • /
    • v.13 no.2
    • /
    • pp.379-387
    • /
    • 2006
  • Local polynomial regression is widely used because of good properties such as such as the adaptation to various types of designs, the absence of boundary effects and minimax efficiency Choi and Hall (1998) proposed an estimator of regression function using a convex combination idea. They showed that a convex combination of three local linear estimators produces an estimator which has the same order of bias as a local cubic smoother. In this paper we suggest another estimator of regression function based on a convex combination of five local constant estimates. It turned out that this estimator has the same order of bias as a local cubic smoother.

Mesh Parameterization based on Mean Value Coordinates (중간값 좌표계에 기초한 메쉬 매개변수화)

  • Kim, Hyoung-Seok B.
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.12 no.8
    • /
    • pp.1377-1383
    • /
    • 2008
  • Parameterization of a 3D triangular mesh is a fundamental problem in various applications of geometric modeling and computer graphics. There are two major paradigms in mesh parameterization: energy functional minimization and the convex combination approach. In general, the convex combination approach is wifely used because of simple concept and one-to-one mapping. However, the approach has some problems such as high distortion near the boundary and time complexity. Moreover, the stability of the linear system may not be preserved according to the geometric information of the mesh. In this paper, we present an extension of the convex combination approach based on the mean value coordinates, which resolves the drawbacks of the convex combination approach. This may be a more practical solution because it is able to generate a stable linear system in a short time.

Design of $H_{\infty}$ Controller with Different Weighting Functions Using Convex Combination

  • Kim Min-Chan;Park Seung-Kyu;Kwak Gun-Pyong
    • Journal of information and communication convergence engineering
    • /
    • v.2 no.3
    • /
    • pp.193-197
    • /
    • 2004
  • In this paper, a combination problem of controllers which are the same type of $H_{\infty}$ controllers designed with different weighting functions. This approach can remove the difficulty in the selection of the weighting functions. As a sub-controller, the Youla type of $H_{\infty}$ controller is used. In the $H_{\infty}$ controller, Youla parameterization is used to minimize $H_{\infty}$ norm of mixed sensitivity function by using polynomial approach. Computer simulation results show the robustness improvement and the performance improvement.

Some Optimal Convex Combination Bounds for Arithmetic Mean

  • Hongya, Gao;Ruihong, Xue
    • Kyungpook Mathematical Journal
    • /
    • v.54 no.4
    • /
    • pp.521-529
    • /
    • 2014
  • In this paper we derive some optimal convex combination bounds related to arithmetic mean. We find the greatest values ${\alpha}_1$ and ${\alpha}_2$ and the least values ${\beta}_1$ and ${\beta}_2$ such that the double inequalities $${\alpha}_1T(a,b)+(1-{\alpha}_1)H(a,b)<A(a,b)<{\beta}_1T(a,b)+(1-{\beta}_1)H(a,b)$$ and $${\alpha}_2T(a,b)+(1-{\alpha}_2)G(a,b)<A(a,b)<{\beta}_2T(a,b)+(1-{\beta}_2)G(a,b)$$ holds for all a,b > 0 with $a{\neq}b$. Here T(a,b), H(a,b), A(a,b) and G(a,b) denote the second Seiffert, harmonic, arithmetic and geometric means of two positive numbers a and b, respectively.