• Title/Summary/Keyword: hamming code

Search Result 92, Processing Time 0.035 seconds

An Error Control Line Code Based on an Extended Hamming Code (확대 Hamming 부호를 이용한 오류제어선로부호)

  • 김정구;정창기;이수인;주언경
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.5
    • /
    • pp.912-919
    • /
    • 1994
  • A new error control line code based on an extended Hamming code is proposed and its performance is analyzed in this paper. The proposed code is capable of single error correction and double error detection since its minimum Hamming distance is 4. In addition, the error detection capability can be oncreased due to the redundancy bit used for line coding. As a result, the proposed code shows lower code rate, but better spectral characteristics in low frequency region and lower residual bit error rate than the conventional error correction line code using Hamming (7, 4) code.

  • PDF

Computationally Efficient Implementation of a Hamming Code Decoder Using Graphics Processing Unit

  • Islam, Md Shohidul;Kim, Cheol-Hong;Kim, Jong-Myon
    • Journal of Communications and Networks
    • /
    • v.17 no.2
    • /
    • pp.198-202
    • /
    • 2015
  • This paper presents a computationally efficient implementation of a Hamming code decoder on a graphics processing unit (GPU) to support real-time software-defined radio, which is a software alternative for realizing wireless communication. The Hamming code algorithm is challenging to parallelize effectively on a GPU because it works on sparsely located data items with several conditional statements, leading to non-coalesced, long latency, global memory access, and huge thread divergence. To address these issues, we propose an optimized implementation of the Hamming code on the GPU to exploit the higher parallelism inherent in the algorithm. Experimental results using a compute unified device architecture (CUDA)-enabled NVIDIA GeForce GTX 560, including 335 cores, revealed that the proposed approach achieved a 99x speedup versus the equivalent CPU-based implementation.

A Study on the Decoding of Hamming Codes using Soft Values on the Molecular Communication Channel (분자통신 채널에서 소프트 값을 이용한 해밍부호의 복호에 대한 연구)

  • Cheong, Ho-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.13 no.5
    • /
    • pp.338-343
    • /
    • 2020
  • In this paper, it was shown that the decoding method of Hamming codes using soft values can be applied to molecular communication channels. A soft value criterion that can be used for decoding of Hamming codes for a molecular communication channel was proposed, and it has been shown through simulation that the decoding method using these values can improve reliability even in the molecular communication channel. A diffusion-based molecular communication channel was assumed, and information symbols were transmitted using BCSK modulation. After demodulating the number of molecules absorbed by the receiver at each symbol interval with an appropriate threshold, the number of molecules is no longer used. In this paper, the BER performance of the decoder was improved by utilizing information on the number of molecules that are no longer used as soft values in the decoding process. Simulation was performed to confirm the improvement in BER performance. When the number of molecules per bit is 600, the error rate of the Hamming code (15,11) was improved about 5.0×10-3 to the error rate of the BCSK system without the Hamming code. It can be seen that the error rate of (15,11) Hamming code with the soft values was improved to the same extent. In the case of (7,4) Hamming code, the result is similar to that of (15,11) Hamming code. Therefore, it can be seen that the BER performance of the Hamming code can be greatly improved even in the molecular communication channel by using the difference between the number of molecules absorbed by the receiver and the threshold value as a soft value.

An Improved Decoding Scheme of Hamming Codes using Soft Values (소프트 값을 이용한 해밍 부호의 개선된 복호 방식)

  • Cheong, Ho-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.12 no.1
    • /
    • pp.37-42
    • /
    • 2019
  • In this paper, we propose a syndrome decoding scheme that can correct two errors for single error correcting Hamming codes within a code length. The decoding scheme proposed in this paper has the advantage of significantly improving the error rate performance compared to the decoder complexity by correcting multiple errors without substantially increasing the decoding complexity. It is suitable for applications in which the energy use of encoder/decoder is extremely limited and the low error rate performance is required, such as IoT communications and molecular communications. In order to verify the improvement of the error rate performance of the Hamming code with the proposed decoding scheme, we performed simulation on Hamming codes with short code length in the AWGN and BPSK modulation environments. As a result, compared with the conventional decoding method, the proposed decoding scheme showed performance improvement of about 1.1 ~ 1.2[dB] regardless of the code length of the Hamming code.

A Study on Hamming Codes for Mitigating ISI on the Diffusion-based Molecular Communication Channel (확산기반 분자통신 채널에서 ISI 완화를 위한 해밍 부호에 관한 연구)

  • Cheong, Ho-Young
    • The Journal of Korea Institute of Information, Electronics, and Communication Technology
    • /
    • v.14 no.1
    • /
    • pp.1-6
    • /
    • 2021
  • In this paper, in order to mitigate ISI(inter-symbol interference) in a diffusion-based molecular communication channel, an ISI Hamming code is proposed in which ISI characteristics are applied to a channel decoding algorithm. In order to prove the bit error rate performance of the proposed channel code, the bit error rate performance of the major channel codes applied to the molecular communication channel with ISI was compared and analyzed through simulation. From the simulation results, it can be seen that the bit error rate performance of the ISI Hamming code is the best when the number of radiated molecules is less than or equal to 1100. In addition, when the number of transmitted molecules is M=1000, the decoding method of the ISI Hamming code proposed in this paper has improved the bit error rate of approximately 5.9×10-5 compared to the Hamming code using only soft values. Compared with the ISI-mitigating channel code, which is effective for removing ISI in the molecular communication channel, the ISI Hamming code proposed in this paper is the most advantageous in a channel environment where the number of transmitted molecules is not big (M<1100). And we can see that the ISI-mitigating channel code is more advantageous when the number of transmitted molecules is large(M>1100).

Design of Low Power Error Correcting Code Using Various Genetic Operators (다양한 유전 연산자를 이용한 저전력 오류 정정 코드 설계)

  • Lee, Hee-Sung;Hong, Sung-Jun;An, Sung-Je;Kim, Eun-Tai
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.19 no.2
    • /
    • pp.180-184
    • /
    • 2009
  • The memory is very sensitive to the soft error because the integration of the memory increases under low power environment. Error correcting codes (ECCs) are commonly used to protect against the soft errors. This paper proposes a new genetic ECC design method which reduces power consumption. Power is minimized using the degrees of freedom in selecting the parity check matrix of the ECCs. Therefore, the genetic algorithm which has the novel genetic operators tailored for this formulation is employed to solve the non-linear power optimization problem. Experiments are performed with Hamming code and Hsiao code to illustrate the performance of the proposed method.

Analysis of CRC-p Code Performance and Determination of Optimal CRC Code for VHF Band Maritime Ad-hoc Wireless Communication (CRC-p 코드 성능분석 및 VHF 대역 해양 ad-hoc 무선 통신용 최적 CRC 코드의 결정)

  • Cha, You-Gang;Cheong, Cha-Keon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37 no.6A
    • /
    • pp.438-449
    • /
    • 2012
  • This paper presents new CRC-p codes for VHF band maritime wireless communication system based on performance analysis of various CRC codes. For this purpose, we firstly describe the method of determination of undetected error probability and minimum Hamming distance according to variation of CRC codeword length. By using the fact that the dual code of cyclic Hamming code and primitive BCH code become maximum length codes, we present an algorithm for computation of undetected error probability and minimum Hamming distance where the concept of simple hardware that is consisted of linear feedback shift register is utilized to compute the weight distribution of CRC codes. We also present construction of transmit data frame of VHF band maritime wireless communication system and specification of major communication parameters. Finally, new optimal CRC-p codes are presented based on the simulation results of undetected error probability and minimum Hamming distance using the various generator polynomials of CRC codes, and their performances are evaluated with simulation results of bit error rate based on the Rician maritime channel model and ${\pi}$/4-DQPSK modulator.

Performance Analysis of CRC Error Detecting Codes (CRC 오류검출부호의 성능 분석)

  • 염흥렬;권주한;양승두;이만영
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.14 no.6
    • /
    • pp.590-603
    • /
    • 1989
  • In tnis paper, the CRC-CCITT code and primitive polynomial CRC code are selected for analysing error detecting performance. However, general formulas for obtaining the weight distribution of these two CRC codes are not so far dericed. So, a new method for calculating the weight distribution of the shortened cyclic Hamming code is presented and an undetected error probability of these two codes is obtained when used in cell of ATM for broadband ISDN user-network interface. Consequently, we show that CRC code too much does affect its error detection performance. All the computer simulation is performed by IBM PC/AT.

  • PDF

GPU-Based ECC Decode Unit for Efficient Massive Data Reception Acceleration

  • Kwon, Jisu;Seok, Moon Gi;Park, Daejin
    • Journal of Information Processing Systems
    • /
    • v.16 no.6
    • /
    • pp.1359-1371
    • /
    • 2020
  • In transmitting and receiving such a large amount of data, reliable data communication is crucial for normal operation of a device and to prevent abnormal operations caused by errors. Therefore, in this paper, it is assumed that an error correction code (ECC) that can detect and correct errors by itself is used in an environment where massive data is sequentially received. Because an embedded system has limited resources, such as a low-performance processor or a small memory, it requires efficient operation of applications. In this paper, we propose using an accelerated ECC-decoding technique with a graphics processing unit (GPU) built into the embedded system when receiving a large amount of data. In the matrix-vector multiplication that forms the Hamming code used as a function of the ECC operation, the matrix is expressed in compressed sparse row (CSR) format, and a sparse matrix-vector product is used. The multiplication operation is performed in the kernel of the GPU, and we also accelerate the Hamming code computation so that the ECC operation can be performed in parallel. The proposed technique is implemented with CUDA on a GPU-embedded target board, NVIDIA Jetson TX2, and compared with execution time of the CPU.