• Title/Summary/Keyword: error correcting code

Search Result 178, Processing Time 0.031 seconds

Effective Decoding Algorithm of Three dimensional Product Code Decoding Scheme with Single Parity Check Code (Single Parity Check 부호를 적용한 3차원 Turbo Product 부호의 효율적인 복호 알고리즘)

  • Ha, Sang-chul;Ahn, Byung-kyu;Oh, Ji-myung;Kim, Do-kyoung;Heo, Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.41 no.9
    • /
    • pp.1095-1102
    • /
    • 2016
  • In this paper, we propose a decoding scheme that can apply to a three dimensional turbo product code(TPC) with a single parity check code(SPC). In general, SPC is used an axis with shortest code length in order to maximize a code rate of the TPC. However, SPC does not have any error correcting capability, therefore, the error correcting capability of the three-dimensional TPC results in little improvement in comparison with the two-dimensional TPC. We propose two schemes to improve performance of three dimensional TPC decoder. One is $min^*$-sum algorithm that has advantages for low complexity implementation compared to Chase-Pyndiah algorithm. The other is a modified serial iterative decoding scheme for high performance. In addition, the simulation results for the proposed scheme are shown and compared with the conventional scheme. Finally, we introduce some practical considerations for hardware implementation.

리드-솔로몬과 Convolutional 코드에 의한 Concatenatec 코딩시스템

  • 한원섭;강창언
    • Proceedings of the Korean Institute of Communication Sciences Conference
    • /
    • 1986.10a
    • /
    • pp.79-82
    • /
    • 1986
  • For the purpose of error correcting, a concatenated coding system has been proposed by cascading two codes-(7, 3) Reed-Solomon and (2, 1, 6) convolutional codes. As a result of the result of the computer simulation and the experiment, the (98.21) concatenated code has been show to be able to correct 12 randome error and 16 bust errors. When the channel error is about 1.2x10, this system indicats most efficient.

  • PDF

부호이론의 개념 순회부호편

  • 이만영
    • The Magazine of the IEIE
    • /
    • v.11 no.2
    • /
    • pp.1-11
    • /
    • 1984
  • 본 지 2월호에서 구술한 선형부호에 이어 이번호에서는 순회부호에 대해 기술하고자 한다. 선형블럭부호중 중요한 부류에 속하는 순회부호(cyclic code)는 그 내용이 대수적 구조를 갖고 있어 부호화 회로는 물론 부호에 필요한 오증(syndrome)계산회로 등 귀환연결이 있는 치환레지스터(shift register)를 사용한 장치화(implementation)가 매우 용이하다는 이점이 있다. 이런 순회부호는 산발오진(random error)뿐 아니라 연집오진(burst error)도 정정할 수 있는 매우 효과적인 부호로서 다중오진정정능력(multiple error correcting capability)을 갖는 BCH부호도 순회부호의 일종이다.

  • PDF

Performance Comparison of Concatenated Codes with Different Inner Decoding Schemes in Frequency-Hopping Spread Spectrum Multiple-Access Channels (주파수 도약 대역확산 다중접속 채널에서 내 부호 복호화 기법에 따른 쇄상부호의 성능 비교)

  • Lee, Ye Hoon
    • Journal of Satellite, Information and Communications
    • /
    • v.9 no.2
    • /
    • pp.114-118
    • /
    • 2014
  • In this paper, we analyze the performance of a concatenated code with two different inner decoding schemes. One is the error-detecting inner decoding, and the other is the error-detecting-and-correcting inner decoding scheme. We compare the performances of the two decoding schemes for finite and infinite block length cases when the concatenated code is applied to slow frequency-hopping spread-spectrum multiple access (FH-SSMA) communication systems.

Decoder Design of a Nonbinary Code in the System with a High Code Rate (코드 레이트가 높은 시스템에 있어서의 비이진코드의 디코더 설계)

  • 정일석;강창언
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.11 no.1
    • /
    • pp.53-63
    • /
    • 1986
  • In this paper the decoder of nonbinary code satisfying R>1/t has been designed and constructed, where R is the code rate and t is the error correcting capability. In order to design the error trapping decoder, the concept of covering monomial is used and them the decoder system using the (15, 11) Reed-Solomon code is implemented. Without Galois Fiedl multiplication and division circuits, the decoder system is simply constructed. In the decoding process, it takes 60clocks to decode one code word. Two symbol errors and eight binary burst errors are simultaneously corrected. This coding system is shown to be efficient when the channel error probability is approximately from $5{\times}10^-4$~$5{\times}10^-5$.

  • PDF

Performance Analysis of FEC for Low Power Wireless Sensor Networks (저전력 무선 센서 네트워크를 위한 FEC 성능 분석)

  • Lee, Min-Goo;Park, Yong-Guk;Jung, Kyung-Kwon;Yoo, Jun-Jae;Sung, Ha-Gyeong
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2010.05a
    • /
    • pp.882-885
    • /
    • 2010
  • In view of the severe energy constraint in sensor networks, it is important to use the error control scheme of the energy efficiently. In this paper, we presented FEC (Forward Error Correcting) codes in terms of their power consumption. One method of FEC is RS (Reed-Solomon) coding, which uses block codes. RS codes work by adding extra redundancy to the data. The encoded data can be stored or transmitted. It could have errors introduced, when the encoded data is recovered. The added redundancy allows a decoder to detect which parts of the received data is corrupted, and corrects them. The number of errors which are able to be corrected by RS code can determine by added redundancy. We could predict the lifetime of RS codes which transmitted at 32 byte a 1 minutes. RS(15, 13), RS(31, 27), RS(63, 57), RS(127,115), and RS(255,239) can keep the days of 138, 132, 126, 111, and 103 respectively.

  • PDF

A NEW UPPER BOUND FOR SINGLE ERROR-CORRECTING CODES

  • Kim, Jun-Kyo
    • 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$.

  • PDF

부호 기반 McEliece 암호 체계와 안전성 분석

  • Lee, Hyang-Suk;Im, Su-Min;Im, Hui-Jin
    • Information and Communications Magazine
    • /
    • v.32 no.6
    • /
    • pp.23-29
    • /
    • 2015
  • 오류 정정 부호(error-correcting code)를 사용하는 McEliece 암호 체계는 양자 컴퓨터에서도 안전한 공개키 암호기법으로서 주목 받아왔다. 본고에서는 McEliece 암호 체계에 사용되는 오류 정정 부호와 그 조건, 암호 체계의 구조와 그 발전 과정 및 응용을 알아보고, 안전성 분석에 대해 소개한다.

Error Resilient and Concealment Schemes for Still Image Transmission over DSRC System Channel (DSRC시스템 채널 환경에서 정지 영상 전송을 위한 에러 복구 및 은닉 기법)

  • 최은석;백중환
    • Proceedings of the IEEK Conference
    • /
    • 2001.06d
    • /
    • pp.13-16
    • /
    • 2001
  • In the Dedicated Short Range Communication (DSRC) system channel, a large number of bit errors occur because of Additive White Gaussian Noise (AWGN) and fading. When an image data is transmitted under the condition, reconstructed image quality is significantly degraded. In this paper, as an alternative to the error correcting code and/or automatic repeat request scheme, we propose an error recovery scheme for image data transmission. We first analyze how transmission errors in the DSRC system channel degrade image quality. Then, in order to improve image quality, we propose error resilient and concealment schemes for still image transmission using DCT-based fixed length coding, hamming code, cyclic redundancy check, and interleaver. Finally, we show its performance by an experiment.

  • PDF

Analysis on the transition characteristics of extrinsic information according to iterative decoding of turbo code (터보부호의 반복복호에 따른 부가정보 변화 특성 분석)

  • Kang Se Hoon;Kim Woo Tae;Kim Jeong Goo;Joo Eon Kyeong
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.59-62
    • /
    • 2004
  • The performance of turbo code is improved by updating extrinsic information. The bit patterns are categorized by the transition characteristics of extrinsic information in this paper. And the distribution of these patterns is surveyed according to signal-to-noise ratio. Based on the results, the dominant error pattern is determined at high signal-to-noise ratio range. Thus, it is expected to improve the error performance in the error floor region by correcting the dominant error pattern which is found in this paper.

  • PDF