• Title/Summary/Keyword: Error Correcting Code

Search Result 179, Processing Time 0.021 seconds

A Study on an Embedded DPCM with Convolutional Coding (길쌈부호를 사용한 Embedded DPCM 방식에 관한 연구)

  • 임종수;이상곤;문상재
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.28A no.1
    • /
    • pp.1-7
    • /
    • 1991
  • Degradation of communication quality is due to transmission error rather than quantization noise when DPCM signal is transmitted over a heavily noise channel. The communication quality can be improved by employing an error correcting code to the DPCM signal transmission over such a channel. We considered both quantization noise and transmission error simultaneously in evaluating the signal to noise ratio. To efficiently improve the signal to noise ratio, we analyze the unequal symbol error probability of convolutional code, and encoded to more protect significant symbols from channel errors than least ones, so that the signal to noise ratio is improved. We derived related formulas and also made computer simulations.

  • PDF

DIRECTED STRONGLY REGULAR GRAPHS AND THEIR CODES

  • Alahmadi, Adel;Alkenani, Ahmad;Kim, Jon-Lark;Shi, Minjia;Sole, Patrick
    • Bulletin of the Korean Mathematical Society
    • /
    • v.54 no.2
    • /
    • pp.497-505
    • /
    • 2017
  • The rank over a finite field of the adjacency matrix of a directed strongly regular graph is studied, with some applications to the construction of linear codes. Three techniques are used: code orthogonality, adjacency matrix determinant, and adjacency matrix spectrum.

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.

Parallel LDPC Decoding on a Heterogeneous Platform using OpenCL

  • Hong, Jung-Hyun;Park, Joo-Yul;Chung, Ki-Seok
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.6
    • /
    • pp.2648-2668
    • /
    • 2016
  • Modern mobile devices are equipped with various accelerated processing units to handle computationally intensive applications; therefore, Open Computing Language (OpenCL) has been proposed to fully take advantage of the computational power in heterogeneous systems. This article introduces a parallel software decoder of Low Density Parity Check (LDPC) codes on an embedded heterogeneous platform using an OpenCL framework. The LDPC code is one of the most popular and strongest error correcting codes for mobile communication systems. Each step of LDPC decoding has different parallelization characteristics. In the proposed LDPC decoder, steps suitable for task-level parallelization are executed on the multi-core central processing unit (CPU), and steps suitable for data-level parallelization are processed by the graphics processing unit (GPU). To improve the performance of OpenCL kernels for LDPC decoding operations, explicit thread scheduling, vectorization, and effective data transfer techniques are applied. The proposed LDPC decoder achieves high performance and high power efficiency by using heterogeneous multi-core processors on a unified computing framework.

Performance Analysis of Cooperative Network Error Correcting Scheme Using Distributed Turbo Code and Power Allocation (양방향 중계 채널에서 네트워크 코딩을 이용한 분산 터보 부호 기법과 전력 할당의 성능 분석)

  • Lim, Jin-Soo;Ok, Jun-Ho;Yoo, Chul-Hae;Shin, Dong-Joon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.2C
    • /
    • pp.57-64
    • /
    • 2011
  • A two-way relay channel is a bidirectional cooperative communication channel between two nodes using a relay. In many cooperative communication schemes, a relay transmits its data to each node using separate channels. However, in the two-way relay channel, a relay can broadcast the network-coded signal to both nodes in a same time slot, which can increase the system throughput. In this paper, a new cooperative network error correcting scheme using distributed turbo code in a two-way relay channel is proposed. The proposed scheme not only increases the system throughput using network code but also improves the performance by utilizing the LLR information from relay node and other user node through distributed turbo code. Also, a power allocation scheme is investigated for various channel conditions to improve the system performance.

A Study on the Optical Communication Channel using Forward Error Correcting Technique (순방향 에러 교정 기법을 이용한 광통신 채널에 관한 연구)

  • Kang, Young-Jin;Kim, Sun-Yeob
    • 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.

A Continuous Versatile Reed-Solomon Decoder with Variable Code Rate and Block Length (가변 부호율과 블록 길이를 갖는 연속 가변형 리드솔로몬 복호기)

  • 공민한;송문규
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.549-552
    • /
    • 2003
  • In this paper, an efficient architecture of a versatile Reed-Solomon (RS) decoder is designed, where the message length k as well as the block length n can be variable. The decoder permits 3-step pipelined processing based on the modified Euclid's algorithm(MEA). A new architecture for the MEA is designed for variable values of error correcting capability t. To maintain the throughput rate with less circuitry, the MEA block uses both the recursive and the overclocking technique. The decoder can decode a codeword received not only in a burst mode, but also in a continuous mode. It can be used in a wide range of applications due to its versatility. A versatile RS decoder over GF(2$^{8}$ ) having the error-correcting capability of up to 10 has been designed in VHDL, and successfully synthesized in an FPGA chip.

  • PDF

Design of Adaptive Reed-Solomon Encoder for Multi QoS Services or Time-Varying Channels (다중 QoS 서비스와 시변 채널을 위한 적응형 RS 부호기의 설계)

  • 공민한;송문규;김응배;정찬복
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.113-116
    • /
    • 2001
  • Reed-Solomon(RS) code is the most powerful burst error correcting code. In Ois paper, the architecture for the adaptive RS encoder adaptable for multi QoS requirements or time-varying channel environments has been designed. In the adaptive RS code, the message length k and the error correction capability t are allowed to be variable so that the block length n is also variable. We proposed the architecture of the adaptive RS encoder by designing the optimal structure of Galois fields multiplier with comparison of fixed multiplier and variable multiplier. The proposed architecture is implemented in VHDL and verified with the simulation tool

  • PDF

Structured LDPC Codes for Mobile Multimedia Communication Systems (이동 멀티미디어 통신 시스템을 위한 구조적인 저밀도패리티검사 부호)

  • Yu, Seog-Kun;Joo, Eon-Kyeong
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.48 no.2
    • /
    • pp.35-39
    • /
    • 2011
  • Error correcting codes with easy variability in code rate and codeword length in addition to powerful error correcting capability are required for present and future mobile multimedia communication systems. And low complexity is also needed for the compact mobile terminals. In general, the irregular random LDPC(low-density parity-check) code is known to have the superior performance among various LDPC codes. But it has inefficiency since the various parity check matrices for various services should be stored for encoding and decoding. The structured LDPC codes which can easily provide various rates and lengths are studied recently. Therefore, the flexibility, memory size, and error performance of various structured LDPC codes are compared and analyzed in this paper. And the most appropriate structured LDPC code is also suggested.

Performance Analysis on Error Correction Scheme for Wireless Sensor Network over Node-to-node Interference

  • Choi, Sang-Min;Moon, Byung-Hyun;Ryu, Jeong-Tak;Park, Se-Hyun
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.1 no.2
    • /
    • pp.37-42
    • /
    • 2006
  • In this paper, we study a problem of providing reliable data transmission in wireless sensor network(WSN). A system with forward error correction9FEC) can provide an objective reliability while using less transmission power than a system without FEC. We propose the use of LDPC codes of various code rate (0.53, 0.81, 0.91) of FEC for WSN. Node-node-node interference is considered in the simulation in addition to AWGN in the channel. It is shown that the rate of 0.91 LDPC coded system obtained 7dB gain in signal to noise ratio over a system without FEC.

  • PDF