• Title/Summary/Keyword: Decoupled Algorithm

Search Result 75, Processing Time 0.031 seconds

A Fast-Decoupled Algorithm for Time-Domain Simulation of Input-Series-Output-Parallel Connected 2-Switch Forward Converter (직렬입력-병렬출력 연결된 2-스위치 포워드 컨버터의 시간 영역 시뮬레이션을 위한 고속 분리 알고리즘)

  • Kim, Marn-Go
    • Journal of Power System Engineering
    • /
    • v.6 no.3
    • /
    • pp.64-70
    • /
    • 2002
  • A fast decoupled algorithm for time domain simulation of power electronics circuits is presented. The circuits can be arbitrarily configured and can incorporate feedback amplifier circuits. This simulation algorithm is performed for the input series output parallel connected 2 switch forward converter. Steady state and large signal transient responses due to a step load change are simulated. The simulation results are verified through experiments.

  • PDF

A Study of Reducing Congestion Cost using Decoupled Optimal Power Flow (분할 최적조류계산을 이용한 송전선 혼잡비용 감소 연구)

  • Jeong, Yun-Ho;Lee, Kwang-Ho
    • Proceedings of the KIEE Conference
    • /
    • 2000.11a
    • /
    • pp.107-109
    • /
    • 2000
  • This paper presents an algorithm for reducing congestion cost using decoupled optimal power flow. The main idea of this algorithm is to reduce the reactive power flows on the congested lines in reactive power optimization. New objective function for reducing congestion cost is proposed in the reactive formulation by introducing the shadow prices for congested lines. The proposed algorithm is tested for IEEE 14-bus sample system, and the results are presented and discussed.

  • PDF

A Transient stability Analysis Algorithm Using decoupled Network Solution

  • Park, Young-Moon;Park, Jong-Bae
    • Proceedings of the KIEE Conference
    • /
    • 1988.11a
    • /
    • pp.135-139
    • /
    • 1988
  • This paper presents a new algorithm using power flow solution which is given by the polar form Newton-Raphson method in a transient stability analysis. The computation time to solve network equations can be much saved by a decoupled power flow method. In addition, the time is much saved in performing a approximate stability analysis by linearizing the differential equations and using a voltage and angle sensitivity matrix given in network equations.

  • PDF

A Study on the Development of New State Estimation Algorithm by the Decomposition Method of Linear Transformation (선형변환분할 기법에 의한 새로운 상태추정 앨고리즘 개발에 관한 연구)

  • 송길영;김영한;최상규
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.35 no.4
    • /
    • pp.148-155
    • /
    • 1986
  • This paper presents a new decoupled power system state estimation method. The decoupling is achieved via simple linear transformation on power measurements in contrast with the modified fast decoupled state estimation method which assumes decoupling by direct negligence of the off-diagonal blocks of the observation functions. The new estimation method is compared with the modified decoupled state estimation method against IEEE-14 bus model power system and 25 bus model power system in several system conditions. It is observed that the proposed method shows better convergence performance and filtering performance than a modified fast decoupled state estimation.

  • PDF

Decoupled Location Parameter Estimation of 3-D Near-Field Sources in a Uniform Circular Array using the Rank Reduction Algorithm

  • Jung, Tae-Jin;Kwon, Bum-Soo;Lee, Kyun-Kyung
    • The Journal of the Acoustical Society of Korea
    • /
    • v.30 no.3
    • /
    • pp.129-135
    • /
    • 2011
  • An algorithm is presented for estimating the 3-D location (i.e., azimuth angle, elevation angle, and range) of multiple sources with a uniform circular array (UCA) consisting of an even number of sensors. Recently the rank reduction (RARE) algorithm for partly-calibrated sensor arrays was developed. This algorithm is applicable to sensor arrays consisting of several identically oriented and calibrated linear subarrays. Assuming that a UCA consists of M sensors, it can be divided into M/2 identical linear subarrays composed of two facing sensors. Based on the structure of the subarrays, the steering vectors are decomposed into two parts: range-independent 2-D direction-of-arrival (DOA) parameters, and range-relevant 3-D location parameters. Using this property we can estimate range-independent 2-D DOAs by using the RARE algorithm. Once the 2-D DOAs are available, range estimation can be obtained for each source by defining the 1-D MUSIC spectrum. Despite its low computational complexity, the proposed algorithm can provide an estimation performance almost comparable to that of the 3-D MUSIC benchmark estimator.

The Enhancement of Continuation Power Flow at Minimal computational Costs (고속 계산을 위한 연속 조류 계산 시스템의 향상)

  • Park, Min-Seok;Song, Hwa-Chang;Lee, Byong-Jun;Kwon, Sae-Hyuk
    • Proceedings of the KIEE Conference
    • /
    • 2000.11a
    • /
    • pp.13-16
    • /
    • 2000
  • Continuation power flow has been developed to remove the ill-condition problem caused by singularity of power flow Jacobian at and near steady-state voltage instability point in conventional power flow. When solving large-scale power transmission systems, continuation power flow require large computational costs. Therefore, technique to improve the speed of continuation power flow system was required. In this paper Decoupled Power Flow Method (DPFM), Enhanced Decoupled Power Flow Method (EDPFM), Robust Fast Decoupled Power Flow Method (RFDPFM) are applied to continuation power flow algorithm to improve the speed of continuation power flow system.

  • PDF

Excess Bandwidth Fair Queueing Using Excess Bandwidth Consumer Queue (잉여 대역폭 소비 큐를 이용한 잉여 대역폭 페어 큐잉)

  • 추호철;김영한
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.10
    • /
    • pp.1-10
    • /
    • 2002
  • Scheduling technology is one of the most important elements required to support the Qos(quality of service) in the Internet and a lot of scheduling algorithms have been developed. However, most of there algorithms are not flexible in the distribution of the excess bandwidth. In order to improve the weakness of existing algorithms, DGPS(decoupled generalized processor sharing)has suggested recently. But, the DGPS algorithm is complex to implement and difficult to apply to the existing algorithms. In this paper, we propose a scheduling algorithm for distribution of the excess bandwidth which improves the implementation complexity of the DGPS and easy to be applied to ordinary algorithms.

Rapid Data Allocation Technique for Multiple Memory Bank Architectures (다중 메모리 뱅크 구조를 위한 고속의 자료 할당 기법)

  • 조정훈;백윤홍;최준식
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10a
    • /
    • pp.196-198
    • /
    • 2003
  • Virtually every digital signal processors(DSPs) support on-chip multi- memory banks that allow the processor to access multiple words of data from memory in a single instruction cycle. Also, all existing fixed-point DSPs have irregular architecture of heterogeneous register which contains multiple register files that are distributed and dedicated to different sets of instructions. Although there have been several studies conducted to efficiently assign data to multi-memory banks, most of them assumed processors with relatively simple, homogeneous general-purpose resisters. Therefore, several vendor-provided compilers fer DSPs were unable to efficiently assign data to multiple data memory banks. thereby often failing to generate highly optimized code fer their machines. This paper presents an algorithm that helps the compiler to efficiently assign data to multi- memory banks. Our algorithm differs from previous work in that it assigns variables to memory banks in separate, decoupled code generation phases, instead of a single, tightly-coupled phase. The experimental results have revealed that our decoupled algorithm greatly simplifies our code generation process; thus our compiler runs extremely fast, yet generates target code that is comparable In quality to the code generated by a coupled approach

  • PDF

Algorithm for Economic Load Dispatch by the Nonlinear Programming Method (비선형계획법에 의한 자동경제급전 알고리즘의 개발에 관한 연구)

  • 박영문;김건중
    • 전기의세계
    • /
    • v.26 no.1
    • /
    • pp.77-81
    • /
    • 1977
  • This paper aims to develope a new algorithm to overcome the disadvantages of the conventional E.L.D system based on the B-Constants and Penalty-Factors scheme. The main features of this paper are that the Variabiable Decoupled Method usually employed in the Load-Flow studies is introduced to the E.L.D. algorithm developed by Sasson, using the Powell's Nonlinear Programming Scheme. Besides this, other minor refinements are made to reduce memory spaces and computing time. Case studies show that the method suggested here has the remarkable advantages of computing efficiency and memory requirements over Sasson's.

  • PDF

Economic dispatch using the equivalent representation method (등가화법에 의한 경제급전)

  • 김준현;황갑구
    • 전기의세계
    • /
    • v.30 no.12
    • /
    • pp.817-821
    • /
    • 1981
  • A simple scheme using the single equivalent machine representation, equivalent loss reprsentation and direct hydro-MW representation are applied to economic dispatch for practical applications. A,simple approach to calculation of incremental transmission losses is proposed from the fast decoupled load flow algorithm. This program is presently being tested on KECO system.

  • PDF