An Improved Hybrid Offset-Based Min-Sum Decoding Algorithm

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

In this work, a new hybrid approach based on offset min-sum decoding algorithm is proposed for decoding irregular low-density parity-check (LDPC) codes. In the proposed algorithm, incorporations are made in both the nodes of the Tanner graph with varying error correcting factors. In addition, to the error correcting factors, an adaptive weighting factors are utilized in CNU and VNU process to mitigate the numerical instabilities and negative correlation effects. These modifications in turn enhance the error correcting performance, which ultimately results in a better decoding efficiency. Through exhaustive simulation and comparison, it is shown that the proposed algorithm with a six-bit non-uniform quantization scheme exhibits good error correcting outcome at BER of 10 −5 with an acceptable computational complexity.

Cite

CITATION STYLE

APA

Roberts, M. K., & Sunny, E. (2019). An Improved Hybrid Offset-Based Min-Sum Decoding Algorithm. In Lecture Notes in Networks and Systems (Vol. 40, pp. 721–726). Springer. https://doi.org/10.1007/978-981-13-0586-3_70

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