• Title/Summary/Keyword: Average-link method

Search Result 105, Processing Time 0.026 seconds

Fault Diagnosis for 3-Phase Diode Rectifier using Harmonic Ripples of DC Link Voltage (직류단 전압의 고조파 맥동 검출을 이용한 3상 다이오드 정류기의 고장 진단)

  • Park, Je-Wook;Baek, Seong-Won;Kim, Jang-Mok;Lee, Dong-Choon;Lee, Kyo-Beum
    • The Transactions of the Korean Institute of Power Electronics
    • /
    • v.16 no.5
    • /
    • pp.457-465
    • /
    • 2011
  • The fault analysis and detecting algorithm for a 3 phase diode rectifier is proposed. The 3 phase dioderectifier is used for the AC power rectifier of the PWM inverter. The input power or diode faults cause theripples of the DC voltage, degradation of the control performance and life shortening of the DC link capacitor.In this paper, the ripple of the DC voltage is mathematically analyzed for the earth fault of input power andopen circuit fault of the diode, respectively. The fault detection and type of fault can be obtained by comparingthe average DC voltage and the instant DC voltage which is sampled with 6 times of grid frequency. Theproposed method can be easily applicable and doesn't require additional circuit. The experimental and simulationresults are presented to verify the validity of the proposed method.

An efficient network dimensioning method for DiffServ over MPLS networks (MPLS 기반 DiffServ망에서의 효율적인 네트워크 Dimensioning에 관한 연구)

  • 조병일;유상조;정연화
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.28 no.5B
    • /
    • pp.435-447
    • /
    • 2003
  • Current existing network dimensioning method simply relies on long-time measurement data or uses average traffic characteristics of users. In this paper, we propose an efficient network dimensioning method for DiffServ over MPLS networks. First, User's SLA information is distributed from edge nodes to core nodes according to the proposed algorithm. Then at each link, class-based capacity planning is performed. For capacity planning, we proposed sets of network design parameters for DiffServ classes and bandwidth allocation schemes that are most suitable for each class. We have developed a DiffServ over MPLS network design tool using the proposed method. Simulation results show that our proposed method is able to design efficiently the required class link resources.

A Block-based Uniformly Distributed Random Node Arrangement Method Enabling to Wirelessly Link Neighbor Nodes within the Communication Range in Free 3-Dimensional Network Spaces (장애물이 없는 3차원 네트워크 공간에서 통신 범위 내에 무선 링크가 가능한 블록 기반의 균등 분포 무작위 노드 배치 방법)

  • Lim, DongHyun;Kim, Changhwa
    • Journal of Korea Multimedia Society
    • /
    • v.25 no.10
    • /
    • pp.1404-1415
    • /
    • 2022
  • The 2-dimensional arrangement method of nodes has been used in most of RF (Radio Frequency) based communication network simulations. However, this method is not useful for the an none-obstacle 3-dimensional space networks in which the propagation delay speed in communication is very slow and, moreover, the values of performance factors such as the communication speed and the error rate change on the depth of node. Such a typical example is an underwater communication network. The 2-dimensional arrangement method is also not useful for the RF based network like some WSNs (Wireless Sensor Networks), IBSs (Intelligent Building Systems), or smart homes, in which the distance between nodes is short or some of nodes can be arranged overlapping with their different heights in similar planar location. In such cases, the 2-dimensional network simulation results are highly inaccurate and unbelievable so that they lead to user's erroneous predictions and judgments. For these reasons, in this paper, we propose a method to place uniformly and randomly communication nodes in 3-dimensional network space, making the wireless link with neighbor node possible. In this method, based on the communication rage of the node, blocks are generated to construct the 3-dimensional network and a node per one block is generated and placed within a block area. In this paper, we also introduce an algorithm based on this method and we show the performance results and evaluations on the average time in a node generation and arrangement, and the arrangement time and scatter-plotted visualization time of all nodes according to the number of them. In addition, comparison with previous studies is conducted. As a result of evaluating the performance of the algorithm, it was found that the processing time of the algorithm was proportional to the number of nodes to be created, and the average generation time of one node was between 0.238 and 0.28 us. ultimately, There is no problem even if a simulation network with a large number of nodes is created, so it can be sufficiently introduced at the time of simulation.

Adaptive Opimization of MIMO Codebook to Channel Conditions for Split Linear Array (분할된 선형배열안테나를 위한 채널 환경에 적응하는 MIMO 코드북 최적화)

  • Mun, Cheol;Jung, Chang-Kyoo;Kwak, Yun-Sik
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.5
    • /
    • pp.736-741
    • /
    • 2009
  • In this paper, adaptive optimizations of precoder codebook to channel conditions is proposed for a multiuser multiple-input multiple-output (MIMO) system with split linear array and limited feedback. We propose adaptive method for constructing a precoder codebook by coloring the random vector quantization codebook at each link by using limited long-term feedback information on transmit correlation matrix of each link. It is shown that the proposed multiuser MIMO codebook design scheme outperforms existing multiuser MIMO codebook design schemes for various channel conditions in terms of the average sum throughput of multiuser MIMO systems using zero-forcing maximum eigenmode transmission and limited feedback.

  • PDF

Normalized CP-AFC with multistage tracking mode for WCDMA reverse link receiver (다단 추적 모드를 적용한 WCDMA 역방향 링크 수신기용 Normalized CP-AFC)

  • Do, Ju-Hyeon;Lee, Yeong-Yong;Kim, Yong-Seok;Choe, Hyeong-Jin
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.8
    • /
    • pp.14-25
    • /
    • 2002
  • In this paper, we propose a modified AFC algorithm which is suitable for the implementation of WCDMA reverse link receiver modem. To reduce the complexity, the modified CP-FDD algorithm named 'Normalized CP-FDD' is applied to the AFC loop. The proposed FDD algorithm overcomes the conventional CP-FDD's sensitivity to the variance of input signal amplitude and increases the linear range of S -curve. Therefore, offset frequency estimation using the proposed scheme can be more stable than the conventional method. Unlike IS-95, since pilot symbol in WCDMA is not transmitted continuously, we introduce a moving average filter at the FDD input to increase the number of cross-product. So, tracking speed and stability are improved. For more rapid frequency acquisition and tracking, we adopt a multi-stage tracking mode. Using NCO having ROM table structure, the frequency offset is compensated. We applied the proposed algorithm in the implementation of WCDMA base station modem successfully.

Compensation of Neutral Point Deviation under Generalized 3-Phase Imbalance in 3-level NPC

  • Jung, Kyungsub;Suh, Yongsug
    • Journal of Power Electronics
    • /
    • v.18 no.6
    • /
    • pp.1866-1878
    • /
    • 2018
  • This paper presents a neutral point deviation and ripple compensation control method for application to 3-level NPC converters. The neutral point deviation and its harmonic components are analyzed with a focus on the average current flowing through the neutral point of the dc-link. This paper also proposes a control scheme to compensate for the neutral point deviation and dominant harmonic components 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 converters. Simulation and experimental results are presented to verify the validity of the proposed method.

Development of Vehicle Queue Length Estimation Model Using Deep Learning (딥러닝을 활용한 차량대기길이 추정모형 개발)

  • Lee, Yong-Ju;Hwang, Jae-Seong;Kim, Soo-Hee;Lee, Choul-Ki
    • The Journal of The Korea Institute of Intelligent Transport Systems
    • /
    • v.17 no.2
    • /
    • pp.39-57
    • /
    • 2018
  • The purpose of this study was to construct an artificial intelligence model that learns and estimates the relationship between vehicle queue length and link travel time in urban areas. The vehicle queue length estimation model is modeled by three models. First of all, classify whether vehicle queue is a link overflow and estimate the vehicle queue length in the link overflow and non-overflow situations. Deep learning model is implemented as Tensorflow. All models are based DNN structure, and network structure which shows minimum error after learning and testing is selected by diversifying hidden layer and node number. The accuracy of the vehicle queue link overflow classification model was 98%, and the error of the vehicle queue estimation model in case of non-overflow and overflow situation was less than 15% and less than 5%, respectively. The average error per link was about 12%. Compared with the detecting data-based method, the error was reduced by about 39%.

Performance Analysis of a Statistical Packet Voice/Data Multiplexer (통계적 패킷 음성 / 데이터 다중화기의 성능 해석)

  • 신병철;은종관
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.3
    • /
    • pp.179-196
    • /
    • 1986
  • In this paper, the peformance of a statistical packet voice/data multiplexer is studied. In ths study we assume that in the packet voice/data multiplexer two separate finite queues are used for voice and data traffics, and that voice traffic gets priority over data. For the performance analysis we divide the output link of the multiplexer into a sequence of time slots. The voice signal is modeled as an (M+1) - state Markov process, M being the packet generation period in slots. As for the data traffic, it is modeled by a simple Poisson process. In our discrete time domain analysis, the queueing behavior of voice traffic is little affected by the data traffic since voice signal has priority over data. Therefore, we first analyze the queueing behavior of voice traffic, and then using the result, we study the queueing behavior of data traffic. For the packet voice multiplexer, both inpur state and voice buffer occupancy are formulated by a two-dimensional Markov chain. For the integrated voice/data multiplexer we use a three-dimensional Markov chain that represents the input voice state and the buffer occupancies of voice and data. With these models, the numerical results for the performance have been obtained by the Gauss-Seidel iteration method. The analytical results have been verified by computer simylation. From the results we have found that there exist tradeoffs among the number of voice users, output link capacity, voic queue size and overflow probability for the voice traffic, and also exist tradeoffs among traffic load, data queue size and oveflow probability for the data traffic. Also, there exists a tradeoff between the performance of voice and data traffics for given inpur traffics and link capacity. In addition, it has been found that the average queueing delay of data traffic is longer than the maximum buffer size, when the gain of time assignment speech interpolation(TASI) is more than two and the number of voice users is small.

  • PDF

Clipping Scheme and Noise Analysis for the PAPR Reduction of OFDM-FDMA Communication System (OFDM-FDMA통신 시스템에서 PAPR 저감을 위한 Clipping 기법과 잡음 분석)

  • Tran Phuong, Hoa
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.15 no.11
    • /
    • pp.1026-1033
    • /
    • 2004
  • Clipping is a simple and convenient PAPR reduction method to prevent the high-speed OFDM communication system from the nonlinear distortion. However, it inherently produces clip noise so that BER performance can be degraded. Clipping noise can be divided into in-band and out-of-band clipping noise. In this paper, we study the clipping effect on the forward link of the OFDM-FDMA system. BER performance of OFDM-FDMA system using clipping method is theoretically analyzed. We also investigate the BER performance of the clipped OFDM-FDMA signal through the HPA. From the simulation results it can be quantified how much the BER performance of OFDM-FDMA system is degraded by the clipping method. From the study results, we can choose the appropriate IBO value and CR(clip ratio) to get the desired BER performance.

Obscene Material Searching Method in WWW (WWW상에서 음란물 검색기법)

  • 노경택;김경우;이기영;김규호
    • Journal of the Korea Society of Computer and Information
    • /
    • v.4 no.2
    • /
    • pp.1-7
    • /
    • 1999
  • World-Wide Web(WWW) is a protocol for changing information exchanges which is central to text documents in the existing network to make a multimedia data exchanges. It is possible for a beginner to search and access data which he wants to find as data were stored in the form of hypertext. The easiness for searching and accessing the multimedia data in WWW makes a important role for obscene materials to be toward generalization and multimedia and occurs social problems for them to be commercialized, while other researchers have actively studied the way to block effectively the site providing obscene materials for solving such problems. This paper presents and implements the blocking method for the sites having obscene material as it effectively search them. The proposed model was based on Link-Based information retrieval method and proved that it accomplished more efficient retrieval of relevant documents than probabilistic model when compared the one with the other which is known to generate the most correct results. The improvements in the average recall and precision ratio were shown as 12% and 8% respectively. Especially, the retrieval capability of relevant documents which include non-text data and have a few links increased highly.

  • PDF