earticle

논문검색

Hybrid Maximum Likelihood Decoding for Linear Block Codes

초록

영어

In this paper we propose a hybrid maximum likelihood decoding (MLD) for linear block codes. For the reliable data transmission over noisy channels, convolutional and block codes are widely used in most digital communication systems. Much more efficient algorithms have been found for using channel measurement information in the decoding of convolutional codes than in the decoding of block codes. Word correlation method can be utilized to use channel measurement information in the decoding of block codes. However as the number of code words becomes larger, the decoding complexity increases dramatically to the power of the number of information bits. The hybrid maximum likelihood decoding can solve the problem of the hardware complexity as well as the computational time. Simulation result for Reed Muller code is presented to demonstrate the effectiveness of the algorithm.

목차

Abstract
 1. Introduction
 2. Maximum Likelihood Decoding
 3. Hybrid MLD
  3.1. Decoding Algorithm
  3.2. Application of the Algorithm
 4. Conclusion
 Acknowledgements
 References

저자정보

  • Young Joon Song Department of Electronic Engineering, Kumoh National Institute of Technology, 1 Yangho-dong, Gumi, Gyungbuk, 730-71, Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

      0개의 논문이 장바구니에 담겼습니다.