• 제목/요약/키워드: Fast Convergence

검색결과 1,111건 처리시간 0.027초

고속분할법의 수렴특성 개선에 관한 연구 (Research on the Improvement of Convergence Characteristics of the Fast Decoupled Load Flow)

  • 이인용
    • 한국전기전자재료학회논문지
    • /
    • 제25권5호
    • /
    • pp.403-408
    • /
    • 2012
  • In this paper, we propose useful load flow algorithms called FEDL (fast enhanced decoupled load flow). The proposed load flow method can improve the convergence characteristics particularly when the P-Q coupling becomes significant and the power system operating states deviate from the conditions required for stable convergence of the FDL by reflecting in part the effects of the off-diagonal terms in the Jacobian. In our test with IEEE AEP-30 bus system and RTS-96 73-bus system, it converge even when the fast decoupled load flow (FDL) and its variations keeping load flow matrices constant experience convergence problems. Test results show promising performances of the proposed algorithms in their convergence characteristics both in number of iterations and overall convergence speeds.

LMS 기반 적응 등화기에서 빠른 수렴을 위한 기준신호 변형 (Modification of the Reference Signal for Fast Convergence in LMS-based Adaptive Equalizers)

  • 이기헌;최진호;박래홍;송익호;박재혁;이병욱
    • 한국통신학회논문지
    • /
    • 제19권5호
    • /
    • pp.939-951
    • /
    • 1994
  • 최소 평균 제곱(least mean squares) 알고리듬에 기반을 둔 적응 동화기의 수렴속도는 입력신호의 공분산 행렬에 의해 결정된다. 공분산 행렬의 고유값 spread가 1에 가까울때 수렴속도는 매우 빠르다. 본 논문에서는 LMS 기반 적응 동화기의 빠른 수렴을 위해 통계적으로 주어진 채널에 적합한 변형된 기준신호를 제안하였다. 이론적인 분석과 모의실험을 통해 LMS 기반 적응 동화기의 빠른 수렴을 얻는데 이 변형 방법이 효과적임을 알 수 있었다.

  • PDF

웨이블렛 기반 적응 알고리즘의 계산량 감소에 적합한 Fast running FIR filter에 관한 연구 (fast running FIR filter structure based on Wavelet adaptive algorithm for computational complexity)

  • 이재균;이채욱
    • 융합신호처리학회 학술대회논문집
    • /
    • 한국신호처리시스템학회 2005년도 추계학술대회 논문집
    • /
    • pp.250-255
    • /
    • 2005
  • 본 논문에서는 적응 신호처리의 수렴속도를 향상 시키고 복잡한 계산량을 줄이는 새로운 필터 구조를 제안한다. 그리고 제안한 알고리즘을 웨이블렛 기반 적응 알고리즘에 적용한다. 실제로 합성 음성을 사용하여 적응 잡음 제거기에 적용하여 컴퓨터 시뮬레이션을 통해 제안한 알고리즘과 기존 알고리즘과의 성능을 비교한다. 그 결과 변환 영역 알고리즘은 기존의 시간영역의 알고리즘보다 수렴속도의 향상을 보였고, 웨이블렛 알고리즘, short-length fast running FIR 알고리즘, fast-short-length fast FIR 알고리즘 그리고 제안한 알고리즘에 대한 비교 연구를 수행하였다.

  • PDF

A Fast Algorithm for Real-time Adaptive Notch Filtering

  • Kim, Haeng-Gihl
    • Journal of information and communication convergence engineering
    • /
    • 제1권4호
    • /
    • pp.189-193
    • /
    • 2003
  • A new algorithm is presented for adaptive notch filtering of narrow band or sine signals for embedded among broad band noise. The notch filter is implemented as a constrained infinite impulse response filter with a minimal number of parameters, Based on the recursive prediction error (RPE) method, the algorithm has the advantages of the fast convergence, accurate results and initial estimate of filter coefficient and its covariance is revealed. A convergence criterion is also developed. By using the information of the noise-to-signal power, the algorithm can self-adjust its initial filter coefficient estimate and its covariance to ensure convergence.

Fast short length running FIR structure in discrete wavelet adaptive algorithm

  • 이채욱
    • 융합신호처리학회논문지
    • /
    • 제13권1호
    • /
    • pp.19-25
    • /
    • 2012
  • An adaptive system is a well-known method for removing noise from noise-corrupted speech. In this paper, we perform a least mean square (LMS) based on wavelet adaptive algorithm. It establishes the faster convergence rate of as compared to time domain because of eigenvalue distribution width. And this paper provides the basic tool required for the FIR algorithm whose algorithm reduces the arithmetic complexity. We consider a new fast short-length running FIR structure in discrete wavelet adaptive algorithm. We compare FIR algorithm and short-length fast running FIR algorithm (SFIR) to the proposed fast short-length running FIR algorithm(FSFIR) for arithmetic complexities.

16-QAM 시스템에서 MMA의 수렴 속도를 개선시킨 FC-MMA 적응 등화 알고리즘 (FC-MMA Adaptive Equalization Algorithm to improve the Convergence Speed of MMA in 16-QAM System)

  • 임승각
    • 한국인터넷방송통신학회논문지
    • /
    • 제14권1호
    • /
    • pp.93-99
    • /
    • 2014
  • 본 논문은 16-QAM 신호 전송시 시분산 채널에서 발생되는 부호간 간섭을 경감시키기 위하여 사용되는 적응 등화 알고리즘인 MMA (Multi Modulus Algorithm) 의 수렴 특성을 더욱 개선시킨 FC-MMA (Fast Convergence-MMA)에 관한 것이다. 통신 채널의 시변 특성 및 순단과 같은 비정상적인 상황에서 적응 등화기는 신속하게 새로운 환경에 적응하여야 하며, 이를 나타내는 성능 지수로는 수렴 특성을 나타내는 잔류 isi와 최대 찌그러짐이 널리 사용되고 있다. 송신 신호로는 16-QAM을 사용하였으며, 컴퓨터 시뮬레이션을 통하여 동일한 채널 환경 하에서 FC-MMA 알고리즘이 기존의 MMA 알고리즘보다 잔류 isi는 1.75배, 최대 찌그러짐에서는 2.5배 정도의 정상 상태에 도달하기 위한 빠른 수렴 성능을 가짐을 확인하였다.

GPS L5 Acquisition Schemes for Fast Code Detection and Improved Doppler Accuracy

  • Joo, In-One;Sin, Cheon-Sig;Lee, Sang-Uk;Kim, Jae-Hoon
    • ETRI Journal
    • /
    • 제32권1호
    • /
    • pp.142-144
    • /
    • 2010
  • In this letter, we propose GPS L5 acquisition schemes to detect a fast code phase and improve the accuracy of the Doppler frequency. The proposed approach is based on the code-phase changes which occur during the acquisition processing time originating in the Doppler frequency. The proposed schemes detect a fast code phase within about 1 chip near the estimated code phase and improve the accuracy of the Doppler frequency by up to about 4 times in comparison with the popular Septentrio receiver. The feasibility of the proposed schemes is demonstrated through simulation.

로봇 머니퓰레이터에서의 수렴속도 향상을 위한 적분 슬라이딩 모드 기반 적응 시간 제어 기법 (Adaptive Time-delayed Control with Integral Sliding-mode Surface for Fast Convergence Rate of Robot Manipulator)

  • 백재민;강민석
    • 대한임베디드공학회논문지
    • /
    • 제16권6호
    • /
    • pp.307-312
    • /
    • 2021
  • This paper proposes an adaptive time-delayed control approach with the integral sliding-mode surface for the fast convergence rate of robot manipulators. Adaptive switching gain aims to guarantee the system stability in such a way as to suppress time-delayed estimation error in the proposed control approach. Moreover, it makes an effort to increase the convergence ability in reaching the phase. An integral sliding-mode surface is employed to achieve a fast convergence rate in the sliding phase. The stability of the proposed one is proved to be asymptotically stable in the Lyapunov stability. The efficiency of the proposed control approach is illustrated with a tutorial example in robot manipulator, which is compared to that of the existing control approach.

Fast Ray Reordering and Approximate Sibson Interpolation for Foveated Rendering on GPU

  • Kwon, Oh-Seok;park, Keon-kuk;Yoon, Joseph;Kim, Young-Bong
    • 한국멀티미디어학회논문지
    • /
    • 제22권2호
    • /
    • pp.311-321
    • /
    • 2019
  • Virtual reality applications in Head-Mounted Displays require high frame rates and low latency rendering techniques. Ray tracing offers many benefits, such as high-quality image generation, but has not been utilized due to lower performance than rasterization. But that can obtain good result combined with gaze-tracking technology and human visual system's operation principle. In this paper, we propose a method to optimize the foveated sampling map and to maintain the visual quality through the fast voronoi nearest interpolation. The proposed method further reduces the computational cost that has been improved by the previous foveated sampling. It also smoothes the voronoi boundary using adaptive sibson interpolation, which was not possible in real-time. As a result, the proposed method can render real-time high-quality images with low visual difference.

WHEN CAN SUPPORT VECTOR MACHINE ACHIEVE FAST RATES OF CONVERGENCE?

  • Park, Chang-Yi
    • Journal of the Korean Statistical Society
    • /
    • 제36권3호
    • /
    • pp.367-372
    • /
    • 2007
  • Classification as a tool to extract information from data plays an important role in science and engineering. Among various classification methodologies, support vector machine has recently seen significant developments. The central problem this paper addresses is the accuracy of support vector machine. In particular, we are interested in the situations where fast rates of convergence to the Bayes risk can be achieved by support vector machine. Through learning examples, we illustrate that support vector machine may yield fast rates if the space spanned by an adopted kernel is sufficiently large.