An effective design of parity check matrix for LDPC codes using multi-objective gravitational search algorithm
by S. Suresh Kumar; M. Rajaram
International Journal of Biomedical Engineering and Technology (IJBET), Vol. 30, No. 1, 2019

Abstract: The low-density parity-check (LDPC) code is an efficient contender for capacity approaching error correction over many important channels. In this paper, we design a parity check matrix for error correction using multi-objective gravitational search algorithm. The overall steps of the proposed technique are explained with three steps: 1) new objective function generation; 2) optimised parity check matrix generation using MGSA; 3) an LDPC encoding-decoding system design. At first, a multi-objective function is derived based on four efficient objectives like low density, maximum hamming minimum distance, maximum marginal entropy, and maximum cyclic lifting degree. Our GSA-based approach is developed with efficient agent representation, fitness computation along with usual GSA operators. Once the parity check matrix is computed, this matrix is utilised for LDPC encoding. The proposed approach is evaluated through bit error rate (BER) measure. From the results, we ensure that the proposed technique outperformed the existing technique by achieving the BER of 0.0513, 0.0348, and 0.0270 in fourth iteration.

Online publication date: Mon, 24-Jun-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Biomedical Engineering and Technology (IJBET):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com