Generalized Low-Density Parity-Check Coding Scheme with Partial-Band Jamming

In this study, a class of Generalized Low-Density Parity-Check （GLDPC） codes is designed for data transmission over a Partial-Band Jamming （PBJ） environment. The GLDPC codes are constructed by replacing parity-check code constraints with those of nonsystematic Bose-Chaudhuri-Hocquenghem （BCH）, referred to as Low-Density Parity-Check （LDPC）-BCH codes. The rate of an LDPC-BCH code is adjusted by selecting the transmission length of the nonsystematic BCH code, and a low-complexity decoding algorithm based on message- passing is presented that employs A Posteriori Probability （APP） fast BCH transform for decoding the BCH check nodes at each decoding iteration. Simulation results show that the LDPC-BCH codes with a code rate of 1/8.5 have a bit error rate performance of 1 x10-8 at signal-noise-ratios of -6.97 dB, -4.63 dB, and 2.48 dB when the fractions of the band jammed are 30%, 50%, and 70%, respectively.

Generalized sparse codes for non-Gaussian channels:Code design,algorithms,and applications

In this paper,generalized sparse(GS)codes are proposed to support reliable and efficient transmission over non-Gaussian channels.Specifically,by expanding the single-parity check(SPC)code constraints with powerful algebraic codes,GS codes generalize conventional sparse codes with enhanced error-correcting capability,as well as better code design flexibility by covering a wide range of block-lengths and coding rates with reduced encoding/decoding complexity.Moreover,by introducing a universal communication channel model,a general framework for performance analysis and code design of GS codes is formulated,by which the coding parameters can be optimized for different target channel conditions.Finally,example codes are constructed for several critical application scenarios with non-Gaussian channels.Numerical simulations are performed to demonstrate the superiority of the proposed GS coding scheme to traditional channel coding schemes.