Skip to main navigation Skip to search Skip to main content

A modified Min-sum decoding algorithm for LDPC codes based on analysis of overestimating value

  • Beihang University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

Channel coding is necessary in satellite navigation system to ensure the validity of the navigation messages under the environment with weak signal. Min-sum algorithm is a frequently used decoding method for low density parity check (LDPC) codes. In this paper, a novel method is proposed, which modifies process of check node update in min-sum algorithm by subtracting the maximum overestimating value on output of check node. Simulation results show that the performance of proposed min-sum algorithm is close to log-likelihood-ratio-based belief-propagation (LLR-BP) algorithm and achieves a 0.3 dB coding gain than min-sum algorithm at bit error rate (BER) of 10-5. Also, its complexity is between LLR-BP algorithm and min-sum algorithm which could provide a new way for LDPC decoding of satellite navigation system.

Original languageEnglish
Title of host publication29th International Technical Meeting of the Satellite Division of the Institute of Navigation, ION GNSS 2016
PublisherInstitute of Navigation
Pages2839-2848
Number of pages10
ISBN (Electronic)9781510834101
DOIs
StatePublished - 2016
Event29th International Technical Meeting of the Satellite Division of the Institute of Navigation, ION GNSS 2016 - Portland, United States
Duration: 12 Sep 201616 Sep 2016

Publication series

Name29th International Technical Meeting of the Satellite Division of the Institute of Navigation, ION GNSS 2016
Volume4

Conference

Conference29th International Technical Meeting of the Satellite Division of the Institute of Navigation, ION GNSS 2016
Country/TerritoryUnited States
CityPortland
Period12/09/1616/09/16

Fingerprint

Dive into the research topics of 'A modified Min-sum decoding algorithm for LDPC codes based on analysis of overestimating value'. Together they form a unique fingerprint.

Cite this