• 제목/요약/키워드: Adaptive Algorithms

검색결과 1,194건 처리시간 0.025초

유전알고리즘을 이용한 단기 수력 스케줄링에 관한 연구 (Short-term Hydro Scheduling by Genetic Algorithms)

  • 이용한;황기현;문경준;박준호
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제48권9호
    • /
    • pp.1088-1095
    • /
    • 1999
  • This paper presents short-term hydro scheduling method for hydrothermal coordination by genetic algorithms. Hydro scheduling problem has many constraints with fixed final reservoir volume. In this paper, the difficult water balance constraints caused by hydraulic coupling satisfied throughout dynamic decoding method. Adaptive penalizing method was also proposed to handle the infeasible solutions that violate various constraints. In this paper, we proposed GA to solve hydrothermal scheduling with appropriate decoding method and dynamic penalty method. The effectiveness of the proposed method is demonstrated in the case study.

  • PDF

CDMA 이동통신 시스템을 위한 적응형 섹터 안테나의 섹터형성 알고리즘 (Sectorization Algorithms of Adaptive Sector Antennas for CDMA Mobile Communication Systems)

  • 이주형;오창헌;조성준
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2001년도 하계종합학술대회 논문집(1)
    • /
    • pp.41-44
    • /
    • 2001
  • In this paper, we have investigated the adaptive sector antenna which can control the size and direction angle of sectors, and proposed the three sectorization algorithms which are based on distribution of users, distribution of codes and distribution of signal power, respectively. The BERs of each sectorization algorithms are compared through computer simulation. As results of the simulation, the sectorization algorithm based on signal power are better than the other in terms nf BER. We have simulated error performance the DS-CDMA/BPSK system with the antenna in AWGN, frequency non-selective Rayleigh fading and MAI channels.

  • PDF

FIR MIMO 시스템을 위한 부밴드 적응 블라인드 등화 알고리즘 (A Subband Adaptive Blind Equalization Algorithm for FIR MIMO Systems)

  • 손상욱;임영빈;최훈;배현덕
    • 전기학회논문지
    • /
    • 제59권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.

점근상대효율을 이용한 최소평균제곱 계열 적응여파기의 성능 비교 (The Comparison of the Performance for LMS Algorithm Family Using Asymptotic Relative Efficiency)

  • 손원
    • 대한전자공학회논문지SP
    • /
    • 제37권6호
    • /
    • pp.70-75
    • /
    • 2000
  • 이 논문은 최소평균제곱계열 적응여파기의 성능을 동일한 수렴속도를 가지는 조건에서 최소평균제곱 알고리즘에 대한 상대적인 성능을 점근상대효율을 이용하여 분석하였다. 분석된 최소평균제곱 계열 알고리즘은 Hybrid II 및 MZF(Modified Zero Forcing) 알고리즘이다. 이들은 최소평균제곱 알고리즘을 단순화한 형태로서 각각 입력신호의 부호정보, 오차신호와 입력신호의 부호정보를 사용한다. 각 알고리즘에 대한 추정기의 점근상대효율은 동일수렴속도 조건에서 분석되었으며, 적응등화기에 대한 모의실험이 분석결과를 확인하기 위하여 수행되었다. 각 알고리즘에 대하여 유도된 점근상대효율에 대한 명시적 표현은 모의실험결과와 유사한 결과를 가졌으며, 점근상대효율은 입력신호와 오차신호간의 상관계수 값에만 좌우된다는 것이 밝혀졌다.

  • PDF

적응 쌍선형 격자필터 (II) - 최소자승 격자 알고리즘 (Adaptive Bilinear Lattice Filter(II)-Least Squares Lattice Algorithm)

  • Heung Ki Baik
    • 전자공학회논문지B
    • /
    • 제29B권1호
    • /
    • pp.34-42
    • /
    • 1992
  • This paper presents two fast least-squares lattice algorithms for adaptive nonlinear filters equipped with bilinear system models. The lattice filters perform a Gram-Schmidt orthogonalization of the input data and have very good numerical properties. Furthermore, the computational complexity of the algorithms is an order of magnitude snaller than previously algorithm is an order of magnitude smaller than previously available methods. The first of the two approaches is an equation error algorithm that uses the measured desired response signal directly to comprte the adaptive filter outputs. This method is conceptually very simple`however, it will result in biased system models in the presence of measurement noise. The second approach is an approximate least-squares output error solution. In this case, the past samples of the output of the adaptive system itself are used to produce the filter output at the current time. Results of several experiments that demonstrate and compare the properties of the adaptive bilinear filters are also presented in this paper. These results indicate that the output error algorithm is less sensitive to output measurement noise than the squation error method.

  • PDF

A Novel Globally Adaptive Load-Balanced Routing Algorithm for Torus Interconnection Networks

  • Wang, Hong;Xu, Du;Li, Lemin
    • ETRI Journal
    • /
    • 제29권3호
    • /
    • pp.405-407
    • /
    • 2007
  • A globally adaptive load-balanced routing algorithm for torus interconnection networks is proposed. Unlike previously published algorithms, this algorithm employs a new scheme based on collision detection to handle deadlock, and has higher routing adaptability than previous algorithms. Simulation results show that our algorithm outperforms previous algorithms by 16% on benign traffic patterns, and by 10% to 21% on adversarial traffic patterns.

  • PDF

실시간 적응 학습 제어를 위한 진화연산(II) (Evolutionary Computation for the Real-Time Adaptive Learning Control(II))

  • 장성욱;이진걸
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2001년도 춘계학술대회논문집B
    • /
    • pp.730-734
    • /
    • 2001
  • In this study in order to confirm the algorithms that are suggested from paper (I) as the experimental result, as the applied results of the hydraulic servo system are very strong a non-linearity of the fluid in the computer simulation, the real-time adaptive learning control algorithms is validated. The evolutionary strategy has characteristics that are automatically. adjusted in search regions with natural competition among many individuals. The error that is generated from the dynamic system is applied to the mutation equation. Competitive individuals are reduced with automatic adjustments of the search region in accord with the error. In this paper, the individual parents and offspring can be reduced in order to apply evolutionary algorithms in real-time as the description of the paper (I). The possibility of a new approaching algorithm that is suggested from the computer simulation of the paper (I) would be proved as the verification of a real-time test and the consideration its influence from the actual experiment.

  • PDF

Examination of three meta-heuristic algorithms for optimal design of planar steel frames

  • Tejani, Ghanshyam G.;Bhensdadia, Vishwesh H.;Bureerat, Sujin
    • Advances in Computational Design
    • /
    • 제1권1호
    • /
    • pp.79-86
    • /
    • 2016
  • In this study, the three different meta-heuristics namely the Grey Wolf Optimizer (GWO), Stochastic Fractal Search (SFS), and Adaptive Differential Evolution with Optional External Archive (JADE) algorithms are examined. This study considers optimization of the planer frame to minimize its weight subjected to the strength and displacement constraints as per the American Institute of Steel and Construction - Load and Resistance Factor Design (AISC-LRFD). The GWO algorithm is associated with grey wolves' activities in the social hierarchy. The SFS algorithm works on the natural phenomenon of growth. JADE on the other hand is a powerful self-adaptive version of a differential evolution algorithm. A one-bay ten-story planar steel frame problem is examined in the present work to investigate the design ability of the proposed algorithms. The frame design is produced by optimizing the W-shaped cross sections of beam and column members as per AISC-LRFD standard steel sections. The results of the algorithms are compared. In addition, these results are also mapped with other state-of-art algorithms.

능동소음제어를 위한 Adjoint-LMS 알고리즘의 강인성 개선 (A Robustness Improvement of Adjoint-LMS Algorithms for Active Noise Control)

  • 문학룡;손진근
    • 전기학회논문지P
    • /
    • 제65권3호
    • /
    • pp.171-177
    • /
    • 2016
  • Noise problem that occurs in living environment is a big trouble in the economic, social and environmental aspects. In this paper, the filtered-X LMS algorithms, the adjoint LMS algorithms, and the robust adjoint LMS algorithms will be introduced for applications in active noise control(ANC). The filtered-X LMS algorithms is currently the most popular method for adapting a filter when the filter exits a transfer function in the error path. The adjoint LMS algorithms, that prefilter the error signals instead of divided reference signals in frequency band, is also used for adaptive filter algorithms to reduce the computational burden of multi-channel ANC systems such as the 3D space. To improve performance of the adjoint LMS ANC system, an off-line measured transfer function is connected parallel to the LMS filter. This parallel-fixed filter acts as a noise controller only when the LMS filter is abnormal condition. The superior performance of the proposed system was compared through simulation with the adjoint LMS ANC system when the adaptive filter is in normal and abnormal condition.

안정화된 다중채널 순환 LMS 필터를 이용한 덕트의 능동소음제어 (Active Control of Noise in Ducts Using Stabilized Multi-Channel RLMS Filters)

  • 남현도;남승욱
    • 대한전기학회논문지:시스템및제어부문D
    • /
    • 제55권8호
    • /
    • pp.375-377
    • /
    • 2006
  • An adaptive IIR filter in ANC(Active Noise Control) systems is more effective than an adaptive FIR filter when acoustic feedback exists, in which cause an order of an adaptive FIR filter must be very large if some of poles of the ideal control filter are near the unit circle. But the IIR filters may have stability problems especially when the adaptive algorithm for adaptive filters is not yet converged. In this paper, a stabilized multi-channel recursive LMS (MCRLMS) algorithm for an adaptive multi-channel IIR filter is presented. RLMS algorithms usually diverge before the algorithm is not yet converged. So, in the beginning of the ANC system, the stability of the RLMS algorithms could be improved by pulling the poles of the IIR filter to the center of the unit circle, and returning the poles to their original positions after the filter converges. Computer simulations and experiments for dipole ducts using a TMS320C32 digital signal processor have performed to show the effectiveness of a proposed algorithm.