• Title/Summary/Keyword: 수렴속도

Search Result 882, Processing Time 0.025 seconds

A Performance Evaluation of QE-MMA Adaptive Equalization Algorithm by Quantizer Bit Number (양자화기 비트수에 의한 QE-MMA 적응 등화 알고리즘 성능 평가)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.1
    • /
    • pp.57-62
    • /
    • 2019
  • This paper evaluates the QE-MMA (Quantized Error-MMA) adaptive equalization algorithm by the number of quantizer in order to compensates the intersymbol interference due to channel in the transmission of high spectral efficient nonconstant modulus signal. In the adaptive equalizer, the error signal is needed for the updating the tap coefficient, the QE-MMA uses the polarity of error signal and correlation multiplier that condered nonlinear finite bit power-of-two quantizing component in order to convinience of H/W implementation. The different adaptive equalization performance were obtained by the number of quantizer, these performance were evaluated by the computer simulation. For this, the equalizer output signal constellation, residual isi, maximum distortion, MSE, SER were applied as a performance index. As a result of computer simulation, it improved equalization performance and reduced equalization noise were obtained in the steady state by using large quantizer bit numbers, but gives slow in convergence speed for reaching steady state.

Performance Evaluation of MSAG-SCS-MMA-I Adaptive Blind Equalization Algorithm with dual step-size (이중 스텝 크기를 가지는 MSAG-SCS-MMA-I 적응 블라인드 등화 알고리즘의 성능 평가)

  • Jeong, Young-Hwa
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.19 no.5
    • /
    • pp.115-121
    • /
    • 2019
  • In this paper, we propose MSAG-SCS-MMA-I adaptive blind equalization with double step size with very small residual ISI and MSE at steady-state while significantly improving the convergence speed of the traditional SCS-MMA-I algorithm in 256-QAM system. And we evaluate the equalization performance for this algorithm. Different step sizes according to the absolute value of decision-directed error instead of a fixed step-size are applied to the tap update equation of MSAG-SCS-MMA-I, which is controlled by binary flags of '1' or '0' obtained from SCS-MMA-I and decision-directed algorithms. This makes for excellent equalization performance. As a result of computer simulation, we confirmed that the proposed algorithm has more better performance than the MMA, SCS-MMA-I, and MSAG-SCS-MMA-I algorithms in terms of the performance index such as residual ISI, MSE, and MD.

A Performance Evaluation of QE-MMA Adaptive Equalization Algorithm based on Quantizer-bit Number and Stepsize (QE-MMA 적응 등화 알고리즘에서 양자화기 비트수와 Stepsize에 의한 성능 평가)

  • Lim, Seung-Gag
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.21 no.1
    • /
    • pp.55-60
    • /
    • 2021
  • This paper relates with the performance evaluation of QE-MMA (Quantized Error-MMA) adaptive equalization algorithm based on the stepsize and quantizer bit number in order to reduce the intersymbol interference due to nonlinear distortion occurred in the time dispersive channel. The QE-MMA was proposed using the power-of-two arithmetic for the H/W implementation easiness substitutes the multiplication and addition into the shift and addition in the tap coefficient updates process that modifies the SE-MMA which use the high-order statistics of transmitted signal and sign of error signal. But it has different adaptive equalization performance by the step size and quantizer bit number for obtain the sign of error in the generation of error signal in QE-MMA, and it was confirmed by computer simulation. As a simulation, it was confirmed that the convergence speed for reaching steady state depend on stepsize and the residual quantities after steady state depend on the quantizer bit number in the QE-MMA adaptive equalization algorithm performance.

Battery State-of-Charge Estimation Using ANN and ANFIS for Photovoltaic System

  • Cho, Tae-Hyun;Hwang, Hye-Rin;Lee, Jong-Hyun;Lee, In-Soo
    • The Journal of Korean Institute of Information Technology
    • /
    • v.18 no.5
    • /
    • pp.55-64
    • /
    • 2020
  • Estimating the state of charge (SOC) of a battery is essential for increasing the stability and reliability of a photovoltaic system. In this study, battery SOC estimation methods were proposed using artificial neural networks (ANNs) with gradient descent (GD), Levenberg-Marquardt (LM), and scaled conjugate gradient (SCG), and an adaptive neuro-fuzzy inference system (ANFIS). The charge start voltage and the integrated charge current were used as input data and the SOC was used as output data. Four models (ANN-GD, ANN-LM, ANN-SCG, and ANFIS) were implemented for battery SOC estimation and compared using MATLAB. The experimental results revealed that battery SOC estimation using the ANFIS model had both the highest accuracy and highest convergence speed.

Improved Method to Select Targets in Phase Gradient Autofocus on Real Time Processing (실시간 처리를 위한 PGA 표적 선택기법 개선)

  • Lee, Hankil;Kim, Donghwan;Son, Inhye
    • The Journal of Korean Institute of Information Technology
    • /
    • v.17 no.10
    • /
    • pp.57-63
    • /
    • 2019
  • Motion errors which are caused by several reasons, non-ideal path, errors of navigation systems, and radar system errors, have to be corrected. Motion compensation methods can compensate the motion error, but not exactly. To correct these residual errors, several autofocus methods are invented. A popular method is phase gradient autofocus (PGA). PGA does not assume specific circumstances, such as isolated point targets and shapes of errors. PGA is an iterative and adaptive method, so that the processing time is the main problem for the real time processing. In this paper, the improved method to select targets for PGA is proposed to reduce processing time. The variances of image pixels are used to select targets with high SNR. The processing of PGA with these targets diminishes the processing time and iterations effectively. The processed results with real radar data, obtained by flight tests, show that the proposed method compensates errors well, and reduce working time.

Computation of the Time-domain Induced Polarization Response Based on Cole-Cole Model (Cole-Cole 모델에 대한 시간영역 유도분극 반응의 계산)

  • Kim, Yeon-Jung;Cho, In-Ky
    • Geophysics and Geophysical Exploration
    • /
    • v.24 no.4
    • /
    • pp.158-163
    • /
    • 2021
  • The frequency-domain induced polarization (IP) response based on Cole-Cole model is expressed as a simple equation in close form. However, it is difficult to compute the time-domain IP response based on Cole-Cole model or any other relaxation model because it cannot be written in closed form. In this study, using numerical experiments, we compared three numerical methods for calculating the time-domain IP response of the Cole-Cole model asymptotically: series expansion, digital linear filtering and Fourier transform. The series expansion method is inadequately accurate for certain time values and converges very slowly. A digital linear filter specially designed to calculate the time-domain IP response does not present the desired accuracy, especially at later times. The Fourier transform method can overcome the abovementioned problems and present the time-domain IP response with adequate accuracy for all time values, even though more computing time is required.

Multi Agents-Multi Tasks Assignment Problem using Hybrid Cross-Entropy Algorithm (혼합 교차-엔트로피 알고리즘을 활용한 다수 에이전트-다수 작업 할당 문제)

  • Kim, Gwang
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.27 no.4
    • /
    • pp.37-45
    • /
    • 2022
  • In this paper, a multi agent-multi task assignment problem, which is a representative problem of combinatorial optimization, is presented. The objective of the problem is to determine the coordinated agent-task assignment that maximizes the sum of the achievement rates of each task. The achievement rate is represented as a concave down increasing function according to the number of agents assigned to the task. The problem is expressed as an NP-hard problem with a non-linear objective function. In this paper, to solve the assignment problem, we propose a hybrid cross-entropy algorithm as an effective and efficient solution methodology. In fact, the general cross-entropy algorithm might have drawbacks (e.g., slow update of parameters and premature convergence) according to problem situations. Compared to the general cross-entropy algorithm, the proposed method is designed to be less likely to have the two drawbacks. We show that the performances of the proposed methods are better than those of the general cross-entropy algorithm through numerical experiments.

Performance Analysis of the Gamma Guidance Algorithm for Solid Rocket Kick Motors of Upper Stages of Space Launch Vehicles (위성발사체 상단의 고체로켓모터 유도를 위한 Gamma 유도 알고리듬 성능 분석)

  • Song, Eun-Jung;Cho, Sangbum;Sun, Byung-Chan
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.50 no.10
    • /
    • pp.709-716
    • /
    • 2022
  • In this paper the Gamma guidance law, which was used for IUS (Inertial Upper Stage), is applied for solid-motor guidance of a upper stage of a satellite launch vehicle. The RCS (Reaction Control System), which activates after burnout of the upper stage, is employed for the convergence of the guidance algorithm and compensation of velocity errors induced by the solid motor. The algorithm is also simplified by replacing the time-consuming numerical integration process to predict final vehicle states with Keplerian trajectories. The performance of the algorithm is evaluated by conducting 3-DOF computer simulations for off-nominal flight conditions. The numerical results show that Gamma guidance can reduce the orbit injection accuracy in comparison with that obtained by applying open-loop commands.

Proposal of Optimized Neural Network-Based Wireless Sensor Node Location Algorithm (최적화된 신경망 기반 무선 센서 노드위치 알고리즘 제안)

  • Guan, Bo;Qu, Hongxiang;Yang, Fengjian;Li, Hongliang;Yang-Kwon, Jeong
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.17 no.6
    • /
    • pp.1129-1136
    • /
    • 2022
  • This study leads to the shortcoming that the RSSI distance measurement method is easily affected by the external environment and the position error is large, leading to the problem of optimizing the distance values measured by the RSSI distance measurement nodes in this three-dimensional configuration environment. We proposed the CA-PSO-BP algorithm, which is an improved version of the CA-PSO algorithm. The proposed algorithm allows setting unknown nodes in WSN 3D space. In addition, since CA-PSO was applied to the BP neural network, it was possible to shorten the learning time of the BP network and improve the convergence speed of the algorithm through learning. Through the algorithm proposed in this study, it was proved that the precision of the network location can be increased significantly (15%), and significant results were obtained.

Containment Control for Second-order Multi-agent Systems with Input Saturations (입력 포화를 고려한 2차 다중 에이전트 시스템을 위한 봉쇄제어)

  • Young-Hun, Lim
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.27 no.1
    • /
    • pp.109-116
    • /
    • 2023
  • In this paper, we study the containment control problem for second-order multi-agent systems, which consists of multiple leaders and followers. The goal is to drive the followers toward the convex hull spanned by the leaders. Thus, the swarm behavior can be obtained by controlling the entire group by the leaders. This paper considers the leaders move at a constant speed and the followers have input saturations. Moreover, we assume that the followers can exchange information with neighbors, and only relative state information is available. Under these assumptions, we propose the Proportional-Integral based distributed control algorithm to solve the containment control problem with moving leaders. Moreover, based on Lasalle's invariance principle, the conditions for the control gains that guarantee the convergence of the followers to the convex hull spanned by the leaders are investigated, and it was shown that it can be designed only using the system parameter. Finally, the simulations are conducted to validate the theoretical result.