• Title/Summary/Keyword: Burst Channel

Search Result 173, Processing Time 0.022 seconds

Development of mechanistic cladding rupture model for severe accident analysis and application in PHEBUS FPT3 experiment

  • Gao, Pengcheng;Zhang, Bin;Li, Jishen;Shan, Jianqiang
    • Nuclear Engineering and Technology
    • /
    • v.54 no.1
    • /
    • pp.138-151
    • /
    • 2022
  • Cladding ballooning and rupture are the important phenomena at the early stage of a severe accident. Most severe accident analysis codes determine the cladding rupture based on simple parameter models. In this paper, a FRTMB module was developed using the thermal-mechanical model to analyze the fuel mechanical behavior. The purpose is to judge the cladding rupture with the severe accident analysis code. The FRTMB module was integrated into the self-developed severe accident analysis code ISAA to simulate the PHEBUS FPT3 experiment. The predicted rupture time and temperature of the cladding were basically consistent with the measured values, which verified the correctness and effectiveness of the FRTMB module. The results showed that the rising of gas pressure in the fuel rod and high temperature led to cladding ballooning. Consequently, the cladding hoop strain exceeded the strain limit, and the cladding burst. The developed FRTMB module can be applied not only to rod-type fuel, but also to plate-type fuel and other types of reactor fuel rods. Moreover, the FRTMB module can improve the channel blockage model of ISAA code and make contributions to analyzing the effect of clad ballooning on transient and subsequent parts of core degradation.

R-S Decoder Design for Single Error Correction and Erasure Generation (단일오류 정정 및 Erasure 발생을 위한 R-S 복호기 설계)

  • Kim, Yong Serk;Song, Dong Il;Kim, Young Woong;Lee, Kuen Young
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.23 no.5
    • /
    • pp.719-725
    • /
    • 1986
  • Reed-solomon(R-S) code is very effective to coerrect both random and burst errors over a noise communication channel. However, the required hardware is very complex if the B/M algorithm was employed. Moreover, when the error correction system consists of two R-S decoder and de-interleave, the I/O data bns lines becomes 9bits because of an erasure flag bit. Thus, it increases the complexity of hardware. This paper describes the R-S decoder which consisits of a error correction section that uses a direct decoding algorithm and erasure generation section and a erasure generation section which does not use the erasure flag bit. It can be shown that the proposed R-S dicoder is very effective in reducing the size of required hardware for error correction.

  • PDF

Characteristics of Underwater Acoustic Channel and Performance of Multi-Carrier System in Littoral Ocean near Busan City (부산인근 해역의 수중음향통신 채널특성과 다중반송파 시스템의 성능)

  • Kim, Jongjoo;Park, Jihyun;Bae, Minja;Yoon, Jong Rak
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.21 no.12
    • /
    • pp.2394-2402
    • /
    • 2017
  • The frequency selective fading by multipaths determines a performance of underwater acoustic communication system in shallow littoral ocean. In this study, a characteristics of underwater acoustic channel and performance of multi-carrier system is evaluated in littoral ocean with a 50m deep water, an effective wave height of 0.5m and sandy mud bottom near Busan city. A multipath delay spread and time and frequency domain are presented as a function of a transmitter-to-receiver range. A bit-error-rate of a 5 channel 4FSK(Frequency Shift Keying) with a transmission rate of 1kbps, is examined and RS(Reed-Solomon) code is also adopted to remove a burst error due to time domain fading. A number of multipath are less than four and a bit-error-rate is decreased as an increase of a transmitter-to-receiver range which gives a congestion of multi-paths resulting in a decrease of time and frequency domain fading. The measured bit-error-rate is about 10-4 at greater than 600m of transmitter-to-receiver range.

Adaptive Error Detection Using Causal Block Boundary Matching in Block-Coded Video (블록기반 부호화 비디오에서 인과적 블록 경계정합을 이용한 적응적 오류 검출)

  • 주용수;김태식;김남철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.29 no.8C
    • /
    • pp.1125-1132
    • /
    • 2004
  • In this Paper, we Propose an effective boundary matching based error detection algorithm using causal neighbor blocks to improve video quality degraded from channel error in block-coded video. The proposed algorithm first calculates boundary mismatch powers between a current block and each of its causal neighbor blocks. It then decides that a current block should be normal if all the mismatch powers are less than an adaptive threshold, which is adaptively determined using the statistics of the two adjacent blocks. In some experiments under the environment of 16bi1s burst error at bit error rates (BERs) of 10$^{-3}$ -10$^{-4}$ , it is shown that the proposed algorithm yields the improvements of maximum 20% in error detection rate and of maximum 3.5㏈ in PSNR of concealed kames, compared with Zeng's error detection algorithm.

Wireless Internet DiffServ Packet Scheduling Algorithm over Wireless Networks with Location-dependent Channel Errors (위치 종속적 채널 에러 특성을 갖는 무선망에서 인터넷 DiffServ QoS 제공을 위한 패킷 스케줄링 알고리즘)

  • 신강식;유상조
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.40 no.12
    • /
    • pp.46-58
    • /
    • 2003
  • The recent Internet is changing from its best-effort service and needs the network structure and traffic engineering, which can support various applications requiring differentiated traffic processing and high quality of service. The extension of the Internet from wired to wireless system generating location-dependent and burst errors make more difficult to support a good service with the existing packet scheduling algorithm. In this paper, we propose a wireless diffserv packet scheduling (WDSPS) algorithm that can provide reliable service in the differentiated wireless internet service network. The proposed scheduling algorithm solves the HOL(head of line) blocking problems of class queue occurred in wireless network, supports the differentiated service for each class which is defined in differentiated service networks and makes possible the gradual and efficient service compensation not only among classes but also among flows to prevent the monopoly of one class or one flow. Through simulations, we show that our proposed WDSPS scheduling algorithm can provide the required QoS differentiation between classes and enhance the service throughput in various wireless network conditions.

CME and radio characteristics of making large solar proton events

  • Hwang, Jung-A;Cho, Kyung-Suk;Bong, Su-Chan;Kim, Su-Jin;Park, Young-Deuk
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.35 no.1
    • /
    • pp.33.2-33.2
    • /
    • 2010
  • We have investigated a relationship among the solar proton events (SPEs), coronal mass ejections (CMEs) and solar flares during the solar cycle 23 (1997-2006). Using 63 SPE dataset, we found that SPE rise time, duration time, and decrease times depend on CME speed and SPE peak intensity depends on the CME earthward direction parameter as well as CME speed and x-ray flare intensity. While inspecting the relation between SPE peak intensity and the CME earthward direction parameter, we found that there are two groups: first group consists of large 6 SPEs (> 10,000 pfu at >10 MeV proton channel of GOES satellite) and shows a very good correlation (cc=0.65) between SPE peak intensity and CME earthward direction parameter. The second group has a relatively weak SPE peak intensity and shows poor correlation between SPE peak intensity and the CME earthward direction parameter (cc=0.01). By investigating characteristics of 6 SPEs in the first group, we found that there are special common conditions of the extremely large proton events (group 1); (1) all the SPEs are associated with very fast halo CME (>1400km/s), (2) they are almost located at disk region, (3) they also accompany large flare (>M7), (4) all they are preceded by another wide CMEs, and (5) they all show helmet streamer nearby the main CME. In this presentation, we will give details of the energy spectra of the 6 SPE events from the ERNE/HED aboard the Solar and Heliospheric Observatory (SOHO), and onset time comparison among the SPE, flare, type II burst, and CME.

  • PDF

End-to-End Congestion Control of High-Speed Gigabit-Ethernet Networks based on Smith's Principle

  • Lee, Seung-Hyub;Cho, Kwang-Hyun
    • Proceedings of the IEEK Conference
    • /
    • 2000.07a
    • /
    • pp.101-104
    • /
    • 2000
  • Nowadays, the issue of congestion control in high-speed communication networks becomes critical in view of the bandwidth-delay products for efficient data flow. In particular, the fact that the congestion is often accompanied by the data flow from the high-speed link to low-speed link is important with respect to the stability of closed-loop congestion control. The Virtual-Connection Network (VCN) in Gigabit Ethernet networks is a packet-switching based network capable of implementing cell- based connection, link-by-link flow-controlled connection, and single- or multi-destination virtual connections. VCN described herein differ from the virtual channel in ATM literature in that VCN have link-by-link flow control and can be of multi-destination. VCNs support both connection-oriented and connectionless data link layer traffic. Therefore, the worst collision scenario in Ethernet CSMA/CD with virtual collision brings about end-to-end delay. Gigabit Ethernet networks based on CSMA/CD results in non-deterministic behavior because its media access rules are based on random probability. Hence, it is difficult to obtain any sound mathematical formulation for congestion control without employing random processes or fluid-flow models. In this paper, an analytical method for the design of a congestion control scheme is proposed based on Smith's principle to overcome instability accompanied with the increase of end-to-end delays as well as to avoid cell losses. To this end, mathematical analysis is provided such that the proposed control scheme guarantees the performance improvement with respect to bandwidth and latency for selected network links with different propagation delays. In addition, guaranteed bandwidth is to be implemented by allowing individual stations to burst several frames at a time without intervening round-trip idle time.

  • PDF

A Study on The Performance of ATM Cell Transmission over Wireless Link (무선채널환경에서 ATM데이터의 전송성능분석 및 개선연구)

  • 이하철;이병섭
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.9 no.5
    • /
    • pp.589-602
    • /
    • 1998
  • While ATM technology results in considerable advantages(less overhead, increased throughput) in an optical networks, It causes severe problems(single and burst error) when ATM is transmitted over an error-prone channel, such as wireless link. In this paper we describe our investigation on ATM over wireless network. we first evaluate performance of ATM data transmission over a wireless link. Secondly we analyze performance improvements of Forward Error Correction(FEC) or ARQ(Automatic Repeat reQuest) scheme applied to wireless ATM link and provide performance comparison between FEC and ARQ through the use of packet error rate and throughput. Lastly we suggest error control architecture to overcome the impact of the bit error characteristics of a wireless link on wireless ATM network.

  • PDF

Enhanced Snoop Protocol for Improving TCP Throughput in Wireless Links (무선 링크에서 TCP 처리율 향상을 위한 Enhanced Snoop 프로토콜)

  • Cho Yong-bum;Won Gi-sup;Cho Sung-joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.6B
    • /
    • pp.396-405
    • /
    • 2005
  • Snoop protocol is one of the efficient schemes to compensate TCP packet loss and enhance TCP throughput in wired-cum-wireless networks. However, Snoop protocol has a problem; it cannot perform local retransmission efficiently under the bursty-error prone wireless link. In this paper, we propose Enhanced Snoop(E-Snoop) protocol to solve this problem of Snoop protocol. With E-Snoop protocol, packet losses can be noticed by receiving new ACK packets as well as by receiving duplicate ACK packets or local retransmission timeout. Therefore, TCP throughput can be enhanced by fast recognition of bursty packet losses and fast local retransmissions. From the simulation results, E-Snoop protocol can improve TCP throughput more efficiently than Snoop protocol and can yield more TCP improvement especially in the channel with high packet loss rates.

Discrete-Time Analysis of Throughput and Response Time for LAP Derivative Protocols under Markovian Block-Error Pattern (마르코프 오류모델 하에서의 LAP 계열 프로토콜들의 전송성능과 반응시간에 대한 이산-시간 해석)

  • Cho, Young-Jong;Choi, Dug-Kyoo
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.11
    • /
    • pp.2786-2800
    • /
    • 1997
  • In this paper, we investigate how well the channel memory (statistical dependence in the occurrence of transmission errors) can be used in the evaluation of widely used error control schemes. For this we assume a special case named as the simplest Markovian block-error pattern with two states, in which each block is classified into two classes of whether the block transmission is in error or not. We apply the derived pattern to the performance evaluation of the practical link-level procedures, LAPB/D/M with multi-reject options, and investigate both throughput and user-perceived response time behaviors on the discrete-time domain to determine how much the performance of error recovery action is improved under burst error condition. Through numerical examples, we show that the simplest Markovian block-error pattern tends to be superior in throughput and delay characteristics to the random error case. Also, instead of mean alone, we propose a new measure of the response time specified as mean plus two standard deviations 50 as to consider user-perceived worst cases, and show that it results in much greater sensitivity to parameter variations than does mean alone.

  • PDF