Binary LDPC Codes Decoding Algorithm Based on MRF and FPGA Implementation

  • Wang Z
  • Wu W
N/ACitations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The improved LDPC code decoding algorithm mainly refereed to improving decoding performance or reducing the decoding computation complexity. No matter hard decision or soft decision LDPC code decoding algorithm, we can get all ring number by one test, instead of testing each long ring number, after optimizing ring detection algorithm. We putted forward the application of Gaussian Markov Random Field model to realize the source parameter estimation, and make logarithmic likelihood ratio correction of bit sequence received by the channel decoding end. Joining source residual redundancy information is to increase the decoder error correction ability. Source estimation adaptive variable can correct coefficient, and it was regulated by error rate. Under the condition that computational complexity increasedlittlely, the LDPC code decoding algorithm based on MRF effectively improved the decoding performance and implemented the improvement of LDPC code decoding algorithm. In the end, we realized the decoding algorithm by using FPGA. © 2016 Universitas Ahmad Dahlan.

Cite

CITATION STYLE

APA

Wang, Z., & Wu, W. (2016). Binary LDPC Codes Decoding Algorithm Based on MRF and FPGA Implementation. TELKOMNIKA (Telecommunication Computing Electronics and Control), 14(4), 1383. https://doi.org/10.12928/telkomnika.v14i4.4158

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free