• Title/Summary/Keyword: adaptive value

Search Result 860, Processing Time 0.025 seconds

Predictive Control Algorithms for Adaptive Optical Wavefront Correction in Free-space Optical Communication

  • Ke, Xizheng;Yang, Shangjun;Wu, Yifan
    • Current Optics and Photonics
    • /
    • v.5 no.6
    • /
    • pp.641-651
    • /
    • 2021
  • To handle the servo delay in a real-time adaptive optics system, a linear subspace system identification algorithm was employed to model the system, and the accuracy of the system identification was verified by numerical calculation. Experimental verification was conducted in a real test bed system. Through analysis and comparison of the experimental results, the convergence can be achieved only 200 times with prediction and 300 times without prediction. After the wavefront peak-to-valley value converges, its mean values are 0.27, 4.27, and 10.14 ㎛ when the communication distances are 1.2, 4.5, and 10.2 km, respectively. The prediction algorithm can effectively improve the convergence speed of the peak-to-valley value and improve the free-space optical communication performance.

Control Design for Flexible Joint Manipulators with Mismatched Uncertainty : Adaptive Robust Scheme

  • Kim, Dong-Hwa
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.1 no.1
    • /
    • pp.32-43
    • /
    • 1999
  • Adaptive robust control scheme is introduced for flexible joint manipulator with nonlinearities and uncertainties. The system does not satisfy the matching condition due to insufficient actuators for each node. The control only relies on the assumption that the bound of uncertainty exists. Thus, the bounded value does not need to be known a prior. The control utilizes the update law by estimating the bound of the uncertainties. The control scheme uses the backstepping method and constructs a state transformation. Also, stability analysis is done for both transformed system and original system.

  • PDF

Cutting Force Estimation and Feedrate Adaptive Control Using Spindle Motor Current (주축전류신호를 이용한 절삭력의 추정과 이송속도 적응제어)

  • 김기대;이성일;권원태;주종남
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.150-156
    • /
    • 1996
  • Static variations of cutting forces are estimated using spindle motor current. Static sensitivity of spindle motor current is higher than feed motor current. The linear relationship between the cutting force and RMS value of the spindle motor current is obtained. Using cutting force estimation, tool overload in milling process can be well detected, and cutting force is regulated at a constant level by feedrate adaptive control.

  • PDF

An Adaptive Hard Handoff Algorithm for Mobile Cellular Communication Systems

  • Zhu, Huamin;Kwak, Kyung-Sup
    • ETRI Journal
    • /
    • v.28 no.5
    • /
    • pp.676-679
    • /
    • 2006
  • In this letter, we propose an adaptive hard handoff algorithm with a dynamic hysteresis value based on the received signal strength from the serving base station, for mobile cellular communication systems. A discrete-time method is presented to evaluate handoff algorithms analytically. Performance is evaluated in terms of the average number of handoffs, the probability of link degradation, and the average handoff delay. Numerical results and simulations demonstrate that the proposed algorithm outperforms the handoff algorithm with fixed hysteresis values and the handoff algorithm using both threshold and hysteresis.

  • PDF

Adaptive Estimation of Latency Change in Evoked Otoacoustic Emission (Adaptive Algorithm을 이용한 이음향 방사음의 잠시의 변화 검출)

  • Chung, Woo-Hyun;Beack, Sueng-Wha
    • Proceedings of the KIEE Conference
    • /
    • 1998.07g
    • /
    • pp.2483-2485
    • /
    • 1998
  • Change in lantency of otoacoustic emission(OAE) may indicate clinically and diagnostically important change in the status of the nervous system. A low signal-to-noise ratio of OAE signal makes it difficult to estimate small, transient, time-varing changes in latency. we present an adaptive algorithm that estimates small latency change value even when OAE signal amplitudes are time-varing.

  • PDF

A STUDY OF 2-D RECURSIVE LMS WITH ADAPTIVE CONVERGENCE FACTOR (적응 수렴인자를 갖는 이차원 RLMS에 관한 연구)

  • Chung, Young-Sik
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.941-943
    • /
    • 1995
  • The convergence of adaptive algorithm depends mainly on the proper choice of the design factor called the covergence factor. In the paper, an optimal convergence factor involved in TRLMS algorithm, which is used to predict the coefficients of the ARMA predictor in ADPCM is presented. It is shown that such an optimal value can be generated by system signals such that the adaptive filter becomes self optimizing in terms of the convergence factor. This algorithm is applied to real image.

  • PDF

An Adaptive Finite Element Method for Magnetostatic Force Computations (정자력 계산을 위한 적응 유한 요소법)

  • 박용규;박일한;정형석;정현교;이기식;한송엽
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.38 no.2
    • /
    • pp.100-105
    • /
    • 1989
  • This paper presents an adaptive finite element method for magnetostatic force computation using Maxwell's stress tensor. Mesh refinements are performed automatically by interelement magnetic field intensity discontinuity errors and element force errors. In initial mesh, the computed forces for different integration paths give great differences, but converge to a certain value as mesh division is performed by the adaptive scheme, We obtained good agreement between analytic solutions and numerical values in typical examples.

  • PDF

An Adaptive Data Compression Algorithm for Video Data (사진데이타를 위한 한 Adaptive Data Compression 방법)

  • 김재균
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.12 no.2
    • /
    • pp.1-10
    • /
    • 1975
  • This paper presents an adaptive data compression algorithm for video data. The coling complexity due to the high correlation in the given data sequence is alleviated by coding the difference data, sequence rather than the data sequence itself. The adaptation to the nonstationary statistics of the data is confined within a code set, which consists of two constant length cades and six modified Shannon.Fano codes. lt is assumed that the probability distributions of tile difference data sequence and of the data entropy are Laplacian and Gaussion, respectively. The adaptive coding performance is compared for two code selection criteria: entropy and $P_r$[difference value=0]=$P_0$. It is shown that data compression ratio 2 : 1 is achievable with the adaptive coding. The gain by the adaptive coding over the fixed coding is shown to be about 10% in compression ratio and 15% in code efficiency. In addition, $P_0$ is found to he not only a convenient criterion for code selection, but also such efficient a parameter as to perform almost like entropy.

  • PDF

An Adaptive Occluded Region Detection and Interpolation for Robust Frame Rate Up-Conversion

  • Kim, Jin-Soo;Kim, Jae-Gon
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.2
    • /
    • pp.201-206
    • /
    • 2011
  • FRUC (Frame Rate Up-Conversion) technique needs an effective frame interpolation algorithm using motion information between adjacent neighboring frames. In order to have good visual qualities in the interpolated frames, it is necessary to develop an effective detection and interpolation algorithms for occluded regions. For this aim, this paper proposes an effective occluded region detection algorithm through the adaptive forward and backward motion searches and also by introducing the minimum value of normalized cross-correlation coefficient (NCCC). That is, the proposed scheme looks for the location with the minimum sum of absolute differences (SAD) and this value is compared to that of the location with the maximum value of NCCC based on the statistics of those relations. And, these results are compared with the size of motion vector and then the proposed algorithm decides whether the given block is the occluded region or not. Furthermore, once the occluded regions are classified, then this paper proposes an adaptive interpolation algorithm for occluded regions, which still exist in the merged frame, by using the neighboring pixel information and the available data in the occluded block. Computer simulations show that the proposed algorithm can effectively classify the occluded region, compared to the conventional SAD-based method and the performance of the proposed interpolation algorithm has better PSNR than the conventional algorithms.

An Adaptive Hexagon Based Search for Fast Motion Estimation (고속 움직임 추정을 위한 적응형 육각 탐색 방법)

  • 전병태;김병천
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7A
    • /
    • pp.828-835
    • /
    • 2004
  • An adaptive hexagon based search(AHBS) algorithm is proposed in this paper to perform block motion estimation in video coding. The AHBS evaluates the value of a given objective function starting from a diamond-shaped checking block and then continues its process using two hexagon-shaped checking blocks until the minimum value is found at the center of checking blocks. Also, the determination of which checking block is used depends on the position of minimum value occurred in previous searching step. The AHBS is compared with other fast searching algorithms including full search(FS). Experimental results show that the proposed algorithm provides competitive performance with slightly reduced computational complexity.