Communications systems suffer from impulsive in- terference, generally modeled as a memory channel to account for the inherent bursts of impulse even though conventional receivers take into account the additive white Gaussian noise only. In this paper, finite- field based constructions of Low Density Parity Check (LDPC) coding over the Markov Gaussian channel are investigated. In contrast with existing approaches assuming the impulse noise statistics, this paper proposes a modified maximum- a-priori method, which forfeits using the statistical knowledge of impulse, to estimate whether or not each transmitted symbol is corrupted by impulse noise. Subsequently, the sum-product algorithm LDPC decoder invokes a clipper to diminish impulsive interference when the channel state is identified to be impulse- corrupted. The bit error rate (BER) performance versus the signal-to-noise ratio for the proposed decoder is conducted using computer simulation. The experimental results in terms of the BER performance justified the robustness of our proposed receiver and also revealed its competitiveness with the optimal benchmark decoder in the hostile environment. Moreover, using the proposed receiver, our calibrated quasi-cyclic LDPC code is shown to slightly outperform its 5G New Radio counterpart under certain circumstances.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Robust Low Density Parity Check Decoding over Markov Gaussian Channels


    Contributors:


    Publication date :

    2019-04-01


    Size :

    542007 byte





    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Low-Density Parity Check Codes and Iterative Decoding for Long-Haul Optical Communication Systems

    Vasic, B. / Djordjevic, I. B. / Kostuk, R. K. | British Library Online Contents | 2003





    Early Stopping of BP Polar Decoding Based on Parity-Check Sums

    Hasani, Alireza / Lopacinski, Lukasz / Grass, Eckhard | IEEE | 2022