• Title/Summary/Keyword: simulation correctness

Search Result 145, Processing Time 0.023 seconds

Zero-Current Phenomena Analysis of the Single IGBT Open Circuit Faults in Two-Level and Three-Level SVGs

  • Wang, Ke;Zhao, Hong-Lu;Tang, Yi;Zhang, Xiao;Zhang, Chuan-Jin
    • Journal of Power Electronics
    • /
    • v.18 no.2
    • /
    • pp.627-639
    • /
    • 2018
  • The fact that the reliability of IGBTs has become a more and more significant aspect of power converters has resulted in an increase in the research on the open circuit (OC) fault location of IGBTs. When an OC fault occurs, a zero-current phenomena exists and frequently appears, which can be found in a lot of the existing literature. In fact, fault variables have a very high correlation with the zero-current interval. In some cases, zero-current interval actually decides the most significant fault feature. However, very few of the previous studies really explain or prove the zero-current phenomena of the fault current. In this paper, the zero-current phenomena is explained and verified through mathematical derivation, based on two-level and three-level NPC static var generators (SVGs). Mathematical models of single OC fault are deduced and it is concluded that a zero-current interval with a certain length follows the OC faults for both two-level and NPC three-level SVGs. Both inductive and capacitive reactive power situations are considered. The unbalanced load situation is discussed. In addition, simulation and experimental results are presented to verify the correctness of the theoretical analysis.

Cooperative Transmission Protocol based on Opportunistic Incremental Relay Selection over Rayleigh fading channels (레일리 페이딩 채널 상에서 기회주의적 증분형 중계기 선택 기법을 기반으로 한 협력 전송 알고리즘)

  • Xuyen, Tran Thi;Kong, Hyung-Yun
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.11 no.5
    • /
    • pp.53-58
    • /
    • 2011
  • In this paper, we firstly propose a novel cooperative transmission protocol, which utilizes the advantages of mid-notes in the route from the source to the destination. Taking benefits from balancing between the received packet from the source and acknowledge message from the destination, the mid-node between the source and the destination is firstly considered to be the broadcaster. If its signal is successfully received from the source, it leads to consider the next nodes, which has closer distance to the destination than it. If one of these nodes correctly receives the signal, it performs broadcasting the signal to the destination instead of mid-node. Otherwise, the mid-node directs attention to these nodes being near to the destination. As the result, some nodes are unnecessary to be considered and passed over time. After that, we analyze some published selection relaying schemes based on geographic information to choose the best nodes instead of the instantaneous SNR as before. Finally, simulation results are given to demonstrate the correctness of the performance analyses and show the significant improvement of the selection relaying schemes based geographic information compared to the other ones.

Overall Cell Data Rates Analysis for Heterogenous Network Under Adaptive Modulation (이종 네트워크에서 적응변조 사용시 주파수 공유에 따른 데이터 전송률 분석)

  • Kwon, Tae-Hoon
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.11 no.4
    • /
    • pp.394-400
    • /
    • 2018
  • A heterogenous network is the one of key technologies for 5G, where one cell is divided into small cells in order to extend coverage and support high data rates. Divided cells aggravates the intercell interference problem as the cell edge increases. In order to avoid the intercell interference, it is the best to allocate the different spectrum for each cells. However, it also decreases the spectral efficiency. Therefore, the trade-off between the spectral efficiency gain and the signal quality loss by the interference should be considered for an efficient spectrum sharing in the heterogenous network. The adaptive modulation is the method to change the transmitted bit according to the channel quality, which is adopted as the standard in the most practical communication systems. It should be considered to applied the performance analysis into the practical systems. In this paper, the overall cell data rates is analyzed for the heterogenous network under the adaptive modulation. The Monte Carlo simulation results verify the correctness of the analysis.

Energy-Aware Preferential Attachment Model for Wireless Sensor Networks with Improved Survivability

  • Ma, Rufei;Liu, Erwu;Wang, Rui;Zhang, Zhengqing;Li, Kezhi;Liu, Chi;Wang, Ping;Zhou, Tao
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.7
    • /
    • pp.3066-3079
    • /
    • 2016
  • Recent years have witnessed a dramatic increase in topology research of wireless sensor networks (WSNs) where both energy consumption and survivability need careful consideration. To balance energy consumption and ensure survivability against both random failures and deliberate attacks, we resort to complex network theory and propose an energy-aware preferential attachment (EPA) model to generate a robust topology for WSNs. In the proposed model, by taking the transmission range and energy consumption of the sensor nodes into account, we combine the characters of Erdős -Rényi (ER) model and Barabasi-Albert (BA) model in this new model and introduce tunable coefficients for balancing connectivity, energy consumption, and survivability. The correctness of our theoretic analysis is verified by simulation results. We find that the topology of WSNs built by EPA model is asymptotically power-law and can have different characters in connectivity, energy consumption, and survivability by using different coefficients. This model can significantly improve energy efficiency as well as enhance network survivability by changing coefficients according to the requirement of the real environment where WSNs deployed and therefore lead to a crucial improvement of network performance.

Integrated Optimization Design of Carbon Fiber Composite Framework for Small Lightweight Space Camera

  • Yang, Shuai;Sha, Wei;Chen, Changzheng;Zhang, Xingxiang;Ren, Jianyue
    • Journal of the Optical Society of Korea
    • /
    • v.20 no.3
    • /
    • pp.389-395
    • /
    • 2016
  • A Carbon Fiber Composite (CFC) framework was designed for a small lightweight space camera. According to the distribution characteristics of each optical element in the optical system, CFC (M40J) was chosen to accomplish the design of the framework. TC4 embedded parts were used to solve the low accuracy of the CFC framework interface problem. An integrated optimization method and the optimization strategy which combined a genetic global optimization algorithm with a downhill simplex local optimization algorithm were adopted to optimize the structure parameters of the framework. After optimization, the total weight of the CFC framework and the TC4 embedded parts is 15.6 kg, accounting for only 18.4% that of the camera. The first order frequency of the camera reaches 104.8 Hz. Finally, a mechanical environment test was performed, and the result demonstrates that the first order frequency of the camera is 102 Hz, which is consistent with the simulation result. It further verifies the rationality and correctness of the optimization result. The integrated optimization method mentioned in this paper can be applied to the structure design of other space cameras, which can greatly improve the structure design efficiency.

Adaptive Routing Scheme to Avoid Clusterhead Congestion in c-DSDV Routing Protocol (c-DSDV 라우팅 프로토콜에서 클러스터헤드의 혼잡 회피를 위한 적응적 라우팅 방법)

  • Oh, Hoon;Yun, Seok-Yeol;Vu, Trong Tuan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.3A
    • /
    • pp.219-224
    • /
    • 2008
  • In the c-DSDV routing protocol proposed to improve the scalability of DSDV, clusterheads manage a routing table that has only clusterheads as potential destinations and flood update request message to its neighbor clusterheads periodically or at the time of topology change. Accordingly, the convergence range of topology change by a single update request message was expanded nine times as wide as that of DSDV, increasing routing correctness; however, c-DSDV suffers from the congestion of clusterheads since data packets always go through clusterheads of the clusters on the routing path. To improve this problem, we propose an adaptive routing scheme that judges if detouring clusterhead is possible on the fly while packets are forwarded. As a result, a routing path length is shortened and an end-to-end delay is improved by the reduced queue length. It shows that the end-to-end delay is reduced by almost 40% through simulation.

Low Power High Frequency Design for Data Transfer for RISC and CISC Architecture (RISC와 CISC 구조를 위한 저전력 고속 데이어 전송)

  • Agarwal Ankur;Pandya A. S.;Lho Young-Uhg
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.2
    • /
    • pp.321-327
    • /
    • 2006
  • This paper presents low power and high frequency design of instructions using ad-hoc techniques at transistor level for full custom and semi-custom ASIC(Application Specific Integrated Circuit) designs. The proposed design has been verified at high level using Verilog-HDL and simulated using ModelSim for the logical correctness. It is then observed at the layout level using LASI using $0.25{\mu}m$ technology and analyzed for timing characteristic under Win-spice simulation environment. The result shows the significant reduction up to $35\%$ in the power consumption by any general purpose processor like RISC or CISC. A significant reduction in the propagation delay is also observed. increasing the frequency for the fetch and execute cycle for the CPU, thus increasing the overall frequency of operation.

A Neural Network Design using Pulsewidth-Modulation (PWM) Technique (펄스폭변조 기법을 이용한 신경망회로 설계)

  • 전응련;전흥우;송성해;정금섭
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.6 no.1
    • /
    • pp.14-24
    • /
    • 2002
  • In this paper, a design of the pulsewidth-modulation(PWM) neural network with both retrieving and learning function is proposed. In the designed PWM neural system, the input and output signals of the neural network are represented by PWM signals. In neural network, the multiplication is one of the most commonly used operations. The multiplication and summation functions are realized by using the PWM technique and simple mixed-mode circuits. Thus, the designed neural network only occupies the small chip area. By applying some circuit design techniques to reduce the nonideal effects, the designed circuits have good linearity and large dynamic range. Moreover, the delta learning rule can easily be realized. To demonstrate the learning capability of the realized PWM neural network, the delta learning nile is realized. The circuit with one neuron, three synapses, and the associated learning circuits has been designed. The HSPICE simulation results on the two learning examples on AND function and OR function have successfully verified the function correctness and performance of the designed neural network.

An Efficient Recovery Algorithm based on Causal Message Logging in Distributed Systems (분산 시스템에서 인과적 메시지 로깅에 기반한 효율적 회복 알고리즘)

  • An, Jin-Ho;Jeong, Gwang-Sik;Kim, Gi-Beom;Hwang, Jong-Seon
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.10
    • /
    • pp.1194-1205
    • /
    • 1999
  • 인과적 메시지 로깅은 정상수행시 낙관적 메시지 로깅의 장점을 가지고, 회복시 비관적 메시지 로깅의 장점을 가지고 있다. 본 논문에서는 회복 프로세스들간의 비동기성을 향상시키기 위한 인과적 메시지 로깅에 기반한 새로운 회복 알고리즘을 제안하고자 한다. 기존의 인과적 메시지 로깅 기반 회복 알고리즘들은 살아있는 프로세스들의 수행을 대기시키거나, 회복 프로세스들간의 높은 동기성을 요구한다. 본 논문에서 제안하는 회복 알고리즘은 각 회복 프로세스가 자신의 회복만을 책임지게 함으로써, 여러 개의 프로세스들이 동시적으로 고장이 발생하더라도 회복시 살아있는 프로세스들의 수행을 대기시키지 않고, 회복 프로세스들 중 하나의 회복 프로세스에게만 과부하가 발생하지 않도록 한다. 또한, 제안하는 알고리즘은 각 회복 프로세스의 회복 과정이 다른 회복 프로세스의 연속적인 고장들에 의해 지연되지 않도록 한다. 본 논문에서는 제안하는 회복 알고리즘의 정당성을 증명하고, 시뮬레이션을 통해서 제안하는 회복 알고리즘이 기존 회복 알고리즘에 비해 고장난 프로세스의 평균회복시간을 단축시킨다는 것을 보여준다.Abstract Causal message logging has the advantages of optimistic message logging during failure-free execution and pessimistic message logging during recovery. In this paper, we present a new recovery algorithm based on causal message logging for improving asynchrony among recovering processes. Existing recovery algorithms based on causal message logging block the execution of live processes or require high synchronization among recovering processes. As each recovering process is responsible for only its recovery in our algorithm, the algorithm avoids blocking the execution of live processes during recovery even in concurrently multiple failures and overloading only one among recovering processes. Moreover, it allows the recovery of each recovering process not to be delayed by the continuous failures of other recovering processes. We prove the correctness of our recovery algorithm, and our simulation results show that our algorithm reduces the average recovery time of a failed process compared with the existing recovery algorithms.

Deadbeat and Hierarchical Predictive Control with Space-Vector Modulation for Three-Phase Five-Level Nested Neutral Point Piloted Converters

  • Li, Junjie;Chang, Xiangyu;Yang, Dirui;Liu, Yunlong;Jiang, Jianguo
    • Journal of Power Electronics
    • /
    • v.18 no.6
    • /
    • pp.1791-1804
    • /
    • 2018
  • To achieve a fast dynamic response and to solve the multi-objective control problems of the output currents, capacitor voltages and system constraints, this paper proposes a deadbeat and hierarchical predictive control with space-vector modulation (DB-HPC-SVM) for five-level nested neutral point piloted (NNPP) converters. First, deadbeat control (DBC) is adopted to track the reference currents by calculating the deadbeat reference voltage vector (DB-RVV). After that, all of the candidate switching sequences that synthesize the DB-RVV are obtained by using the fast SVM principle. Furthermore, according to the redundancies of the switch combination and switching sequence, a hierarchical model predictive control (MPC) is presented to select the optimal switch combination (OSC) and optimal switching sequence (OSS). The proposed DB-HPC-SVM maintains the advantages of DBC and SVM, such as fast dynamic response, zero steady-state error and fixed switching frequency, and combines the characteristics of MPC, such as multi-objective control and simple inclusion of constraints. Finally, comparative simulation and experimental results of a five-level NNPP converter verify the correctness of the proposed DB-HPC-SVM.