• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.10B
• /
• pp.1824-1831
• /
• 1999

In this paper, the data recovery performance of systematic erasure codes in burst loss environments is analyzed and the estimation method of redundant data according to loss characteristics is suggested. The burstness of packet loss is modeled by Gilbert model, and the performance of proposed packet loss recovery method in the case of using systematic erasure code is analyzed based on previous study on the loss recovery in the case of using erasure code. The required redundancy data fitting method for systematic erasure code in the condition of given loss property is suggested in the consideration of packet loss characteristics such as average packet loss rate and average loss length.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.11A
• /
• pp.1045-1050
• /
• 2010

This paper proposes a new $2{\times}2$ spatial-multiplexing(SM) scheme which is constructed by serially concatenating an orthogonal precoder with a conventional SM. Compared to the conventional SM, the proposed scheme achieves improved performance under erasure fading channels without any performance loss under non-erasure fading channels. Particularly the performance gain is more larger as a correlation value between two receive antennas increases.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.12A
• /
• pp.1960-1965
• /
• 1999

In this paper, we propose a new method of erased concatenated code with RS-convolutional code. In the method, we make use of erasure for undecoded information when we have some errors in RS decoding. For decoding with erasure, the method is processed inner decoding and outer decoding again. After the erasure decoding, if the decoding result is better than the previous one, then we use this result. If not, use the previous one. In this paper, we use concatenated RS(63,31)-convolutional(4.1/2) code. Simulation result is compared with calculation result for performance analysis. According to the result, the proposed method has better performance than the others without erasure such that 2dB when 0.5$\leq\rho\leq$1 and 4dB when $\rho\leq$0.3.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.518-524
• /
• 2009

Single parity check (SPC) product codes are simple yet powerful codes that are used to correct errors and/or recover erasures. The focus of this paper is to evaluate the performance of such codes under erasure scenarios and to develop a closed-form tight upper bound for the post-decoding erasure rate. Closed-form exact expressions are derived for up to seven erasures. Previously published closed-form bounds assumed that all unrecoverable patterns should contain four erasures in a square. Additional non-square patterns are accounted for in the proposed expressions. The derived expressions are verified using exhaustive search. Eight or more erasures are accounted for by using a bound. The developed expressions improve the evaluation of the recoverability of SPC product codes without the need for simulation or search algorithms, whether exhaustive or novel.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.2C
• /
• pp.219-228
• /
• 2010

In this paper, performance of RS (Reed-Solomon), turbo and LDPC (low density parity check) code in the binary symmetric erasure channel is investigated. When the average erasure length is reduced, the frequency of short erasures is increased. The RS code shows serious performance degradation in such an environment since decoding is carried out symbol-by-symbol. As the erasure length is increased, however, the RS code shows much improved en-or performance. On the other hand, the message and corresponding parity symbols of the turbo code can be erased at the same time for the long erasures. Accordingly, iterative decoding of the turbo code can not improve error performance any more for such a long erasure. The LDPC code shows little difference in error performance with respect to the variation of the average erasure length due to the virtual interleaving effect. As a result, the LDPC code has much better erasure decoding performance than the RS and turbo code.

• Progress in Medical Physics
• /
• v.20 no.4
• /
• pp.199-207
• /
• 2009

It is important to initialize Image Plate (IP) completely for removing residual latent image by sodium lamp for reliability and repeatability of computed radiography (CR) system. The purpose of this study was to evaluate latent images of computed radiography (CR) images respect to delay time after erasure of foregone latent image and its effect, and erasure level. Erasure thoroughness for CR acceptance test from American Association of Physicist in Medicine (AAPM) Report 93 (2006) was also evaluated. Measurements were made on a CR (Agfa CR 25; Agfa, BELGIUM) system. Chest postero-anterior (PA), Hand PA, L-spine lateral radiographs were chosen for evaluation. Chest phantom (3D-torso; CIRS, USA) was used for Chest PA and L-spine lateral radiography. For Hand PA radiography, projections was done without phantom. Except Hand PA radiographs, noise was increased with delay time, and ghost image was appeared on overexposed area. Effect of delay after erasure on latent image was not seen on naked eye, but standard deviation (SD) of pixel value on overexposed area was relatively higher than that of other areas. On Hand PA and Chest PA radiographs, noise were not occurred by adjustment of erasure level. On L-spine lateral images at lower erasure level than standard level, noise including ghost image were occurred because of high tube current. Erasure thoroughness of CR system in our department was to be proved by these evaluation. The results of this study could be used as a baseline for IP initialization and reliability of CR images.

• Proceedings of the Korean Institute of Electrical and Electronic Material Engineers Conference
• /
• 2006.11a
• /
• pp.112-113
• /
• 2006

In this paper. we investigated a characteristic of holographic grating data erasure with non-polarized beam at amorphous chalcogenide As-Ge-Se-S thin film. A sample of holographic grating data was formed with DPSS laser for setup. Then, the erasure process was performed with He-Ne laser vertically at sample. As-Ge-Se-S(single layer). Ag/As-Ge-Se-S(double layer) and As-Ge-Se-S/Ag/As-Ge-Se-S(multi-layer) are manufactured to compare their characteristic of erasure.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.1
• /
• pp.57-62
• /
• 2014

The benefits of infrastructure support are shown by analyzing a throughput scaling law of an erasure network in which multiple relay stations (RSs) are regularly placed. Based on suitably modeling erasure probabilities under the assumed network, we show our achievable network throughput in the hybrid erasure network. More specifically, we use two types of physical models, a exponential decay model and a polynomial decay model. Then, we analyze our achievable throughput using two existing schemes including multi-hop transmissions with and without help of RSs. Our result indicates that for both physical models, the derived throughput scaling law depends on the number of nodes and the number of RSs.

• 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.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.20 no.5
• /
• pp.911-916
• /
• 2016

The nearest-neighbor multihop routing with/without infrastructure support is known to achieve the optimal capacity scaling in a large packet-erasure network in which multiple wireless nodes and relay stations are regularly placed and packets are erased with a certain probability. In this paper, a throughput scaling law is shown for an infrastructure-supported erasure network where wireless nodes are randomly distributed, which is a more feasible scenario. We use an exponential decay model to suitably model an erasure probability. To achieve high throughput in hybrid random erasure networks, the multihop routing via highway using the percolation theory is proposed and the corresponding throughput scaling is derived. As a main result, the proposed percolation highway based routing scheme achieves the same throughput scaling as the nearest-neighbor multihop case in hybrid regular erasure networks. That is, it is shown that no performance loss occurs even when nodes are randomly distributed.