Two-Round Selection-Based Bit Flipping Decoding Algorithm for LDPC Codes

This paper presents a novel iterative reliability-based bit flipping (BF) algorithm for decoding low-density parity-check codes. The new decoder is a single BF algorithm called two-round selection -based bit flipping. It introduces the idea of a two-round selection of the flipped bit, based successi...

Full description

Saved in:
Bibliographic Details
Published in:Wireless communications and mobile computing Vol. 2023; pp. 1 - 11
Main Authors: Addi, Soufian, Belkasmi, Mostafa, Berkani, Ahlam, Azouaoui, Ahmed
Format: Journal Article
Language:English
Published: Oxford Hindawi 28.11.2023
John Wiley & Sons, Inc
Subjects:
Algorithms
Codes
Data transmission
Decision analysis
Decoders
Decoding
Error correcting codes
Low density parity check codes
Parity
Random noise
ISSN:1530-8669, 1530-8677
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper presents a novel iterative reliability-based bit flipping (BF) algorithm for decoding low-density parity-check codes. The new decoder is a single BF algorithm called two-round selection -based bit flipping. It introduces the idea of a two-round selection of the flipped bit, based successively on hard and soft received channel values. In the first stage, a set of unreliable bits is identified, and then a second selection is used, to pick out among them the bit to flip. In the second round of selection, the initial belief about received signals, contributes efficiently to selecting the best candidate bit. We demonstrate through simulations over the binary-input additive white Gaussian noise channel and the Rayleigh fading channel that the proposed algorithm exhibits better decoding performance when compared with some well-known soft decision BF algorithms. A complexity analysis of the proposal and a comparison to other BF decoders are also presented.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:1530-8669
1530-8677
DOI:10.1155/2023/6262929