• 제어로봇시스템학회:학술대회논문집
• /
• 1992.10a
• /
• pp.176-181
• /
• 1992

In this paper, an adaptive generalized predictive control(GPC) algorithm which minimizes a N-stage cost function is proposed. The resulting controller is based on GPC algorithm and can be used in unknown plant parameters as the parameters of one step ahead predictor are estimated by recursive least squares method. The estimated parameters are extended to G,P, and F amtrix which contain the parameters of N step ahead predictors. And the minimization of cost function assuming no constraints on future controls results in the projected control increment vector. Hence this adaptive GPC algorithm can be used for either unknown system or varing system parameters, and it is also shown through simulations that the algorithm is robust to the variation of system parameters. This adaptive GPC scheme is shown to have the same stability properties as the deterministic GPC, and requires small amount of calculation compared to other adaptive algorithms which minimize N-stage cost function. Especially, in case that the maximum output horizon is 1, the proposed algorithm can be applicable to direct adaptive GPC.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.4
• /
• pp.220-225
• /
• 1988

A class of adaptive controllers with integral action is proposed, which may riject the offset due to any load disturbance on the plant. Effective integral action and robust identification against the offset can be achieved via the zero-gain predictor. The system is improved, in this paper, to be of more generalized structure, and the detuning control weight which can cope with nonminimum-phase systems is tuned on-line. Discrete-time versions of the improved system are developed, which may be more flexible for the choice of the design parameters. The resulting control systems may also be shown to be robust to the unmodelled dynamics.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1992.06a
• /
• pp.23-28
• /
• 1992

The purpose of this paper is to develop a new adaptive echo canceller improving convergence speed and near-end-talker detection performance of the conventional echo canceller. In a conventional adaptive echo canceller, an adaptive digital filter with TDL(Tapped-Delay Line) structure modelling the echo path uses the LMS(Least Mean Square) algorithm to cote the coefficients, and NET detector using energy comparison method prevents the adaptive digital filter to update the coefficients during the periods of the NET signal presence. The convergence speed of the LMS algorithm depends on the eigenvalue spread ratio of the reference signal and NET detector using the energy comparison method yields poor detection performance if the magnitude of the NET signal is small. This paper presents a new adaptive echo canceller which uses the pre-whitening filter to improve the convergence speed of the LMS algorithm. The pre-whitening filter is realized by using a low-order lattice predictor. Also, a new NET signal detection algorithm is presented, where the start point of the NET signal is detected by computing the cross-correlation coefficient between the primary input and the ADF(Adaptive Digital Filter) output while the end point is detected by using the energy comparison method. The simulation results show that the convergence speed of the proposed adaptive echo canceller is faster than that of the conventional echo canceller and the cross-correlation coefficient yield more accurate detection of the start point of the NET signal.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.8 no.1
• /
• pp.31-36
• /
• 2008

This paper presents adaptive learning data of evolvable neural networks (ENNs) for time series prediction of nonlinear dynamic systems. ENNs are a special class of neural networks that adopt the concept of biological evolution as a mechanism of adaptation or learning. ENNs can adapt to an environment as well as changes in the enviromuent. ENNs used in this paper are L-system and DNA coding based ENNs. The ENNs adopt the evolution of simultaneous network architecture and weights using indirect encoding. In general just previous data are used for training the predictor that predicts future data. However the characteristics of data and appropriate size of learning data are usually unknown. Therefore we propose adaptive change of learning data size to predict the future data effectively. In order to verify the effectiveness of our scheme, we apply it to chaotic time series predictions of Mackey-Glass data.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.920-924
• /
• 2005

This paper presents adaptive learning data of evolvable neural networks (ENNs) for time series prediction of nonlinear dynamic systems. ENNs are a special class of neural networks that adopt the concept of biological evolution as a mechanism of adaptation or learning. ENNs can adapt to an environment as well as changes in the environment. ENNs used in this paper are L-system and DNA coding based ENNs. The ENNs adopt the evolution of simultaneous network architecture and weights using indirect encoding. In general just previous data are used for training the predictor that predicts future data. However the characteristics of data and appropriate size of learning data are usually unknown. Therefore we propose adaptive change of learning data size to predict the future data effectively. In order to verify the effectiveness of our scheme, we apply it to chaotic time series predictions of Mackey-Glass data.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.15 no.3
• /
• pp.1-6
• /
• 1978

This paper deals with speech digitization and bandwidth compression techniques, particularly two predictive coding methods-namely, adaptive diferentia1 pulse code modulation(ADPCM) and adaptive delta modulation (ADM). The principle of a typical adoptive quantizer that is used in ADPCM is explained, and two analysis methods for the adaptive predictor coefficents, block and sequential analyses, are discussed. Also, three companding methods (instantaneous, syllabic, and hybrid companding) that are used in ADM are explained in detail, and their performances are compared. In addition, the performances of ADPCM and ADM as speech coders are compared, and the merits of each coder are discussed.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1991.10a
• /
• pp.111-114
• /
• 1991

This paper proposes an efficient adaptive echo canceller using pilot filter approach to achieve improved convergence speed. The pilot filter is an adaptive filter with only a few filter coefficients to filter the received signal for the purpose of whitening the signal. Thus the convergence speed of the main LMS-TDL filter combined with the pilot filter is improved. In the proposed echo canceller, an adaptive lattice predictor as the pilot filter is used and its inverse filter is used to equalize the distorted near end talker signal. Simulation results for colored signal show that the convergence speed of the proposed echo cancellation algorithm is faster than that of the conventional LMS-TDL echo cancellation algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.5
• /
• pp.59-63
• /
• 2011

We present a lattice transversal joint (LTJ) adaptive filter with fixed reflection coefficients to achieve fast convergence with low complexity. The reflection coefficients of the filter are given by the statistics of speech signals, and the proposed order of the lattice predictor is one. Experimental results confirm that as compared to the adaptive transversal filter, the proposed adaptive filter achieves fast convergence with a negligible increase in complexity. The proposed adaptive filter converges around six times faster than the adaptive transversal filter in case of the band-limited voiced signal from the ITU-T G.168 standard.

• The Journal of the Acoustical Society of Korea
• /
• v.14 no.3
• /
• pp.90-96
• /
• 1995

A new method for autoregressive parameter estimation from noisy observation sequence is presented. This method, termed the AP method, is a result of an attempt to make use of the adaptive predictor which is a simple and reliable way of parameter estimation. It is shown theoretically that, for noisy input, the parameter vector computed from the prediction sequence is closer to that of the original sequence than the noisy input sequence is, under the spectral distortion criterion. Simulation results with the Kalman filter as a noise reduction filter and real speech data supported the theory. Roughly speaking, the performance of the parameter set obtained by the AP method is better than noisy one but worse than the EM iteration results. When the simplicity is considered, it could provide a useful alternative to more complicated parameter estimation methods in some applications.

• Journal of Practical Agriculture & Fisheries Research
• /
• v.13 no.1
• /
• pp.3-17
• /
• 2011

Pipelines of processor have been growing deeper and issue widths wider over the years. If this trend continues, branch misprediction penalty will become very high. Branch misprediction is the single most significant performance limiter for improving processor performance using deeper pipelining. Therefore, more accurate branch predictor becomes an essential part of modem processors for FAFF(Food, Agriculture, Forestry, Fisheries)Information Processing. In this paper, we propose a branch prediction mechanism, using variable length history, which predicts using a bank having higher prediction accuracy among predictions from five banks. Bank 0 is a bimodal predictor which is indexed with the 12 least significant bits of the branch PC. Banks 1,2,3 and 4 are predictors which are indexed with different global history bits and the branch PC. In simulation results, the proposed mechanism outperforms gshare predictors using fixed history length of 12 and 13, up to 6.34% in prediction accuracy. Furthermore, the proposed mechanism outperforms gshare predictors using best history lengths for benchmarks, up to 2.3% in prediction accuracy.