• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1282-1286
• /
• 1999

This paper presents the DQ transfomation and space vector modulation method to develop a control algorithm of distribution STATCON(STATic CONdenser) for line voltage regulation, dc link voltage regulation and harmonics compensation. The Performance analysis of a PI with ramp comparision and synchronous reference frame current controller is carried out. Based on these analysis, the control performances are desirable to compensate the harmonics and to regulate de link and line voltage of Distribution line.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.4
• /
• pp.1679-1691
• /
• 2016

Successive interference cancellation (SIC) is an effective means of multi-packet reception to combat interference at the physical layer. We investigate the joint optimization issue of channel access and power control for capacity maximization in SIC-enabled wireless networks. We propose a new interference model to characterize the sequential detection nature of SIC. Afterward, we formulize the joint optimization problem, prove it to be a nondeterministic polynomial-time-hard problem, and propose a novel approximation approach based on the genetic algorithm (GA). Finally, we discuss the design and parameter setting of the GA approach and validate its performance through extensive simulations.

• The Transactions of the Korean Institute of Power Electronics
• /
• v.23 no.2
• /
• pp.121-128
• /
• 2018

This work proposes a simple control method of a buck-type active power decoupling circuit that can minimize the ripple values in the dc link voltage. The proposed method utilizes a simplified duty calculation method and an optimal compensation gain tracking algorithm with variable-step approach. Thus, the dc link voltage ripple can be effectively reduced through the proposed method along with rapid response in tracking the optimum compensation gain. Moreover, the proposed method has better dynamic responses in the load fluctuation or abnormal situation. MATLAB/Simulink simulation and hardware-in-the-loop-simulation(HILS)-based experimental results are presented to validate the effectiveness of the proposed control method.

• Journal of Communications and Networks
• /
• v.4 no.3
• /
• pp.209-220
• /
• 2002

In this paper, we propose a hierarchical packet scheduling technique to closely approximate a hierarchical extension of the generalized processor sharing model, Hierarchical Generalized Processor Sharing (H-GPS). Our approach is to undertake the tasks of service guarantee and hierarchical link sharing in an independent manner so that each task best serves its own objective. The H-GPS model is decomposed into two separate service components: the guaranteed service component to consistently provide performance guarantees over the entire system, and the excess service component to fairly distribute spare bandwidth according to the hierarchical scheduling rule. For tight and harmonized integration of the two service components into a single packet scheduling algorithm, we introduce two novel concepts of distributed virtual time and service credit, and develop a packet version of H-GPS called Hierarchical Fair Queueing (HFQ). We demonstrate the layerindependent performance of the HFQ algorithm through simulation results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.707-713
• /
• 2016

In the IEEE 802.11 Wireless LAN environment, the common Access Point (AP) selection of the existing terminal is based on signal strength. However, the signal strength-based AP selection method does not ensure an optimal data rate. Recently, several AP selection methods to solve this problem have been suggested. However, when we select AP, these have a latency problem and don't consider dense environments of AP. In this paper, we confirm the problem of the conventional AP selection about the signal strength and the throughput through the actual measurement, and propose algorithm that selects AP by scoring link speed and wireless round trip time to compensate the problem. Furthermore, the proposed AP selection algorithm through the actual experiment proves the improved performance as compared with the existing methods.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.23 no.2
• /
• pp.1-14
• /
• 2024

The most optimal route-search algorithm thus far has introduced a method of applying node labels and link labels. Node labels consider two nodes simultaneously in the optimal route-search process, while link labels consider two links simultaneously. This study proposes a turn-label-based optimal route-search technique that considers two turns simultaneously in the process. Turn-label-based optimal route search guarantees the optimal solution of dynamic programming based on Bellman's principle as it considers a two-turn search process. Turn-label-based optimal route search can accommodate the advantages of applying link labels because the concept of approaching the limit of link labels is applied equally. Therefore, it is possible to reflect rational cyclic traffic where nodes allow multiple visits without expanding the network, while links do not allow visits. In particular, it reflects the additional cost structure that appears in two consecutive turns, making it possible to express the structure of the travel-cost function more flexibly. A case study was conducted on the metropolitan urban railway network consisting of transportation card terminal readers, aiming to examine the scalability of the research by introducing parameters that reflect psychological resistance in travel with continuous pedestrian transfers into turn label optimal path search. Simulation results showed that it is possible to avoid conservative transfers even if the travel time and distance increase as the psychological resistance value for continuous turns increases, confirming the need to reflect the cost structure of turn labels. Nevertheless, further research is needed to secure diversity in the travel-cost functions of road and public-transportation networks.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.22 no.3
• /
• pp.59-80
• /
• 1997

Designing highly survivable interoffice telecommunication networks is considered. The problem is formulated as a minimum-cost network design problem with three node connectivity constraints. These valid and facet-defining inequalities for the convex hull of the solution are presented. A branch and cut algorithm is proposed based on the inequalities to obtain the optimal solution. With the lower bound by the cutting plane algorithm, a delete-ink heuristic is proposed to otain a good upper bound in the branch and bound procedure. The effeciveness of the branch and cut algorithm is demonstrated with computational results for a variety of problem sets : different lower bounds, two types of link costs and large number of links. The cutting plane procedure based on the three inequalities provides excellent lower bounds to the optimal solutions.

• Proceedings of the KIPE Conference
• /
• 2015.07a
• /
• pp.177-178
• /
• 2015

This paper presents a neutral point deviation compensating control algorithm applied to a 3-level NPC converter. The neutral point deviation is analyzed with a focus on the current flowing out of or into the neutral point of the dc link. Based on the zero sequence components of the reference voltages, this paper analyzes the neutral point deviation and balancing control for 3-level NPC converter. An analytical method is proposed to calculate the injected zero sequence voltage for NP balancing based on average neutral current. This paper also proposes a control scheme compensating for the neutral point deviation under generalized unbalanced grid operating conditions. The positive and negative sequence components of the pole voltages and ac input currents are employed to accurately explain the behavior of 3-level NPC converter. Simulation and experimental results for a test set up of 30kW are shown to verify the validity of the proposed algorithm.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.28 no.8
• /
• pp.90-97
• /
• 2014

This paper presents a compensation method of unbalanced phase currents in interleaved bi-directional converters. Phase currents in interleaved bi-directional converter are apt to be unbalanced due to circuit parameter error and switch operation difference. This problem causes the switch element failure and the reduced efficiency of the converter. Therefore, it is necessary that a certain balance control algorithm is provided in interleaved bi-directional converter system. In this paper, a balance control algorithm based on the circular chain control method is proposed. Further, in order to reduce the number of phase current sensors, this paper shows a simple method in which phase currents can be extracted indirectly through a DC-link current sensor in both charging and discharging modes. The validity and the effectiveness of the proposed phase currents balance control algorithm are illustrated through the simulation results.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.5
• /
• pp.906-914
• /
• 2007

In the upstream link of EPON, numerous ONUs In the reverse link of the EPON network, numerous ONUs receive the privileges to use the optical medium from the scheduler of the LOT, but not through the competition with others. Therefore, it is very important to select a proper DBA algorithm to allocatethe frequency band to each ONU in an effectively and fair manner. In our preceding study, we proposed the RC-DBA algorithm that complements many problems in existing DBA algorithms. In this paper, we designed the MAC scheduler for the OLT, which the proposed algorithmwas applied to and implement it in the FPGA. In addition, in order to verify the operation of the scheduler, we developed the embedded Linux based testbed.