Performance comparison between sum-product and bit-flipping decoding algorithms of gallager’s construction for regular LDPC convolutional codes
No Thumbnail Available
Date
2021
Journal Title
Journal ISSN
Volume Title
Publisher
University of Oum El Bouaghi
Abstract
In 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.
Description
Keywords
Belief Propagation (BP); Bit Error Rate (BER); Bit-Flipping (BF), Gallager’s construction; LDPC Convolutional codes (LDPC-CCs); Sum-product (SP)