Performance comparison between sum-product and bit-flipping decoding algorithms of gallager’s construction for regular LDPC convolutional codes

Simple item page
dc.contributor.authorLaouar, Oulfa
dc.contributor.authorDerouiche, Nadir
dc.contributor.authorAmamra, Imed
dc.date.accessioned2025-04-17T22:32:04Z
dc.date.available2025-04-17T22:32:04Z
dc.date.issued2021
dc.description.abstractIn this research, we present a performance evaluation and comparison, in terms of complexity and performance, of two decoding algorithms for regular LDPC convolutional codes with Gallager's construction. We define some characteristics of LDPC Convolutional ensembles that enable them to perform better with the Windowed decoder. The Belief Propagation de-coding is used to discuss both Bit-Flipping and Sum-Product algo-rithms. We will focus at how these ensembles and codes perform over an AWGN channel using the BPSK modulation. Our simulation results using the sliding window decoding procedure shows that the Sum-product decoding algorithm outperforms the Bit-Flipping one.
dc.identifier.urihttp://dspace.univ-oeb.dz:4000/handle/123456789/21898
dc.language.isoen
dc.publisherUniversity of Oum El Bouaghi
dc.subjectBelief Propagation (BP); Bit Error Rate (BER); Bit-Flipping (BF), Gallager’s construction; LDPC Convolutional codes (LDPC-CCs); Sum-product (SP)
dc.titlePerformance comparison between sum-product and bit-flipping decoding algorithms of gallager’s construction for regular LDPC convolutional codes
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
Performance Comparison between Sum-Product and.pdf
Size:
736.88 KB
Format:
Adobe Portable Document Format
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
The 1 ST international conference on electronics, artificial intelligence and technologies ICEAINT 2021