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

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.12
• /
• pp.1684-1691
• /
• 2016

Erasure codes have recently been applied to distributed storage systems due to their high storage efficiency. Regenerating codes are a kind of erasure codes, which are optimal in terms of minimum repair bandwidth. An (n,k,d)-regenerating code consists of n storage nodes where a failed node can be recovered with the help of the exactly d numbers of surviving nodes. However, if node failures occur frequently or network connection is unstable, the number of helper nodes that a failed node can contact may be smaller than d. In such cases, regenerating codes cannot repair the failed nodes efficiently since the node repair process of the codes does not work when the number of helper nodes is less than d. In this paper, we propose an operating method of regenerating codes where a failed node can be repaired from ${\bar{d}}$ helper nodes where $$k{\leq_-}{\bar{d}}{\leq_-}d$$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.4B
• /
• pp.427-436
• /
• 2001

RS product codes are widely used in digital storage systems. There are lots of decoding strategies for product code for short-length RS codes. Unfortunately many of them cannot be applied to long-length RS product codes because of the complexity of decoder. This paper proposes new decoding strategies which can be used in long length RS product codes.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.9 no.5
• /
• pp.129-132
• /
• 2009

Frame erasure is one of the most difficult problems in voice over IP (VoIP) networks and is a major source of speech quality degradation. In this paper, a frame erasure concealment algorithm based on nonlinear regression analysis is presented to minimize speech quality deterioration in code-excited linear prediction (CELP) based coders. We applied the proposed scheme to the ITU-T G.729 standard and obtained improved perceptual evaluation of speech quality (PESQ) scores compared to the conventional methods.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.8
• /
• pp.1492-1499
• /
• 2015

In this paper, we propose a clipping method for LDPC coded FH BFSK system over partial-band jamming channel. We apply the erasure insertion technique, which had been studied much earlier, now to LDPC codes and discuss its performance degradation region. By using clipping technique, the performance degradation can be removed. Finally, we discuss the erasure insertion and clipping techniques for various jamming conditions.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.8C
• /
• pp.775-781
• /
• 2007

In this paper, a modified PTS(Partial Transmit Sequences) technique that uses erasure decoding of RS (Reed-Solomon) codes is presented. At the transmitter, some check symbols in a RS codeword partitioned into subblocks are phase-rotated by phase factors. The receiver decodes received codewords by regarding the phase-rotated check symbols as erasures. Hence, this technique does not need to transmit the side information about the phase factors chosen at the transmitter. The complexity of the receiver is also reduced since the estimation process for the phase factors is not required in the receiver. There is no performance degradation due to the transmission error of the side information or the estimation error of the phase factors. To evaluate the performance of the proposed PTS technique, the CCDF(Complementary Cumulative Distribution Function) of PAPR and the BER(Bit Error Rate) are compared with those of the conventional PTS techniques.

• Journal of KIISE:Information Networking
• /
• v.31 no.1
• /
• pp.1-10
• /
• 2004

This study discusses Application-layer FEC using erasure codes. Because of the simple decoding process, erasure codes are used effectively in Application-layer FEC to deal with Packet-level errors. The large number of parity packets makes the loss rate to be small, but causes the network congestion to be worse. Thus, a redundancy control algorithm that can adjust the number of parity packets depending on network conditions is necessary. In addition, it is natural that high-priority frames such as I frames should produce more parity packets than low-priority frames such as P and B frames. In this paper, we propose a redundancy control algorithm that can adjust the amount of redundancy depending on the network conditions and depending on data priority, and test the performance in simple links and congestion links.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2009.11a
• /
• pp.281-283
• /
• 2009

본 논문에서는 군집 소실 채널 상에서 동작할 수 있는 짧은 길이의 인터리빙 된 코드들의 성능을 분석한다. 먼저 좋은 성능을 갖는 짧은 길이의 그래프 부호와 해밍부호를 설계한다. 이 후 군집 소실에 잘 대응하기 위하여 인터리빙 기능을 채널 부호화 방법에 적용한다. 생성된 짧은 코드에 적용한 인터리빙 부호를 군집 소실에 최적의 성능을 보이는 Reed-Solomon (RS) 부호와 성능을 비교한다. 짧은 길이의 부호이므로, ML(Maximum Likelihood)방법과 BP(Belief propagation)의 두 가지 복호 방법들을 이용한 경우 성능의 차이 또한 비교해 본다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.7
• /
• pp.1234-1243
• /
• 1994

We propose an adaptive decoding scheme for a concatenated codes with frequency-hopped spread-spectrum communication system in the presence of a pulse-burst jammer and its performance is analyzed. Concatenated coding system employing binary inner code and Reed-Solomon outer code is investigated and the use of side information is allowed to decode both erasures and errors. Our scheme makes the decoder adapts to the level of jamming by switching between two decoding modes such that the overall block error probability can be reduced. It is shown that the proposed decoding scheme yields a significant performance improvement over a conventional decoding scheme.