• Title/Summary/Keyword: Fast transmission

Search Result 673, Processing Time 0.025 seconds

A Novel Algorithm for Fault Type Fast Diagnosis in Overhead Transmission Lines Using Hidden Markov Models

  • Jannati, M.;Jazebi, S.;Vahidi, B.;Hosseinian, S.H.
    • Journal of Electrical Engineering and Technology
    • /
    • v.6 no.6
    • /
    • pp.742-749
    • /
    • 2011
  • Power transmission lines are one of the most important components of electric power system. Failures in the operation of power transmission lines can result in serious power system problems. Hence, fault diagnosis (transient or permanent) in power transmission lines is very important to ensure the reliable operation of the power system. A hidden Markov model (HMM), a powerful pattern recognizer, classifies events in a probabilistic manner based on fault signal waveform and characteristics. This paper presents application of HMM to classify faults in overhead power transmission lines. The algorithm uses voltage samples of one-fourth cycle from the inception of the fault. The simulation performed in EMTPWorks and MATLAB environments validates the fast response of the classifier, which provides fast and accurate protection scheme for power transmission lines.

The Noise Suppression of Data Transmission in MAGLEV (MAGLEV 정보 송수신상의 노이즈 억제에 관한 연구)

  • Kim, Jong-Bum;Lee, Jun-Koo;Park, Seok-Ha;Kim, Yang-Mo
    • Proceedings of the KIEE Conference
    • /
    • 1998.07a
    • /
    • pp.362-364
    • /
    • 1998
  • The transmission of information by inductive loop is required for train-safety and fast running. FSK modulation has been used for transmission of information in fast running. Transmission channel between train and ground must be protected from interference of power line. To protect transmission data from noises, the analysis on the transmission line must be performed in advance. In this paper, transmission line is analyzed in view of reflection and time delay in both noise and signal.

  • PDF

A New Fast P2P Video Transmission Method Applied in Asymmetrical Speed Channel Environment

  • Wang, Zhang;Zhang, Jixian;Li, Haitao;Liu, Jian
    • Journal of Communications and Networks
    • /
    • v.12 no.3
    • /
    • pp.209-215
    • /
    • 2010
  • In an asymmetrical speed channel environment like asymmetric digital subscriber line, the up-link bandwidth is normally smaller than the down-link bandwidth, which will lead to extremely low utilization of down-link bandwidth when current P2P video transmission is applied. To overcome this, a new fast P2P video transmission method applied in an asymmetrical speed channel environment is proposed in this paper. On the basis of the many-to-one concept, the proposed method uses a new multipeer aggregation technique to enhance the utilization of down-link bandwidth. In addition, an adaptive peer assignment algorithm is also introduced in order to minimize the overall transmission time. Experimental results show that by using our proposed method, the utilization of down-link bandwidth is significantly improved, and the overall transmission time is greatly reduced.

Enhancements to the fast recovery Algorithm of TCP NewReno using rapid loss detection (빠른 손실 감지를 통한 TCP NewReno의 Fast Recovery 개선 알고리듬)

  • 김동민;김범준;김석규;이재용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.7B
    • /
    • pp.650-659
    • /
    • 2004
  • Domestic wireless network environment is changing rapidly while adapting to meet service requirements of users and growth of market. As a result, reliable data transmission using TCP is also expected to increase. Since TCP assumes that it is used in wired networt TCP suffers significant performance degradation over wireless network where packet losses are not always result of network congestion. Especially RTO imposes a great performance degradation of TCP. In this paper, we propose DAC$^{+}$ and EFR in order to prevent performance degradation by quickly detecting and recovering loss without RTO during fast recovery. Compared with TCP NewReno, proposed scheme shows improvements in steady-state in terms of higher fast recovery Probability and reduced response time.

Fast Depth Video Coding with Intra Prediction on VVC

  • Wei, Hongan;Zhou, Binqian;Fang, Ying;Xu, Yiwen;Zhao, Tiesong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.3018-3038
    • /
    • 2020
  • In the stereoscopic or multiview display, the depth video illustrates visual distances between objects and camera. To promote the computational efficiency of depth video encoder, we exploit the intra prediction of depth videos under Versatile Video Coding (VVC) and observe a diverse distribution of intra prediction modes with different coding unit sizes. We propose a hybrid scheme to further boost fast depth video coding. In the first stage, we adaptively predict the HADamard (HAD) costs of intra prediction modes and initialize a candidate list according to the HAD costs. Then, the candidate list is further improved by considering the probability distribution of candidate modes with different CU sizes. Finally, early termination of CU splitting is performed at each CU depth level based on the Bayesian theorem. Our proposed method is incorporated into VVC intra prediction for fast coding of depth videos. Experiments with 7 standard sequences and 4 Quantization parameters (Qps) validate the efficiency of our method.

SHD Digital Cinema Distribution over a Fast Long-Distance Network

  • Takahiro Yamaguchi;Daisuke Shirai;Mitsuru Nomura;Kazuhiro Shirakawa;Tatsuya Fujii;Tetsuro Fujii;Kim, io-Oguchi
    • Journal of Broadcast Engineering
    • /
    • v.9 no.2
    • /
    • pp.119-130
    • /
    • 2004
  • We have developed a prototype super-high-definition (SHD) digital cinema distribution system that can store, transmit, and display eight-million-pixel motion pictures that have the image quality of a 35-mm film movie. The system contains a movie server, a real-time decoder, and an SHB projector. Using a Gigabit Ethernet link and TCP/IP, the server transmits JPEG2000 compressed motion picture data streams to the decoder at transmission speeds as high as 300 Mbps. The received data streams are decompressed by the decoder, and then projected onto a screen via the projector. By using an enlarged TCP window, multiple TCP streams, and a shaping function to control the data transmission quantity, we achieved real-time streaming of SHD movie data at about 300 Mbps between Chicago and Los Angeles, a distance of more than 3000 km. We also improved the decoder performance to show movies with Image qualities of 450 Mbps or higher. Since UDP is more suitable than TCP for fast long-distance streaming, we have developed an SHD digital cinema UDP relay system, in which UDP is used for transmission over a fast long-distance network. By using four pairs of server-side-proxy and decoder-side-proxy, 450-Mbps movie data streams could be transmitted.

Circular Fast Fourier Transform Application: A Useful Script for Fast Fourier Transform Data Analysis of High-resolution Transmission Electron Microscopy Image

  • Kim, Jin-Gyu;Yoo, Seung Jo;Kim, Chang-Yeon;Jou, Hyeong-Tae
    • Applied Microscopy
    • /
    • v.44 no.4
    • /
    • pp.138-143
    • /
    • 2014
  • Transmission electron microscope (TEM) is an excellent tool for studying the structure and properties of nanostructured materials. As the development of $C_s$-corrected TEM, the direct analysis of atomic structures of nanostructured materials can be performed in the high-resolution transmission electron microscopy (HRTEM). Especially, fast Fourier transform (FFT) technique in image processing is very useful way to determine the crystal structure of HRTEM images in reciprocal space. To apply FFT technique in HRTEM analysis in more reasonable and friendly manner, we made a new circular region of interest (C-ROI) FFT script and tested it for several HRTEM analysis. Consequentially, it was proved that the new FFT application shows more quantitative and clearer results than conventional FFT script by removing the streaky artifacts in FFT pattern images. Finally, it is expected that the new FFT script gives great advantages for quantitative interpretation of HRTEM images of many nanostructured materials.

A GoP-based Dynamic Transmission Scheduling for supporting Fast Scan Functions with m-times playback rate in Video-On-Demand (주문형 비디오에서 m배속 고속 재생을 위한 GoP 기반 동적 전송 스케줄 작성)

    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9B
    • /
    • pp.1643-1651
    • /
    • 1999
  • Video-On-Demand (VOD) is expected to provide the user with interactive operations such as VCR functions. In particular, fast scan functions like “Fast Forward” of “Fast Backward” for a certain speedup playback are required. Since they require a significant amount of system resources, schemes to reduce bandwidth requirements for the network or disk are needed. In MPEG standard, Group-of-Pictures (GoP) is a random access unit which can be decoded independently. Since storing and transmitting a video stream based on GoP is efficient, it is practical to support fast scan functions based on GoP. In this paper, we present a dynamic transmission scheduling scheme to support fast scan functions with m-times normal playback rate for a stored video. The proposed scheme writes a transmission schedule whenever user requests a fast scan function. That is, the scheme constructs the data set to be smoothed by skipping GoPs according to a given speedup factor, and then writes the transmission schedule by applying a bandwidth smoothing. Finally, the scheme restarts the transmission of video data to a client according to the new schedule. The proposed scheme results in speeding up the playback rate by utilizing “GoP skipping”, and then reduces the computational overhead by applying a bandwidth smoothing based on GoP.

  • PDF

A Study on the Transmission Overload Relief by Fast Switching (고속 스위칭에 의한 송전선로 과부하 해소 연구)

  • Cho, Yoon-Sung;Lee, Han-Sang;Jang, Gilsoo
    • The Transactions of The Korean Institute of Electrical Engineers
    • /
    • v.62 no.8
    • /
    • pp.1053-1058
    • /
    • 2013
  • Because of computational burden and complex topology of substation, a transmission overload relief using circuit-breaker switching was very complex and difficult. However, a on-line algorithm for reducing the overloads in transmission lines has made progress due to the advance of IT technology. This paper describes the methodology for alleviating the overloads in transmission lines by circuit-breaker switching. First, the severe contingency lists and substations were selected from the results of contingency analysis. Then the switch combinations are determined using circuit-breakers of the selected substation. The topology changes are limited to equipment outage, bus split, island split, bus merge and island merge. Finally, the fast screening and full analysis methods are used to analyze the overload in transmission lines. To verify the performance of the proposed methodology, we performed a comprehensive test for both test system and large-scale power systems. The results of these tests showed that the proposed methodology can accurately alleviate the overloads in transmission lines from online data and can be applied to on-line applications.

A Fast Optimization Algorithm for Optimal Real Power Flow (고속의 유효전력 최적조류계산 알고리즘)

  • Song, Kyung-Bin;Kim, Hong-Rae
    • Proceedings of the KIEE Conference
    • /
    • 1998.07c
    • /
    • pp.926-928
    • /
    • 1998
  • A fast optimization algorithm has been evolved from a simple two stage optimal power flow(OPF) algorithm for constrained power economic dispatch. In the proposed algorithm, we consider various constraints such as power balance, generation capacity, transmission line capacity, transmission losses, security equality, and security inequality constraints. The proposed algorithm consists of four stages. At the first stage, we solve the aggregated problem that is the crude classical economic dispatch problem without considering transmission losses. An initial solution is obtained by the aggregation concept in which the solution satisfies the power balance equations and generation capacity constraints. Then, after load flow analysis, the transmission losses of an initial generation setting are matched by the slack bus generator that produces power with the cheapest cost. At the second stage we consider transmission losses. Formulation of the second stage becomes classical economic dispatch problem involving the transmission losses, which are distributed to all generators. Once a feasible solution is obtained from the second stage, transmission capacity and other violations are checked and corrected locally and quickly at the third stage. The fourth stage fine tunes the solution of the third stage to reach a real minimum. The proposed approach speeds up the coupled LP based OPF method to an average gain of 53.13 for IEEE 30, 57, and 118 bus systems and EPRI Scenario systems A through D testings.

  • PDF