• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.17 no.1
• /
• pp.83-88
• /
• 2017

This paper related with the performance evaluation of H-MMA (Hybrid-MMA) which is applying the adaptive modulus and adaptive step size concept to MMA adaptive equalization algorithm in order to reduce the intersymbol interference that is occurred in communication channel for digital code transmission. In the conventional MMA adaptive equalizer, the coefficient is updated by using the equalizer output and possible to compensation of amplitude and phase in 2nd dimensional QAM signal, the equalization performance were degraded due to fixed modulus and step size. For the overcomming the abovemensioned problem, it is possible to improving the equalization performance in the 2nd dimensional QAM signal by applying the adaptive modulus and adaptive step size propotional to equalizer output signal to the conventional MMA algorithm. The computer simulation was performed in the same channel for the compare the performance of MMA and proposed H-MMA which is proposed in this paper. As a result of simulation, the proposed H-MMA has slower convergence time in order to arriving the steady state than MMA. But after the steady state, H-MMA has more superior to the MMA in every performance index and the equalization noise was reduced.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.5
• /
• pp.107-113
• /
• 2019

This paper proposes the Hybrid-CRMMA adaptive equalization algorithm that is possible to improves the performance of CR-MMA based on adaptive modulus and adaptive stepsize. The 16-QAM nonconstant modulus signal is reduced to 4-QAM constant modulus signal, and the error signal were obtained based on the fixed statistic modulus of transmitted signal. It is possible to improving the currently MMA adaptive equalization performance. The proposed Hybrid-CRMMA composed of adaptive modulus which is propotional to the power of equalizer output and adaptive stepsize which is function of the nonlinearties of error signal, and its improved equalization performance were confirmed by computer simulation. For this purpose, the output signal constellation, the residual isi and maximum distortion and MSE that is for the convergence characteristics, the SER that is meaning the robustness of external noise of algorithm were used. As a result of computer simulation, it was confirmed that the proposed Hybrid-CRMMA has more superior performance in every index compared to currently CR-MMA.

• Journal of Internet Computing and Services
• /
• v.22 no.1
• /
• pp.1-11
• /
• 2021

Estimation of distribution algorithm (EDA) is a popular stochastic metaheuristic algorithm. EDA has been widely utilized in various optimization problems. However, it has been shown that the diversity of the population gradually decreases during the iterations, which makes EDA easily lead to premature convergence. This article introduces a hybrid estimation of distribution algorithm (EDA) with differential evolution (DE) based on self-adaptive strategy, namely HEDADE-SA. Firstly, an alternative probability model is used in sampling to improve population diversity. Secondly, the proposed algorithm is combined with DE, and a self-adaptive strategy is adopted to improve the convergence speed of the algorithm. Finally, twenty-five benchmark problems are conducted to verify the performance of HEDADE-SA. Experimental results indicate that HEDADE-SA is a feasible and effective algorithm.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2005.11a
• /
• pp.250-255
• /
• 2005

In this paper, we propose a new fast running FIR filter structure that improves the convergence speed of adaptive signal processing and reduces the computational complexity. The proposed filter is applied to wavelet based adaptive algorithm. Actually we compared the performance of the proposed algorithm with other algorithm using computer simulation of adaptive noise canceler based on synthesis speech. As the result, the frequency domain algorithm is prefer than the existent time domain. we analyzed the Wavelet algorithm, short-length fast running FIR algorithm, fast-short-length fast running FIR algorithm and proposed algorithm.

• Journal of Power Electronics
• /
• v.16 no.6
• /
• pp.2212-2220
• /
• 2016

Based on the conventional PID algorithm and the adaptive PID (AD-PID) algorithm, a separate sampling adaptive PID (SSA-PID) algorithm is proposed to improve the transient response of digitally controlled DC-DC converters. The SSA-PID algorithm, which can be divided into an oversampled adaptive P (AD-P) control and an adaptive ID (AD-ID) control, adopts a higher sampling frequency for AD-P control and a conventional sampling frequency for AD-ID control. In addition, it can also adaptively adjust the PID parameters (i.e. $K_p$, $K_i$ and $K_d$) based on the system state. Simulation results show that the proposed algorithm has better line transient and load transient responses than the conventional PID and AD-PID algorithms. Compared with the conventional PID and AD-PID algorithms, the experimental results based on a FPGA indicate that the recovery time of the SSA-PID algorithm is reduced by 80% and 67% separately, and that overshoot is decreased by 33% and 12% for a 700mA load step. Moreover, the SSA-PID algorithm can achieve zero overshoot during startup.

• Journal of Institute of Control, Robotics and Systems
• /
• v.2 no.2
• /
• pp.67-72
• /
• 1996

This paper presents a parameter adaptive control law that stabilizes and asymptotically regulates any single-input, linear time-invariant, controllable and observable, discrete-time system when only the upper bounds on the order of the system is given. The algorithm presented in this paper comprises basically a nonlinear state feedback law which is represented by functions of the state vector in the controllable subspace of the model, an adaptive identifier of plant parameters which uses inputs and outputs of a certain length, and an adaptive law for feedback gain adjustment. A new psedu-inverse algorithm is used for the adaptive feedback gain adjustment rather than a least-square algorithm. The proposed feedback law results in not only uniform boundedness of the state vector to zero. The superiority of the proposed algorithm over other algorithms is shown through some examples.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1994.10a
• /
• pp.330-335
• /
• 1994

In this paper, adaprive control and sliding mode control are combined to implement the proposed adaptive sliding mode control(ASMC) algorithm which is new approach to the control of industrial robot manipulator with external disturbances and parameter uncertainties. Adaptive control algorithm is designed by using the principle of the model reference adaptive control method based upon the hyperstability theory. The contribution of this method is that the parameters of the sliding surface are replaced by time varying parameters whose are calculated by an adaptation algorithm, which forces the errors to follow the behavior of a reference error model. Simulation results show that the proposed method not only improves the performance of the system but also reduces the chattering problem of sliding mode control. Consequently, it is expected that the new adaptive sliding mode control algorithm will be suited for various practical applications.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.59 no.2
• /
• pp.476-483
• /
• 2010

If the data are pre-whitened, then gradient adaptive algorithms which are simpler than higher order statistics algorithms can be used in adaptive blind signal estimation. In this paper, we propose a blind subband affine projection algorithm for multiple-input multiple-output adaptive equalization in the blind environments. All of the adaptive filters in subband affine projection equalization are decomposed to polyphase components, and the coefficients of the decomposed adaptive sub-filters are updated by defining the multiple cost functions. An infinite impulse response filter bank is designed for the data pre-whitening. Pre-whitening procedure through subband filtering can speed up the convergence rate of the algorithm without additional computation. Simulation results are presented showing the proposed algorithm's convergence rate, blind equalization and blind signal separation performances.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.681-684
• /
• 2000

Gradient-type algorithms for adaptive IIR notch filters are very attractive in terms of both performances and computational requirements. Generally, it is quite difficult to assess their performances analytically. There have been several trials to analyze such adaptive algorithms as the sign and the plain gradient algorithms for some types of adaptive IIR notch filters, but many of them still remain unexplored. Furthermore, analysis techniques used in those trials can not be directly applied to different types of adaptive IIR notch filters. This paper presents a detailed performance analysis of the sign algorithm for a well-known adaptive IIR notch filter with constrained poles and zeros, which can not be done by just applying the related existing analysis techniques, and therefore has not been attempted yet. The steady-state estimation error and mean square error (MSE) of the algorithm are derived in closed forms. Stability bounds of the algorithm are also assessed. extensive simulations are conducted to support the analytical findings.

• Journal of Korean Institute of Industrial Engineers
• /
• v.38 no.3
• /
• pp.173-181
• /
• 2012

The size and layout of user interface components need to be optimally designed in terms of reachability, visibility, clearance, and compatibility in order for efficient and effective use of products. The present study develops an ergonomic design method which optimizes the size and layout of user interface components using adaptive genetic algorithm. The developed design method determines a near-optimal design which maximizes the aggregated score of 4 ergonomic design criteria (reachability, visibility, clearance, and compatibility). The adaptive genetic algorithm used in the present study finds a near-optimum by automatically adjusting the key parameter (probability of mutation) of traditional genetic algorithm according to the characteristic of current solutions. Since the adaptive mechanism partially helps to overcome the local optimality problem, the probability of finding the near-optimum has been substantially improved. To evaluate the effectiveness of the developed design method, the present study applied it to the user interface design for a portable wireless communication radio.