• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 1983.10a
• /
• pp.73-76
• /
• 1983

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.2
• /
• pp.835-839
• /
• 2013

In this paper, We operate at a relatively low BER or using forward error control coding techniques on ways to increase the capacity of optical communication systems research. Coding gain is defined as the ratio of the probability of the coded signal and coding of error signal. Coding gain is increased, partly because of the period, to reduce the value of the optimal coding of the signal error probability decreases because of the effective bit binary symbol duration is longer than can be ignored. Transmission capacity on the coding gain for various code rates, which show the extent of up to 75Gb/s transmission capacity to get through it was confirmed that these coding techniques.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.3
• /
• pp.16-33
• /
• 1993

New decoding algorithm of double-error-correction Reed-Solmon codes over GF(2$^{8}$) for optical compact disks is proposed and decoding algorithm of RS codes with triple-error-correcting capability is presented in this paper. First of all. efficient algorithms for estimating the number of errors in the received code words are presented. The most complex circuits in the RS decoder are parts for soving the error-location numbers from error-location polynomial, so the complexity of those circuits has a great influence on overall decoder complexity. One of the most known algorithm for searching the error-location number is Chien's method, in which all the elements of GF(2$^{m}$) are substituted into the error-location polynomial and the error-location number can be found as the elements satisfying the error-location polynomial. But Chien's scheme needs another 1 frame delay in the decoder, which reduces decoding speed as well as require more stroage circuits for the received ocode symbols. The ther is Polkinghorn method, in which the roots can be resolved directly by solving the error-location polynomial. Bur this method needs additional ROM (readonly memory) for storing tthe roots of the all possible coefficients of error-location polynomial or much more complex cicuit. Simple, efficient, and high speed method for solving the error-location number and decoding algorithm of double-error correction RS codes which reudce considerably the complexity of decoder are proposed by using Hilbert theorems in this paper. And the performance of the proposed decoding algorithm is compared with that of conventional decoding algorithms. As a result of comparison, the proposed decoding algorithm is superior to the conventional decoding algorithm with respect to decoding delay and decoder complexity. And decoding algorithm of RS codes with triple-error-correcting capability is presented, which is suitable for error-correction in digital audio tape, also.

• Communications of the Korean Mathematical Society
• /
• v.20 no.2
• /
• pp.405-409
• /
• 2005

In [1], Sharma and Goel obtained a bound for random error correcting codes with Lee weight considerations. The purpose of this paper is to first point out a discrepancy in this result and then give a correct version of the same, improving upon the bound tremendously.

• Science of Emotion and Sensibility
• /
• v.4 no.2
• /
• pp.63-68
• /
• 2001

We purpose to evaluate the fatigue of the error correcting task on monitoring with color temperature 2700 K, 4000 K and 6500 K. Results of questionnaire on subjective feeling of visual fatigue, mental fatigue and concentration. Visual fatigue and mental fatigue level were the lowest, concentration level was the highest and working performance was the best at 2700 K. At 6500 K, mental fatigue level was the highest and concentration level is the lowest. At 4000 K, visual fatigue level was the highest and working performance shown the worst ratio of correcting answers. As results, color temperature 2700 K is the best condition of color temperature to perform the error correcting task on monitoring.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.11a
• /
• pp.11-14
• /
• 2018

The aim of this study is to rectify the misclassified image features and enhance the performance of image classification tasks by incorporating a channel- coding technique, widely used in telecommunication. Specifically, the proposed algorithm employs the error - correcting mechanism of convolutional coding combined with the convolutional neural networks (CNNs) that are the state - of- the- arts image classifier s. We develop an encoder and a decoder to employ the error - correcting capability of the convolutional coding. In the encoder, the label values of the image data are converted to convolutional codes that are used as target outputs of the CNN, and the network is trained to minimize the Euclidean distance between the target output codes and the actual output codes. In order to correct misclassified features, the outputs of the network are decoded through the trellis structure with Viterbi algorithm before determining the final prediction. This paper demonstrates that the proposed architecture advances the performance of the neural networks compared to the traditional one- hot encoding method.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.4
• /
• pp.150-158
• /
• 2018

In this paper, we introduce an electric vehicle charging system using power line communication and propose a method to correct the error by applying a deep learning algorithm when an error occurs in the control signal of an electric vehicle charging system using power line communication. The error detection and correction of the control signal can be solved through the conventional error correcting code schemes, but the error is detected and corrected more efficiently by using the deep learning based error correcting code scheme. Therefore, we introduce deep learning based error correction code scheme and apply this scheme to electric vehicle charging system using power line communication. we proceed simulation and confirm performance with bit error rate. we judge whether the deep learning based error correction code scheme is more effective than the conventional schemes.

• Proceedings of the KIEE Conference
• /
• 1988.07a
• /
• pp.198-202
• /
• 1988

In digital mobile communications received speech data are affected by burst errors as well as random errors. To overcome these errors we propose a bit-selective forward error correction scheme for the speech data which is sub-band coded at 13 kbps and transmitted over a 16 kbps channel. For a few error correcting codes the signal-to-noise ratio of error-corrected speech is obtained and compared through the simulation of mobile communication channels.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.1 no.1
• /
• pp.66-78
• /
• 1991

In this paper, this paper, the stream cipher systems and the error propagation are analyzed. During the ciphertext transmission. for the error control of errors occurred in the channel, the DSEC(31, 27) RS codes will be used for bothe internal and external error controls for the self-synchromizing cipher system with ciphertext feedback.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8A
• /
• pp.1238-1244
• /
• 1999

In this paper, a new design of a triple-erroe-correcting (TEC) Reed-Solomon decoder is presented based on direct decoding method which is more efficient for the case of relatively small error correction capability. The proposed decoder requires only 9 GF(2m) multipliers in obtaining the error-locator polynomial and the error-evaluator polynomial, whereas other decoders needs 24 multipliers. Thus, the attractive feature of this decoder is its remarkable simplicity from the point of view of implementation. Futhermore, the proposed TEC Reed-Solomon decoder has very simple control circuit and short decoding delay. Therefore this decoder can be implemented by simple hardware and also save buffer memory which stores received sequence.