• Title, Summary, Keyword: 에러 정정 부호

Search Result 63, Processing Time 0.045 seconds

Performance Evaluation of Adaptive Modulation System with Error Control Code Techniques (에러 정정 부호화 기법을 이용한 적응변조방식의 성능평가)

  • 장재환;강희조;최용석
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • /
    • pp.635-637
    • /
    • 2002
  • 본 논문에서는 차세대이동통신에서 고속·고품질 전송을 실현하기 위해, 전송환경에 맞게 최적의 변조 다치 수를 선택하는 적응변조방식에 에러 정정 부호기법을 제안하였다. 고속ㆍ고품질화의 한 방법으로서, 에러 정정 부호를 적응한 시스템을 생각할 수 있는데, 본 논문에서 방식은 변조 파라미터가 변화하는 것에 의해 적응변조방식에 효과적인 BCH 부호 기법 및 RS 부호 기법을 적용한 경우의 전송 품질을 검토하였다.

  • PDF

랜덤선형부호의 복호화 문제와 그의 암호학적 응용

  • Kim, Jin-Su;Cheon, Jeong-Hui
    • Information and Communications Magazine
    • /
    • v.32 no.6
    • /
    • pp.30-38
    • /
    • 2015
  • 오류정정부호는 정보를 부호화하여 데이터 전송 과정에서 발생하는 에러를 감소시킴으로써 통신 신뢰성을 향상시킨다. 이에 따라 에러를 효율적으로 검출 및 정정할 수 있는 부호(code)가 필수적이다. 반면 암호에서는 중요한 정보를 은닉하기 위한 목적으로 비밀정보에 인위적으로 오류를 주입한다. 따라서 기밀성을 유지하기 위해서는 위와는 반대로 오류정정이 어려운 부호를 필요로 한다. 본고에서는 오류정정의 어려움으로 메시지의 비밀성은 유지되고, 덧문(trapdoor)을 가지고 있어 비밀정보가 있을 때는 메시지가 복구되는 암호학적 응용이 가능한 랜덤선형부호의 복호화 문제와 그의 응용에 대해 살펴보고자 한다. 이 문제는 암호학에서 LPN/LWE 문제로 불리며, 최근 LPN문제의 일반화된 문제인 LWE문제가 Regev에 의해 소개되면서 동형암호, 기능암호 등에 광범위하게 응용되고 있다.

A Design of Viterbi Decoder by State Transition Double Detection Method for Mobile Communication (상태천이 이중검색방식의 이동통신용 Viterbi 디코더 설계)

  • 김용노;이상곤;정은택;류흥균
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.4
    • /
    • pp.712-720
    • /
    • 1994
  • In digital mobile communication systems, the convolutional coding is considered as the optimum error correcting scheme. Recently, the Viterbi algorithm is widely used for the decoding of convolutional code. Most Viterbi decoder has been proposed in conde rate R=1/2 or 2/3 with memory components (m) less than 3. which degrades the error correcting capability because of small code constraints (K). We consider the design method for typical code rate R=1/2, K=7(171,133) convolutional code with memory components, m=6. In this paper, a novel construction method is presented which combines maximum likelihood decoding with a state transition double detection and comparison method. And the designed circuit has the error-correcting capability of random 2 bit error. As the results of logic simulation, it is shown that the proposed Viterbi decoder exactly corrects 1 bit and 2 bit error signal.

  • PDF

A Modified BCH Code with Synchronization Capability (동기 능력을 보유한 변형된 BCH 부호)

  • Shim, Yong-Geol
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.109-114
    • /
    • 2004
  • A new code and its decoding scheme are proposed. With this code, we can correct and detect the errors in communication systems. To limit the runlength of data 0 and augment the minimum density of data 1, a (15, 7) BCH code is modified and an overall parity bit is added. The proposed code is a (16, 7) block code which has the bit clock signal regeneration capability and high error control capability. It is proved that the runlength of data 0 is less than or equal to 7, the density of data 1 is greater than or equal to 1/8, and the minimum Hamming distance is 6. The decoding error probability, the error detection probability and the correct decoding probability are presented for the proposed code. It is shown that the proposed code has better error control capability than the conventional schemes.

Efficient Decoding Algorithm of 5-error-correcting (255, 215) BCH Code And Its Simulation with VHDL (5중 오류정정 (255, 215) BCH 부호의 효율적인 복호 알고리즘과 이의 VHDL 시뮬레이션)

  • 강경식
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.7 no.1
    • /
    • pp.45-56
    • /
    • 1997
  • 본 논문에서는, 무선 통신시스템에 적용 가능한 (255,215) BCH부호의 효율적인 복호 알고리즘을 제안하고, 이를 이용하여 5중 에러 정정 부호기 및 복호기를 설계하였다. peterson의 복호기보다 곱셈기, X-or 게이트의 수가 현저히 줄어들었을 뿐만 아니라 역원계산기가 필요 없음이 입증되었고, VHDL을 사용한 컴퓨터 시뮬레이션을 통해서 그 타당성을 검증하였다.

  • PDF

Evaluation of the Error Correction Ability in the inner memory error for the Viterbi Decoder According to the Constraint Length (구속장 길이에 따른 Viterbi Decoder의 내부 메모리 오류에 대한 정정능력 평가)

  • Kim, Ho-Jun;Kim, Min-Su;Kim, Jong-Tae
    • Proceedings of the KIEE Conference
    • /
    • /
    • pp.1939-1940
    • /
    • 2008
  • 1967년 Andrew J. Viterbi에 의해 처음 제안된 Viterbi 알고리즘은 길쌈부호(convolution code)의 대표적인 복호방법으로 현재 통신 기술 중에서 가장 많이 쓰이는 것 중에 하나이다. Viterbi decoder는 사용되는 시스템의 사양에 따라 에러 수정 능력이 다른데 통신 channel 상의 오류뿐만 아니라 Viterbi decoder내부에 있는 메모리에서 발생하는 오류도 Viterbi decoder의 에러 수정 능력에 영향을 준다. 본 논문에서는 일반적으로 많이 확인되었던 channel상의 오류와 함께 Viterbi decoder내부에 있는 메모리에서 오류가 발생했을 때 복.부호기의 사양에 따른 에러정정능력을 분석하였다.

  • PDF

Hybrid ARQ scheme using RCPC codes in Wireless (무선 ATM 환경에서 RCPC 코드를 이용한 하이브리드 ARQ 기법)

  • Han, Eun-Jung;Cho, Young-Jong
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.39 no.7
    • /
    • pp.12-21
    • /
    • 2002
  • In this paper, we propose a new hybrid ARQ scheme to consider real-time and non real-time services in a wireless ATM network. Real-time and non-real-time services require different error control schemes according to each service characteristics. Therefore, in the next generation mobile communication environments where these service scenarios should be deployed, hybrid ARQ scheme using RCPC code with variable coding rate becomes one of the most suitable solutions. Because the variable coding rate is applied according to traits of transmitted frame and channel status, hybrid ARQ scheme using RCPC code can expect UEP effect. The UEP scheme does not apply equal error protection level to all information, but does high error protection level to more important information. In Our scheme, UEP of high error protection level is applied to real-time service, and UEP of low error protection and retransmission techniques are applied to non real-time service. We show that the proposed hybrid ARQ scheme improves channel utilization efficiency and yields high error correction behaviors.

An Iterative Soft-Decision Decoding Algorithm of Block Codes Using Reliability Values (신뢰도 값을 이용한 블록 부호의 반복적 연판정 복호 알고리즘)

  • Shim, Yong-Geol
    • The KIPS Transactions:PartC
    • /
    • v.11C no.1
    • /
    • pp.75-80
    • /
    • 2004
  • An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23,12) Golay code. They show that decoding complexity is considerably reduced and the block error probability is lowered.

Design of RCNC(Random Connection Node Convolutional) Code with Security Property (비화 특성을 가진 RCNC(Random Connection Node Convolutional) 부호 기법의 설계)

  • Kong, Hyung-Yun;Cho, Sang-Bock;Lee, Chang-Hee
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.12
    • /
    • pp.3944-3951
    • /
    • 2000
  • In this paper, we propose the new FEC(Forward Error Correction) code method, so called RCNC(Random Connection Node Convolutional) code with security property. Recently, many wireless communication systems, which can prouide integrated semices of various media types and hil rales, are required to haue the ability of secreting information and error correclion. This code system is a kind qf conuolulional code, but it Ius various code formats as each node is connected differently. And systems hy using RCNC codes haue all. ability of error correction as well as information protection. We describe the principle of operating RCNC codes, including operation examples. In this paper, we also show the peiformance of BER(Bit Error Rate) and verify authority of network system with computer simulation.

  • PDF

An Error Correcting High Rate DC-Free Multimode Code Design for Optical Storage Systems (광기록 시스템을 위한 오류 정정 능력과 높은 부호율을 가지는 DC-free 다중모드 부호 설계)

  • Lee, June;Woo, Choong-Chae
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.11 no.3
    • /
    • pp.226-231
    • /
    • 2010
  • This paper proposes a new coding technique for constructing error correcting high rate DC-free multimode code using a generator matrix generated from a sparse parity-check matrix. The scheme exploits high rate generator matrixes for producing distinct candidate codewords. The decoding complexity depends on whether the syndrome of the received codeword is zero or not. If the syndrome is zero, the decoding is simply performed by expurgating the redundant bits of the received codeword. Otherwise, the decoding is performed by a sum-product algorithm. The performance of the proposed scheme can achieve a reasonable DC-suppression and a low bit error rate.