• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.7
• /
• pp.1477-1486
• /
• 1997

Conventioally the decoding methods and the design of coset codes for burst synchronization and error detection have been based on the concept that slips occuring to the right or to the left with respect to a reference timing are corrected. In this paper we newly approach to the design of coset codes relying on the condition that only a single code word can exists in an observation interval, which provides an extentended view on the conventional approach. A theorem concerning the condition is presented. A combined burst synchronization and error detection system with maximum slip correction capability have been devised based on the theorem and a detection method is falsely accepted in the presented of channel errors. The false acceptance probabilities of the system are derived and its performance is analyzed through computer computation using the derived results.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3163-3165
• /
• 2000

In code division multiple access systems using all-optical signal processing, the optical multiple access interference by simultaneous multiple users degrades the system performance and eventually can limit the number of active users. To reduce the effect of the interference, error-correction codes are used in 2-dimensional FO-CDMA systems. In this paper we propose a method of applying product code to 2-dimensional FO-CDMA systems. The proposed coding scheme can correct a random error and burst errors with small redundancy to the conventional case. In result we show significant performance enhancement of the system in terms of HER, the number of active users.

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

• Journal of the Korean Institute of Intelligent Systems
• /
• v.18 no.5
• /
• pp.611-616
• /
• 2008

Error correcting codes (ECCs) are commonly used to protect against the soft errors. Single error correcting and double error detecting (SEC-DED) codes are generally used for this purpose. The proposed approach in this paper selectively reduced power consumption, delay, and area in single-error correcting, double error-detecting checker circuits that perform memory error correction. The multi-objective genetic algorithm is employed to solve the non -linear optimization problem. The proposed method allows that user can choose one of different non-dominated solutions depending on which consideration is important among them. Because we use multi-objective genetic algorithm, we can find various dominated solutions. Therefore, we can choose the ECC according to the important factor of the power, delay and area. The method is applied to odd-column weight Hsiao code which is well- known ECC code and experiments were performed to show the performance of the proposed method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10C
• /
• pp.950-958
• /
• 2007

This paper presents an efficient packet loss resilient scheme for real-time video transmission over the Internet. By analyzing the temporal and spatial dependencies in inter- and intra-frames, we assign forward error correction codes (FEC) across video packets for minimizing the effect of error concealment and error propagation from packet loss. To achieve optimal allocation of FEC codes, we formulate the effect of packet loss on video quality degradation as packet distortion model. Then we propose an unequal FEC assignment scheme with low complexity based on packet correction rate, which uses the packet distortion model and includes channel status information. Simulation results show that the proposed FEC assignment scheme gives substantial improvement for the received video quality in packet lossy networks. Furthermore the proposed scheme achieves relatively smaller degradation of video quality with higher packet loss rates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.10C
• /
• pp.605-613
• /
• 2011

In most digital communication systems over the noisy channel, some form of forward error correction scheme is employed for reliable communications. If one wants to recover the transmitted message without any knowledge of the error correcting codes employed, it is of utmost importance to figure out and reconstruct the error correcting codes. In this paper, we propose two algorithms of reconstructing linear cyclic codes from the corrupted received bit sequence, one for general linear binary cyclic codes and the other for Reed-Solomon codes. For two algorithms, we ran computer simulations and the performances are shown to be superior to those with the conventional LWM method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.16 no.1
• /
• pp.13-22
• /
• 1991

In this paper we designed 2 bit ECC(Error Checking and Correction) circuit using Single Layer Perceptron type neural networks. We used (11, 6) block codes having 6 data bits and 8 check bits with appling cyclic hamming codes. All of the circuits are layouted by CMOs 2um double metal design rules. In the result of circuit simulation, 2 bit ECC circuit operates at 67MHz of input frequency.

• Convergence Security Journal
• /
• v.7 no.2
• /
• pp.129-134
• /
• 2007

This paper proposes multiple burst error detection and correction scheme for transmission of Huffman coded string. We use bidirectionally decodable codes and introduce insertion of forbidden symbol to find errors. Additional bits are added to original bit streams to correct errors. The total file size id increased but it can detect errors and recover errors real time.

• Information and Communications Magazine
• /
• v.32 no.6
• /
• pp.39-49
• /
• 2015

In cryptographic applications, the key protection is either knowledge-based (passwords) or possession-based (tamper-proof device). Unfortunately, both approaches are easily forgotten or stolen, thus introducing various key management issues. By incorporating biometrics technologies which utilize the uniqueness of personal characteristics, the security of cryptosystems could be strengthened as authentication now requires the presence of the user. Biometric Cryptosystem (BC) encompasses the design of cryptographic keys protection methods by incorporating biometrics. BC involves either key-biometrics binding or direct key generation from biometrics. However, the wide acceptance and deployment of BC solutions are constrained by the fuzziness related with biometric data. Hence, error correction codes (ECCs) should be adopted to ensure that fuzziness of biometric data can be alleviated. In this overview paper, we present such ECC solutions used in various BCs. We also delineate on the important facts to be considered when choosing appropriate ECCs for a particular biometric based solution from accuracy performance and security perspectives.

• Journal of IKEEE
• /
• v.22 no.4
• /
• pp.1168-1174
• /
• 2018

For the initial state of NAND flash memories, error-free and single-error cases are dominant due to a good channel environment on memory cells. It is important to deal with such cases, which affects the overall system performance. However, the conventional schemes for polar codes equally decode the codes even for the error-free and single-error cases since they cannot classify and decode separately. In this paper, a new pre-processing scheme for polar codes is proposed so as to improve the overall decoding latency by decoding the frequent error-free and single-error cases. Before the ordinary decoding process, the proposed scheme first decodes the frequent error-free and single-error cases. According to the experimental results, the proposed pre-processing scheme decreases the average decoding latency by 64% compared to the conventional scheme for (1024, 512) polar codes.