• Title/Summary/Keyword: gradient algorithm

Search Result 1,168, Processing Time 0.026 seconds

Multi user interference cancellation in satellite to ground uplink system Based on improved WPIC algorithm

  • Qingyang, Guan
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.11
    • /
    • pp.5497-5512
    • /
    • 2016
  • An improved optimal weights based on parallel interference cancellation algorithm has been proposed to cancel for interference induced by multi-user access satellite to ground uplink system. Due to differences in elevation relative motion between the user and the satellite, as well as access between users, resulting in multi-user access interference (Multi-user Access Interference, MUI), which significantly degrade system performance when multi-user access. By steepest gradient method, it obtained based on the MMSE criterion, parallel interference cancellation adjust optimal weights to obtain the maximum SINR. Compared to traditional parallel interference cancellation (Parallel Interference Cancellation, PIC) algorithm or serial interference cancellation ( Successive interference Cancellation, SIC), the accuracy of which is not high and too many complex iterations, we establish the multi-user access to the satellite to ground up link system to demonstrate that the improved WPIC algorithm could be provided with high accuracy and relatively low number of iterations.

On-line Estimation of DNB Protection Limit via a Fuzzy Neural Network

  • Na, Man-Gyun
    • Nuclear Engineering and Technology
    • /
    • v.30 no.3
    • /
    • pp.222-234
    • /
    • 1998
  • The Westinghouse OT$\Delta$T DNB protection logic heavily restricts the operation region by applying the same logic for a full range of operating pressure in order to maintain its simplicity. In this work, a fuzzy neural network method is used to estimate the DNB protection limit using the measured average temperature and pressure of a reactor core. Fuzzy system parameters are optimized by a hybrid learning method. This algorithm uses a gradient descent algorithm to optimize the antecedent parameters and a least-squares algorithm to solve the consequent parameters. The proposed method is applied to Yonggwang 3&4 nuclear power plants and the proposed method has 5.99 percent larger thermal margin than the conventional OT$\Delta$T trip logic. This simple algorithm provides a good information for the nuclear power plant operation and diagnosis by estimating the DNB protection limit each time step.

  • PDF

Optimization of Queueing Network by Perturbation Analysis (퍼터베이션 분석을 이용한 대기행렬 네트워크의 최적화)

  • 권치명
    • Journal of the Korea Society for Simulation
    • /
    • v.9 no.2
    • /
    • pp.89-102
    • /
    • 2000
  • In this paper, we consider an optimal allocation of constant service efforts in queueing network to maximize the system throughput. For this purpose, using the perturbation analysis, we apply a stochastic optimization algorithm to two types of queueing systems. Our simulation results indicate that the estimates obtained from a stochastic optimization algorithm for a two-tandem queuing network are very accurate, and those for closed loop manufacturing system are a little apart from the known optimal allocation. We find that as simulation time increases for obtaining a new gradient (performance measure with respect to decision variables) by perturbation algorithm, the estimates tend to be more stable. Thus, we consider that it would be more desirable to have more accurate sensitivity of performance measure by enlarging simulation time rather than more searching steps with less accurate sensitivity. We realize that more experiments on various types of systems are needed to identify such a relationship with regards to stopping rule, the size of moving step, and updating period for sensitivity.

  • PDF

Adaptive Beamforming Algorithm in CDMA Environment (CDMA 환경에서의 적응 빔형성 알고리즘 개발)

  • 박재돈;김제우;윤기완
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.2
    • /
    • pp.247-250
    • /
    • 2001
  • We, for the first time, propose a novel adaptive beamforming algorithm for smart antenna. The algorithm requires neither spatial knowledge nor reference signal. The algorithm is based on gradient method and its merit is in the simplicity of calculation load while maintaining good performance. Computer simulations are presented to verify the performance.

  • PDF

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

  • Sohn, Sang-Wook;Lim, Young-Bin;Choi, Hun;Bae, Hyeon-Deok
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.59 no.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.

Design Optimization of Superconducting Magnet for Maximum Energy Storage (초전도 전자석의 저장에너지 최대화를 위한 최적설계)

  • Kim, Chang-Wook;Lee, Hyang-Beom;Park, Il-Han
    • Proceedings of the KIEE Conference
    • /
    • 1999.07a
    • /
    • pp.253-255
    • /
    • 1999
  • In this paper, a shape optimization algorithm of superconducting magnet using finite element method is presented. Since the superconductor loses its superconductivity over the critical magnetic field and critical current density, this material property should be taken into account in the design process. Trial and error approach of repeating the change of the design variables costs much time and it sometimes does not guarantee an optimal design. This paper presents a systematic and efficient design algorithm for the superconducting magnet. We employ the sensitivity analysis based on finite element formulation. As for optimization algorithm, the inequality constraint for the superconducting state is removed by modifying the objective function and the nonlinear equality constraint of constant volume is satisfied by the gradient projection method. This design algorithm is applied to an optimal design problem of a solenoid air-cored superconducting magnet that has a design objective of the maximum energy storage.

  • PDF

A Study on Character Extraction Algorithm for Vehicle License Plate Recognition (자동차번호판 자동인식을 위한 문자추출에 관한 연구)

  • Kim, Jae-Kwang;Choi, Hwan-Soo
    • Proceedings of the KIEE Conference
    • /
    • 1995.07b
    • /
    • pp.965-967
    • /
    • 1995
  • One of the most difficult tasks in the process of automatic vehicle license plate recognition is the extraction of each character from within license plate region. In many cases, characters, especially serial numbers of plates are connected together due to noise and plate accessories. The recognition process may not be successful without extracting these characters effectively. This paper presents an algorithm to extract these connected characters very effectively. The algorithm utilizes mathematical morphology, connected component analysis, and gradient filters for character extraction. The paper also presents thorough experimental results as well as details of the algorithm.

  • PDF

An Comparative Study of Metaheuristic Algorithms for the Optimum Design of Structures (구조물 최적설계를 위한 메타휴리스틱 알고리즘의 비교 연구)

  • RYU, Yeon-Sun;CHO, Hyun-Man
    • Journal of Fisheries and Marine Sciences Education
    • /
    • v.29 no.2
    • /
    • pp.544-551
    • /
    • 2017
  • Metaheuristic algorithms are efficient techniques for a class of mathematical optimization problems without having to deeply adapt to the inherent nature of each problem. They are very useful for structural design optimization in which the cost of gradient computation can be very expensive. Among them, the characteristics of simulated annealing and genetic algorithms are briefly discussed. In Metropolis genetic algorithm, favorable features of Metropolis criterion in simulated annealing are incorporated in the reproduction operations of simple genetic algorithm. Numerical examples of structural design optimization are presented. The example structures are truss, breakwater and steel box girder bridge. From the theoretical evaluation and numerical experience, performance and applicability of metaheuristic algorithms for structural design optimization are discussed.

A Study on the Emergency Control Algorithm for Viability Crisis of Power System (계통사고시 장해경감을 위한 긴급제어 알고리즘에 관한 연구)

  • 송길영;이희영
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.37 no.9
    • /
    • pp.591-599
    • /
    • 1988
  • After the short-term dynamics due to the major disturbance are over, the power system may lead to viability crisis state wherein there is possibility of cascading damage. This paper presents an emergency control algorithm to alleviate the obstacles of system frequency or bus voltage during the viability crisis state. The algorithm considers the effects of controlling reactive power sources for load shedding and generation reallocation in order to alleviate the obstacles. The problem is decomposed into a subproblem I and a subproblem II. The former minimizes system frequency deviation from nominal value and the latter voltage violation of load buses. The optimization problem is solved by a reduced gradient technique which can handle a great number of inequality constraints more easily. It has been verified that the use of the proposed algorithm for IEEE 14 bus system alleviates the obstacles efficiently during the viability crisis.

  • PDF

Pruning and Learning Fuzzy Rule-Based Classifier

  • Kim, Do-Wan;Park, Jin-Bae;Joo, Young-Hoon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.663-667
    • /
    • 2004
  • This paper presents new pruning and learning methods for the fuzzy rule-based classifier. The structure of the proposed classifier is framed from the fuzzy sets in the premise part of the rule and the Bayesian classifier in the consequent part. For the simplicity of the model structure, the unnecessary features for each fuzzy rule are eliminated through the iterative pruning algorithm. The quality of the feature is measured by the proposed correctness method, which is defined as the ratio of the fuzzy values for a set of the feature values on the decision region to one for all feature values. For the improvement of the classification performance, the parameters of the proposed classifier are finely adjusted by using the gradient descent method so that the misclassified feature vectors are correctly re-categorized. The cost function is determined as the squared-error between the classifier output for the correct class and the sum of the maximum output for the rest and a positive scalar. Then, the learning rules are derived from forming the gradient. Finally, the fuzzy rule-based classifier is tested on two data sets and is found to demonstrate an excellent performance.

  • PDF