• Journal of IKEEE
• /
• v.15 no.4
• /
• pp.293-298
• /
• 2011

In the paper, we propose a new CMF(Constant Modulus Fourth) algorithm for WCDMA(Wideband Code Multiple Access) RF(Radio Frequency) Repeater. CMF algorithm is proposed by modifying the CMA(Constant Modulus Algorithm) algorithm and improved performances are achieved by properly adjusting step size values. The steady state MSE(Mean Square Error) performance of the proposed CMF algorithm with step size of 0.35 is about 4dB better than that of the conventional CMA algorithm. And the proposed CMF algorithm requires 400~1100 less iterations than the LMS(Least Mean Square) and NLMS(Normalized Least Mean Square) algorithms at MSE of -25dB.

• Kyungpook Mathematical Journal
• /
• v.53 no.3
• /
• pp.479-495
• /
• 2013

Taking the weighted geometric mean [11] on the cone of positive definite matrix, we propose an iterative mean algorithm involving weighted arithmetic and geometric means of $n$-positive definite matrices which is a weighted version of Carlson mean presented by Lee and Lim [13]. We show that each sequence of the weigthed Carlson iterative mean algorithm has a common limit and the common limit of satisfies weighted multidimensional versions of all properties like permutation symmetry, concavity, monotonicity, homogeneity, congruence invariancy, duality, mean inequalities.

• Journal of information and communication convergence engineering
• /
• v.8 no.2
• /
• pp.159-162
• /
• 2010

This paper presents a new Kurtosis driven Variable Step-Size Normalized Least Mean Square (KVSSN-LMS) algorithm to prevent repeater from oscillation due to feedback signal of radio frequency (RF) repeater. To get better Mean Square Error (MSE) performance, step-size is adjusted using the kurtosis. The proposed algorithm shows the better performance of steady state MSE. The proposed algorithm shows a better ERLE performance than that of KVSS-LMS, VSS-NLMS, NLMS algorithms.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.207-210
• /
• 2009

Edge detection is an important process in low level image processing. But many proposed methods for edge detection are not very robust to the image noise and are not flexible for different images. To solve the both problems, an algorithm is proposed which eliminate the noise by mean shift algorithm in advance, and then adaptively determine the double thresholds based on gradient histogram and minimum interclass variance, With this algorithm, it can fade out almost all the sensitive noise and calculate the both thresholds for different images without necessity to setup any parameter artificially, and choose edge pixels by fuzzy algorithm.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2009.01a
• /
• pp.211-214
• /
• 2009

Edge detection always influenced by noise belong to the original image, therefore need use some methods to sort this issue, mean shift algorithm has the smooth function which suit for the edge detection purpose, so adopted to fade out the unimportant information, and the sensitive noise portions. After this section, use the Canny algorithm to pick up the contour of the objects we focus on, meanwhile select the Soble operator that has the orientation attribute to support the method work well. In final, take experiment and get the perfect result we wanted, make sure this method make sense and better than the sole Edge detection algorithm,

• The Journal of the Acoustical Society of Korea
• /
• v.16 no.3E
• /
• pp.62-68
• /
• 1997

In this paper, a modified adaptive sign (MAS) algorithm based on a mixed norm error criterion is proposed. The mixed norm error criterion of be minimized is constructed as a combined convex function of the mean-absolute error and the mean-absolute error to the third power. A convergence analysis of the MAS algorithm is also presented. Under a set of mild assumptions, a set of nonlinear evolution equations that characterizes the statistical mean and mean-squared behavior of the algorithm is derived. Computed simulations are carried out to verify the validity of our derivations.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.1E
• /
• pp.56-64
• /
• 1995

The least mean fourth (LMF) adaptive algorithm is a stochastic gradient method that minimizes the error in the mean fourth sense. Despite its potential advantages, the algorithm is much less popular than the conventional least mean square (LMS) algorithm in practice. This seems partly because the analysis of the LMF algorithm is much more difficult than that of the LMS algorithm, and thus not much still has been known about the algorithm. In this paper, we explore the statistical convergence behavior of the LMF algorithm when the input to the adaptive filter is zero-mean, wide-sense stationary, and Gaussian. Under a system idenrification mode, a set of nonlinear evolution equations that characterizes the mean and mean-squared behavior of the algorithm is derived. A condition for the conbergence is then found, and it turns out that the conbergence of the LMF algorithm strongly depends on the choice of initial conditions. Performances of the LMF algorithm are compared with those of the LMS algorithm. It is observed that the mean convergence of the LMF algorithm is much faster than that of the LMS algorithm when the two algorithms are designed to achieve the same steady-state mean-squared estimation error.

• The Journal of the Acoustical Society of Korea
• /
• v.25 no.3E
• /
• pp.123-130
• /
• 2006

The adaptive echo canceller (AEC) has become an important component in speech communication systems, including mobile station. In these applications, the acoustic echo path has a long impulse response. We propose a running-average least mean square (RALMS) algorithm with a detection method for acoustic echo cancellation. Using colored input models, the result clearly shows that the RALMS detection algorithm has a convergence performance superior to the least mean square (LMS) detection algorithm alone. The computational complexity of the new RALMS algorithm is only slightly greater than that of the standard LMS detection algorithm but confers a major improvement in stability.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.9
• /
• pp.1058-1064
• /
• 2008

In this paper, we proposed a new hybrid interference canceller using the adaptive filter with Grouped CMA(Constant Modulus Algorithm)-LMS(Least Mean Square) algorithm in the RF(Radio Frequency) repeater. The feedback signal generated from transmitter antenna to receiver antenna reduces the performance of the receiver system. The proposed interference canceller has better channel adaptive performance and a lower MSE(Mean Square Error) than conventional structure because it uses the cancellation method of Grouped CMA algorithm. This structure reduces the number of iterations fur the same MSE performance and hardware complexity compared to conventional nonlinear interference canceller. Namely, MSE values of the proposed algorithm were lower than those of LMS algorithm by 2.5 dB and 4 dB according to step sizes. And the proposed algorithm showed fast speed of convergence and similar MSE performance compared to VSS(Variable Step Size)-LMS algorithm.

• Communications for Statistical Applications and Methods
• /
• v.22 no.4
• /
• pp.321-331
• /
• 2015

The K-means clustering algorithm is a popular and widely used method for clustering. For covariance matrices, we consider a geodesic clustering algorithm based on the K-means clustering framework in consideration of symmetric positive definite matrices as a Riemannian (non-Euclidean) manifold. This paper considers a geodesic clustering algorithm for data consisting of symmetric positive definite (SPD) matrices, utilizing the Riemannian geometric structure for SPD matrices and the idea of a K-means clustering algorithm. A K-means clustering algorithm is divided into two main steps for which we need a dissimilarity measure between two matrix data points and a way of computing centroids for observations in clusters. In order to use the Riemannian structure, we adopt the geodesic distance and the intrinsic mean for symmetric positive definite matrices. We demonstrate our proposed method through simulations as well as application to real financial data.