• Title/Summary/Keyword: Switching Algorithm

Search Result 1,006, Processing Time 0.025 seconds

Optimal Offset-Time Decision for QoS in Optical Burst Switching Networks

  • Kim, Sung-Chang;Choi, Jin-Seek;Yoon, Bin-Yeong;Kang, Min-Ho
    • Journal of Communications and Networks
    • /
    • v.9 no.3
    • /
    • pp.312-318
    • /
    • 2007
  • In this paper, we propose the optimal offset-time decision (OOD) algorithm which can effectively reduce the pre-transmission delay compared to the perfect isolation model, and can also be extended to general n priority classes while the target loss probability of each class is guaranteed for the variable offered load. In order to drive the OOD algorithm, we first analyze the loss probability of each priority class through class aggregation and iteration method; the analytic results obtained through the proposed algorithm are then validated with results garnered from extensive simulation tests.

New Generalized SVPWM Algorithm for Multilevel Inverters

  • Kumar, A. Suresh;Gowri, K. Sri;Kumar, M. Vijay
    • Journal of Power Electronics
    • /
    • v.18 no.4
    • /
    • pp.1027-1036
    • /
    • 2018
  • In this paper a new generalized space vector pulse width modulation scheme is proposed based on the principle of reverse mapping to drive the switches of multilevel inverters. This projected scheme is developed based on the middle vector of the subhexagon which holds the tip of the reference vector, which plays a major role in mapping the reference vector. A new approach is offered to produce middle vector of the subhexagon which holds tip of the reference vector in the multilevel space vector plane. By using middle vector of the subhexagon, reference vector is linked towards the inner two level sub-hexagon. Then switching vectors, switching sequence and dwell times corresponding to a particular sector of a two-level inverter are determined. After that, by using the two level stage findings, the switching vectors related to exact position of the reference vector are directly generated based on principle of the reverse mapping approach and do not need to be found at n level stage. In the reverse mapping principle, the middle vector of subhexagon is added to the formerly found two level switching vectors. The proposed generalized algorithm is efficient and it can be applied to an inverter of any level. In this paper, the proposed scheme is explained for a five-level inverter and the performance is analyzed for five level and three level inverters through MATLAB. The simulation results are validated by implementing the propose scheme on a V/f controlled three-level inverter fed induction motor using dSPACE control desk.

A Fault-Tolerant Multicasting Algorithm using Region Encoding Scheme in Multistage Interconnection Networks (다단계 상호연결망에서 영역 부호화 방식을 사용하는 고장 허용 멀티캐스팅 알고리즘)

  • Kim, Jin-Soo;Chang, Jung-Hwan
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.29 no.3
    • /
    • pp.117-124
    • /
    • 2002
  • This paper proposes a fault-tolerant multicasting algorithm employing the region encoding scheme in multistage interconnection networks (MIN's) containing multiple faulty switching elements. After classifying all switching elements into two subsets with equal sizes in MIN, the proposed algorithm can tolerate the faulty pattern where every fault is contained in the same subset. In order to send a multicast message to its destinations detouring faults, the proposed algorithm uses the recursive scheme that recirculates it through MIN, We prove that this algorithm can route any multicast message in only two passes through the faulty MIN.

Designing Cellular Mobile Network Using Lagrangian Based Heuristic (라그랑지안 기반의 휴리스틱 기법을 이용한 셀룰러 모바일 네트워크의 설계)

  • Hong, Jung-Man;Lee, Jong-Hyup
    • Journal of Korean Institute of Industrial Engineers
    • /
    • v.37 no.1
    • /
    • pp.19-29
    • /
    • 2011
  • Cellular network is comprised of several base stations which serve cellular shaped service area and each base station (BS) is connected to the mobile switching center (MSC). In this paper, the configuration modeling and algorithm of a cellular mobile network with the aim of minimizing the overall cost of operation (handover) and network installation cost (cabling cost and installing cost of mobile switching center) are considered. Handover and cabling cost is one of the key considerations in designing cellular telecommunication networks. For real-world applications, this configuration study covers in an integrated framework for two major decisions: locating MSC and assigning BS to MSC. The problem is expressed in an integer programming model and a heuristic algorithm based on Lagrangian relaxation is proposed to resolve the problem. Searching for the optimum solution through exact algorithm to this problem appears to be unrealistic considering the large scale nature and NP-Completeness of the problem. The suggested algorithm computes both the bound for the objective value of the problem and the feasible solution for the problem. A Lagrangian heuristics is developed to find the feasible solution. Numerical tests are performed for the effectiveness and efficiency of the proposed heuristic algorithm. Computational experiments show that the performance of the proposed heuristics is satisfactory in the quality of the generated solution.

Algorithm for the ATM Switching Node Location Problem (ATM 교환기의 위치 선정 문제에 관한 연구)

  • 김덕성;이경식;박성수;박경철
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.3
    • /
    • pp.93-107
    • /
    • 1999
  • We consider the development of an integer programming model and algorithm for the ATM switching node location problem. There are two kinds of facilities, hub facilities and remote facilities, with different capacities and installation costs. Each customer needs to be connected to one or more hub facilities via remote facilities, where the hub(remote) facilities need to be installed at the same candidate installation site of hub(remote) facility. We are given a set of customers with each demand requirements, a set of candidate installation sites of facilities, and connection costs between facilities, We need to determine the locations to place facilities, the number of facilities for each selected location, the set of customers who are connected to each installed hub facilities via installed remote facilities with minimum costs, while satisfying demand requirements of each customer. We formulate this problem as a general integer programming problem and solve it to optimality. In this paper, we develop a branch-and-cut algorithm with path variables. In the algorithm, we consider the integer knapsack polytope and derive valid inequalities. Computational experiments show that the algorithm works well in the real world situation. The results of this research can be used to develop optimization algorithms to solve capacitated facility location problems.

  • PDF

Phase Switching Mechanism for WiFi-based Long Distance Networks in Industrial Real-Time Applications

  • Wang, Jintao;Jin, Xi;Zeng, Peng;Wang, Zhaowei;Wan, Ming
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.11 no.1
    • /
    • pp.78-101
    • /
    • 2017
  • High-quality industrial control is critical to ensuring production quality, reducing production costs, improving management levels and stabilizing equipment and long-term operations. WiFi-based Long Distance (WiLD) networks have been used as remote industrial control networks. Real-time performance is essential to industrial control. However, the original mechanism of WiLD networks does not minimize end-to-end delay and restricts improvement of real-time performance. In this paper, we propose two algorithms to obtain the transmitting/receiving phase cycle length for each node such that real time constraints can be satisfied and phase switching overhead can be minimized. The first algorithm is based on the branch and bound method, which identifies an optimal solution. The second is a fast heuristic algorithm. The experimental results show that the execution time of the algorithm based on branch and bound is less than that of the heuristic algorithm when the network is complex and that the performance of the heuristic algorithm is close to the optimal solution.

Development of 3-Dimensional Pose Estimation Algorithm using Inertial Sensors for Humanoid Robot (관성 센서를 이용한 휴머노이드 로봇용 3축 자세 추정 알고리듬 개발)

  • Lee, Ah-Lam;Kim, Jung-Han
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.14 no.2
    • /
    • pp.133-140
    • /
    • 2008
  • In this paper, a small and effective attitude estimation system for a humanoid robot was developed. Four small inertial sensors were packed and used for inertial measurements(3D accelerometer and three 1D gyroscopes.) An effective 3D pose estimation algorithm for low cost DSP using an extended Kalman filter was developed and evaluated. The 3D pose estimation algorithm has a very simple structure composed by 3 modules of a linear acceleration estimator, an external acceleration detector and an pseudo-accelerometer output estimator. The algorithm also has an effective switching structure based on probability and simple feedback loop for the extended Kalman filter. A special test equipment using linear motor for the testing of the 3D pose sensor was developed and the experimental results showed its very fast convergence to real values and effective responses. Popular DSP of TMS320F2812 was used to calculate robot's 3D attitude and translated acceleration, and the whole system were packed in a small size for humanoids robots. The output of the 3D sensors(pitch, roll, 3D linear acceleration, and 3D angular rate) can be transmitted to a humanoid robot at 200Hz frequency.

AWGN Removal Algorithm using Switching Fuzzy Function and Weight (스위칭 퍼지 함수와 가중치를 사용한 AWGN 제거 알고리즘)

  • Cheon, Bong-Won;Kim, Nam-Ho
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2021.10a
    • /
    • pp.121-123
    • /
    • 2021
  • Image processing is being used in various forms in important fields of the 4th industrial revolution, such as artificial intelligence, smart factories, and the IoT industry. In particular, in systems that require data processing such as object tracking, medical images, and object recognition, noise removal is used as a preprocessing step, but the existing algorithm has a drawback in that blurring occurs in the filtering process. Therefore, in this paper, we propose a filter algorithm using switching fuzzy weights. The proposed algorithm switches the fuzzy function by dividing the low-frequency region and the high-frequency region by the standard deviation of the filtering mask, and obtains the final output according to the fuzzy weight. The proposed algorithm showed improved results compared to the existing method, and showed excellent characteristics in the region where the high-frequency component is strong.

  • PDF

The Development of Calculation Algorithm of Power Loss for Inverter in BLDC Motor Drive with Switching Modes (스위칭 방식에 따른 BLDC Motor 구동용 인버터의 전력 손실 계산 알고리즘 개발)

  • Kim, Sang-Hoon;Lee, Young-Cheol
    • Journal of Industrial Technology
    • /
    • v.24 no.A
    • /
    • pp.119-126
    • /
    • 2004
  • BLDC Motor is one of the widely utilizable motors in servo system. The accurate calculation of the power loss for the IGBT and Inverse diode with Bipolar and Unipolar switching modes the driving modes is important for the design of drives for their heat treatment. If it were not for temperature-sensors in devices, it is difficult to get direct power loss, so. Power losses may be modeled by computer modeling to obtain the Calculation of the Power loss for Inverter in BLDC Motor with switching modes which is presented in this paper. The computer modeling is carried out by Matlab simulation. The power loss consists of conduction losses Conduction losses are the source of occurrence due to The IGBT and Inverse diode currents. Switching losses are the source of occurrence due to switching on/off in the devices, and gives the dominant influence to the loss. As a result, the unipolar I mode is best in reducing the heat losses.

  • PDF

On the Heterogeneous Postal Delivery Model for Multicasting

  • Sekharan, Chandra N.;Banik, Shankar M.;Radhakrishnan, Sridhar
    • Journal of Communications and Networks
    • /
    • v.13 no.5
    • /
    • pp.536-543
    • /
    • 2011
  • The heterogeneous postal delivery model assumes that each intermediate node in the multicasting tree incurs a constant switching time for each message that is sent. We have proposed a new model where we assume a more generalized switching time at intermediate nodes. In our model, a child node v of a parent u has a switching delay vector, where the ith element of the vector indicates the switching delay incurred by u for sending the message to v after sending the message to i-1 other children of u. Given a multicast tree and switching delay vectors at each non-root node 5 in the tree, we provide an O(n$^{\frac{5}{2}}$) optimal algorithm that will decide the order in which the internal (non-leaf) nodes have to send the multicast message to its children in order to minimize the maximum end-to-end delay due to multicasting. We also show an important lower bound result that optimal multicast switching delay problem is as hard as min-max matching problem on weighted bipartite graphs and hence O(n$^{\frac{5}{2}}$) running time is tight.