• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.4 no.6
• /
• pp.1116-1132
• /
• 2010

In this paper, a new forward error correction (FEC) protocol is proposed for point-to-multipoint satellite links. Link-layer error control protocols in point-to-multipoint satellite links impose several problems such as unreliability and receiver-heterogeneity. To resolve the problem of heterogeneous error rates at different receivers, the proposed scheme exploits multiple multicast channels to which each receiver tunes. The more channels a receiver tunes to, the more powerful error correcting capability it achieves. Based on its own channel condition, each receiver tunes to as many channels as it needs, which prevents from receiving unwanted parities. Furthermore, each receiver saves the decoding time, processing overhead, and processing energy. Performance evaluation shows that the proposed scheme guarantees the target PER while saving energy. The proposed technique is highly adaptive to the channel variation with respect to the throughput efficiency, and provides scalable PER and throughput efficiency.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.11
• /
• pp.21-28
• /
• 1993

Decoding algorithm of noncyclic Reed-Solomon codes consists of four steps which are to compute syndromes, to find error-location polynomial, to decide error-location, and to solve error-values. There is a decoding method by which the computation of both error-location polynomial and error-evaluator polynimial can be avoided in conventional decoding methods using Euclid algorithm. The disadvantage of this method is that the same amount of computation is needed that is equivalent to solve the avoided polynomial. This paper considers the division method on polynomial on GF(2$^{m}$) systematically. And proposes a novel method to find error correcting polynomial by simple mathematical expression without the same amount of computation to find the two avoided polynomial. Especially. proposes the method which the amount of computation to find F (x) from the division M(x) by x, (x-1),....(x--${\alpha}^{n-2}$) respectively can be avoided. By applying the simple expression to decoding procedure on RS codes, propses a new decoding algorithm, and to show the validity of presented method, computer simulation is performed.

• Bulletin of the Korean Mathematical Society
• /
• v.38 no.4
• /
• pp.797-801
• /
• 2001

The purpose of this paper is to give an upper bound for A[n,4], the maximum number of codewords in a binary code of word length n with minimum distance 4 between codewords. We have improved upper bound for A[12k+11,4]. In this correspondence we prove $A[23,4]\leq173716$.

• Information and Communications Magazine
• /
• v.32 no.6
• /
• pp.23-29
• /
• 2015

오류 정정 부호(error-correcting code)를 사용하는 McEliece 암호 체계는 양자 컴퓨터에서도 안전한 공개키 암호기법으로서 주목 받아왔다. 본고에서는 McEliece 암호 체계에 사용되는 오류 정정 부호와 그 조건, 암호 체계의 구조와 그 발전 과정 및 응용을 알아보고, 안전성 분석에 대해 소개한다.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.11
• /
• pp.3-8
• /
• 2012

Two-dimensional product code has been studied for correcting burst errors on the storage systems. An RS-LDPC product code consists of an RS code in horizontal direction and an LDPC code in vertical direction. First, we detect the position of burst errors by using RS code, then LDPC code corrects the errors by using the burst error positions. In storage system, long burst errors are occurred by various reason. So, we need a strong code for correcting the long burst errors. RS-LDPC product code is good for long burst errors. However, as the storage density grows the length of the burst errors will be longer. Thus, we propose an LDPC-LDPC product code, it is strong for correcting the very long burst errors. Also, the proposed LDPC-LDPC product code performs better than RS-LDPC product code when the random errors are occurred, because a row direction LDPC code performs better than row direction RS code.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.11
• /
• pp.1101-1105
• /
• 2011

Radiation particles can introduce temporary errors in memory systems. To protect against these errors, so-called soft errors, error detection and correcting codes are used. In addition, scrubbing is applied which is a fundamental technique to avoid the accumulation of soft errors. This paper introduces an optimal scrubbing scheme, which is suitable for a system with auto error detection and correction logic. An auto error detection and correction logic can correct soft errors without CPU's writing operation. The proposed scrubbing scheme leads to maximum reliability by considering both allowable scrubbing load and the periodic accesses to memory by the tasks running in the system.

• Bulletin of the Korean Mathematical Society
• /
• v.52 no.3
• /
• pp.809-823
• /
• 2015

This paper is devoted to presenting a MacWilliams type identity for m-spotty RT weight enumerators of byte error control codes over finite commutative Frobenius rings, which can be used to determine the error-detecting and error-correcting capabilities of a code. This provides the relation between the m-spotty RT weight enumerator of the code and that of the dual code. We conclude the paper by giving three illustrations of the results.

• Transactions of Materials Processing
• /
• v.16 no.1 s.91
• /
• pp.15-19
• /
• 2007

This paper presents an integrated machining error compensation method based on captured images of tool deflection shapes in flat end-milling processes. This approach allows us to avoid modeling machining characteristics (cutting forces, tool deflections and machining errors etc.) and accumulating calculation errors induced by several simulations. For this, a high-speed camera captured images of real deformed tool shapes which were cutting under given machining conditions. Using image processes and a machining error model, it is possible to estimate tool deflection in cutting conditions modeled and to compensate for machining errors using an iterative algorithm correcting tool paths. This corrected tool path can effectively reduce machining errors in the flat end-milling process. Experiments are carried out to validate the approaches proposed in this paper. The proposed error compensation method can be effectively implemented in a real machining situation, producing much smaller errors.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37C no.11
• /
• pp.1054-1063
• /
• 2012

In this paper, we introduce basic theories, effects and applications of the unequal error protection (UEP) system that is expected to play a major role in the future multi-layered broadcast system. Also we show results of surveys on the various previous studies and standards about the UEP systems, and we give prospects of standardizations and future applications of UEP based on the surveys.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.25 no.2
• /
• pp.204-210
• /
• 1988

The residue number system offers the possibility of high-speed operation and error detection/correction because of the separability of arithmetic operations on each digit. A compact residue arithmetic module named the self-checking pulse-train residue arithmetic circuit is effectively employed as the basic module, and an efficient error detection/correction algorithm in which error detection is performed in each basic module and error correction is performed based on the parallelism of residue arithmetic is also employed. In this case, the error correcting circuit is imposed in series to non-redundant system. This design method has an advantage of compact hardware. Following the proposed method, a 2nd-order recursive fault-tolerant digital filter is practically implemented, and its fault-tolerant ability is proved by noise injection testing.