earticle

논문검색

Min-Sum Algorithm with Maximum Average Mutual Information Quantization

초록

영어

The specific methods of the maximum average mutual information quantization are analyzed and deduced. With this method to quantify the initial message, the variable messages and check messages are converted into integers. Then the min-sum decoding algorithm based on integer arithmetic is implemented. Simulation results demonstrate that the decoding performance of min-sum algorithm based on integer with 7-bit maximum average mutual information quantization is almost the same as that of min-sum algorithm based on integer with 8-bit uniform quantization. Meanwhile, all the variables in the algorithm are fixed-length integers, so it is convenient for hardware implementation. Although the decoding performance is slightly worse than that of the sum-product decoding algorithm, the decoding time is greatly reduced. So it is very convenient for future generation communication.

목차

Abstract
 1. Introduction
 2. The Principle of Min-Sum Algorithm for LDPC Codes
 3. Maximum Average Mutual Information Quantization
 4. Maximum Average Mutual Information Quantization in the Implementation of LDPC Decoding
 5. Performance Simulation and Analysis
 6. Conclusions
 Acknowledgements
 References

저자정보

  • Zhengkang Chen School of Electronics and Information Northwestern Polytechnical University
  • Huisheng Zhang School of Electronics and Information Northwestern Polytechnical University
  • Lixin Li School of Electronics and Information Northwestern Polytechnical University
  • Nan Qi School of Electronics and Information Northwestern Polytechnical University

참고문헌

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

    함께 이용한 논문

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

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