Generalized sparse codes for non-Gaussian channels: Code design, algorithms, and applications
Open Access
- 1 March 2022
- journal article
- research article
- Published by KEAI Publishing in Fundamental Research
- Vol. 2 (2) , 284-295
Abstract
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.Keywords
Funding Information
- National Natural Science Foundation of China (62025110, 62101308)
This publication has 44 references indexed in Scilit:
- Improved Progressive-Edge-Growth (PEG) Construction of Irregular LDPC CodesIEEE Communications Letters, 2004
- Threshold of LDPC-Coded BICM for Rayleigh FadingIEEE Communications Letters, 2004
- Low-rate turbo-Hadamard codesIEEE Transactions on Information Theory, 2003
- Performance analysis and code optimization of low density parity-check codes on Rayleigh fading channelsIEEE Journal on Selected Areas in Communications, 2001
- Design of capacity-approaching irregular low-density parity-check codesIEEE Transactions on Information Theory, 2001
- The capacity of low-density parity-check codes under message-passing decodingIEEE Transactions on Information Theory, 2001
- Concatenated coding for frequency-hop spread-spectrum with partial-band interferenceIEEE Transactions on Communications, 1996
- Performance of optimum and suboptimum receivers in the presence of impulsive noise modeled as an alpha-stable processIEEE Transactions on Communications, 1995
- A recursive approach to low complexity codesIEEE Transactions on Information Theory, 1981
- Low-density parity-check codesIEEE Transactions on Information Theory, 1962