LDPC Decoding Over Nonbinary Queue-Based Burst Noise Channels

Iterative decoding based on the sum-product algorithm (SPA) is examined for sending low-density parity check (LDPC) codes over a discrete nonbinary queue-based Markovian burst noise channel. This channel model is adopted due to its analytical tractability and its recently demonstrated capability in accurately representing correlated flat Rayleigh fading channels under antipodal signaling and either hard or soft output quantization. SPA equations are derived in closed form for this model in terms of its parameters. It is then numerically observed that potentially large coding gains can be realized with respect to the Shannon limit by exploiting channel memory as opposed to ignoring it via interleaving. Finally, the LDPC decoding performance under both matched and mismatched decoding regimes is evaluated. It is shown that the Markovian model provides noticeable gains over channel interleaving and that it can effectively capture the underlying fading channel behavior when decoding LDPC codes.

[1]  Keqin Feng,et al.  Construction of cyclotomic codebooks nearly meeting the Welch bound , 2012, Des. Codes Cryptogr..

[2]  Jinghu Chen,et al.  A hybrid coding scheme for the Gilbert-Elliott channel , 2006, IEEE Transactions on Communications.

[3]  Cunsheng Ding,et al.  Complex Codebooks From Combinatorial Designs , 2006, IEEE Transactions on Information Theory.

[4]  Fady Alajaji,et al.  A Binary Communication Channel With Memory Based on a Finite Queue , 2007, IEEE Transactions on Information Theory.

[5]  Evangelos Eleftheriou,et al.  Regular and irregular progressive edge-growth tanner graphs , 2005, IEEE Transactions on Information Theory.

[6]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[7]  Fady Alajaji,et al.  A Model for Correlated Rician Fading Channels Based on a Finite Queue , 2008, IEEE Transactions on Vehicular Technology.

[8]  Tadashi Wadayama.  An Iterative Decoding Algorithm of Low Density Parity Check Codes for Hidden Markov Noise Channels , 2000 .

[9]  Shervin Shahidi,et al.  MAP Detection and Robust Lossy Coding Over Soft-Decision Correlated Fading Channels , 2013, IEEE Transactions on Vehicular Technology.

[10]  Fady Alajaji,et al.  A Discrete Queue-Based Model for Capturing Memory and Soft-Decision Information in Correlated Fading Channels , 2012, IEEE Transactions on Communications.

[11]  Frank R. Kschischang,et al.  Analysis of low-density parity-check codes for the Gilbert-Elliott channel , 2005, IEEE Transactions on Information Theory.

[12]  William Turin,et al.  Hidden Markov modeling of flat fading channels , 1998, IEEE J. Sel. Areas Commun..

[13]  T. Linder,et al.  DECODING LDPC CODES OVER BINARY CHANNELS WITH ADDITIVE MARKOV NOISE , 2017 .

[14]  Rodney A. Kennedy,et al.  Finite-State Markov Modeling of Fading Channels , 2022 .

[15]  Andrew W. Eckford,et al.  Ldpc codes for non-coherent block fading channels with correlation: analysis and design , 2008, IEEE Transactions on Communications.

[16]  William Turin,et al.  Performance Analysis and Modeling of Digital Transmission Systems (Information Technology: Transmission, Processing and Storage) , 2004 .

[17]  Frank R. Kschischang,et al.  On Designing Good LDPC Codes for Markov Channels , 2007, IEEE Transactions on Information Theory.

[18]  John D. Villasenor,et al.  Turbo decoding of Gilbert-Elliot channels , 2002, IEEE Trans. Commun..

[19]  P. Sadeghi,et al.  Finite-state Markov modeling of fading channels - a survey of principles and applications , 2008, IEEE Signal Processing Magazine.

[20]  Chris Winstead,et al.  Decoding LDPC Convolutional Codes on Markov Channels , 2008, EURASIP J. Wirel. Commun. Netw..

[21]  X. Jin.  Factor graphs and the Sum-Product Algorithm , 2002 .

[22]  Fady Alajaji,et al.  Transmission of nonuniform memoryless sources via nonsystematic turbo codes , 2004, IEEE Transactions on Communications.

[23]  Giulio Colavolpe,et al.  On LDPC codes over channels with memory , 2006, IEEE Transactions on Wireless Communications.

[24]  Tor Helleseth,et al.  Near-Optimal Partial Hadamard Codebook Construction Using Binary Sequences Obtained From Quadratic Residue Mapping , 2014, IEEE Transactions on Information Theory.

[25]  J. Garcia-Frías.  Decoding of low-density parity check codes over finite-state binary Markov channels , 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252).

[26]  Yahong Rosa Zheng,et al.  Improved models for the generation of multiple uncorrelated Rayleigh fading waveforms , 2002, IEEE Communications Letters.