• Title/Summary/Keyword: burst errors

Search Result 93, Processing Time 0.022 seconds

Performance Evaluation of LDPC-LDPC Product Code for next Magnetic Recording Channel (차세대 자기기록 채널을 위한 LDPC-LDPC 곱 부호의 성능 평가)

  • Park, Donghyuk;Lee, Jaejin
    • 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.

BURST-ERROR-CORRECTING BLOCK CODE USING FIBONACCI CODE

  • Lee, Gwang-Yeon;Choi, Dug-Hwan;Kim, Jin-Soo
    • Journal of the Chungcheong Mathematical Society
    • /
    • v.22 no.3
    • /
    • pp.367-374
    • /
    • 2009
  • The errors take place in the communication channel but they are often burst-error types. From properties of the Fi-bonacci code, it is not difficult to detect the burst-errors accompanying with this code. Fibonacci codes for correcting the double-burst-error patterns are presented. Given the channel length with the double-burst-error type, Fibonacci code correcting these errors is constructed by a simple formula.

  • PDF

SIMULTANEOUS RANDOM ERROR CORRECTION AND BURST ERROR DETECTION IN LEE WEIGHT CODES

  • Jain, Sapna
    • Honam Mathematical Journal
    • /
    • v.30 no.1
    • /
    • pp.33-45
    • /
    • 2008
  • Lee weight is more appropriate for some practical situations than Hamming weight as it takes into account magnitude of each digit of the word. In this paper, we obtain a sufficient condition over the number of parity check digits for codes correcting random errors and simultaneously detecting burst errors with Lee weight consideration.

Efficient Interleaving Schemes of Volume Holographic memory

  • Lee, Byoung-Ho;Han, Seung-Hoon;Kim, Min-Seung;Yang, Byung-Choon
    • Journal of the Optical Society of Korea
    • /
    • v.6 no.4
    • /
    • pp.172-179
    • /
    • 2002
  • Like the conventional digital storage systems, volume holographic memory can be deteriorated by burst errors due to its high-density storage characteristics. These burst errors are used byoptical defects such as scratches, dust particles, etc. and are two-dimensional in a data page. To deal with these errors, we introduce some concepts for describing them and propose efficient two- dimensional interleaving schemes. The schemes are two-dimensional lattices of an error-correction code word and have equilateral triangular and square structures. Using these structures, we can minimize the number of code words that are interleaved and improve the efficiency of the system. For large size burst errors, the efficient interleaving structure is an equilateral triangular lattice. However, for some small size burst errors, it is reduced to a square lattice.

REPEATED LOW-DENSITY BURST ERROR DETECTING CODES

  • Dass, Bal Kishan;Verma, Rashmi
    • Journal of the Korean Mathematical Society
    • /
    • v.48 no.3
    • /
    • pp.475-486
    • /
    • 2011
  • The paper deals with repeated low-density burst error detecting codes with a specied weight or less. Linear codes capable of detecting such errors have been studied. Further codes capable of correcting and simultaneously detecting such errors have also been dealt with. The paper obtains lower and upper bounds on the number of parity-check digits required for such codes. An example of such a code has also been provided.

AN UPPER BOUND ON THE NUMBER OF PARITY CHECKS FOR BURST ERROR DETECTION AND CORRECTION IN EUCLIDEAN CODES

  • Jain, Sapna;Lee, Ki-Suk
    • Journal of the Korean Mathematical Society
    • /
    • v.46 no.5
    • /
    • pp.967-977
    • /
    • 2009
  • There are three standard weight functions on a linear code viz. Hamming weight, Lee weight, and Euclidean weight. Euclidean weight function is useful in connection with the lattice constructions [2] where the minimum norm of vectors in the lattice is related to the minimum Euclidean weight of the code. In this paper, we obtain an upper bound over the number of parity check digits for Euclidean weight codes detecting and correcting burst errors.

CLR Performance of CBR Traffic in Wireless ATM Access Network (무선 ATM접속망에서 CBR 트래픽의 셀 손실율 분석 및 개선방안)

  • 김영일;이하철;이병섭;류근호
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.6B
    • /
    • pp.1088-1097
    • /
    • 1999
  • In this paper we describe our investigation en ATM CLR(Cell Loss Rate) in the wireless ATM Networks, which consist of wireless access nodes and wireless links. A wireless access node is modelled as the ND/D/1queue. A wireless channel is modelled as channel with single and burst error characteristics, and it can be seen that the CLR degrades on a link with burst errors than on a link with single error. Because wireless channel can be approximated as the Rayleigh or Rician fading channel and wireless communication systems are power limited, it is customary that the CLR degrades on a link with burst errors than on a link with single error. So error control method should be used to improve performance degradation caused by burst errors. We consider the forward error correction(FEC) as error control scheme for CBR traffics to improve performance degradation caused by burst errors, and analyze performance of concatenated FEC scheme through the use of CLR.

  • PDF

Design of A Cascaded Cyclic Product Coding system (Cascade 방식을 이용한 순환곱셈코드의 시스템 설계)

  • 김신령;강창언
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.22 no.5
    • /
    • pp.24-28
    • /
    • 1985
  • In this paper, the cyclic product codes which are capable of correcting random erros and burst errors simultaneously have been designed and constructed. First, the procedure for product of two cyclic codes is shown and thin the encoder and decoder system using the (7,4) cyclic Hamming code and the (3,1) cyclic code is implemented. The micro-computer is used for experiment and the system consists of encoder, decoder and interface circuits. The encoder of cyclic product code is implemented by interlacing encoders while the decoder is implemented by cascading decoders that interlace error trapping decoders. In conclusion, cyclic product codas are easily decodable and are capable of correcting four random errors and eight-burst errors. Better performance is obtained with low error rate.

  • PDF

Feedback Burst Loss Ratio Control for Link Performance Improvement in Optical Bur st Switching Networks

  • Linh, To Hoang;Yoon, Gwi-Ok;Nam, Jae-Hyun;Solongo, Ganbold;Hwang, Won-Joo
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.9
    • /
    • pp.1067-1076
    • /
    • 2013
  • Known as an important criterion that evaluates performance of future high-speed backbone networks, burst data loss ratio is well-studied in Optical Burst Switching networks. Current literatures mostly focus on reduce burst loss ratio without considering the system stability and link utilization after reducing. In this paper, we propose a novel framework which comes from feedback theoretic to dynamically control burst loss ratio in OBS. The proposed scheme tries to track the pre-set values of burst loss ratio and increases the stability and link utilization degree. The simulation results show that measured burst loss ratio always tracks setup reference with small errors, wavelength channel utilization is increased up to 2% and the system stability is also improved.

Measurement Technique for Sea Height of Burst Using Image Recognition

  • Park, Ju-Ho;Hong, Sung-Soo;Kang, Kyu-Chang;Joon Lyou
    • Transactions on Control, Automation and Systems Engineering
    • /
    • v.2 no.1
    • /
    • pp.76-83
    • /
    • 2000
  • A measurement technique of a sea height of burst is introduced for a proximate test using the image recognition of video cameras. In the burst of fuse on the ocean, the burst center of fuse, the sea surface level and the height of calibration poles are measured by the process of image obtained from cameras. Finally, the height of burst of fuse can be computed by Hough transform algorithm. The error compensation algorithms are proposed to eliminate the errors caused by camera level and environmental parameters. As a result of experiment, it has been proved that the proposed measurement system shows the recognition of the center point of the burst image with ${\pm}$0.5m error.

  • PDF