Multiple-rate low-density parity-check codes with constant blocklength
IEEE Transactions on Communications
Group-theoretic analysis of Cayley-graph-based cycle GF(2p) codes
IEEE Transactions on Communications
Near-Shannon-limit linear-time-encodable nonbinary irregular LDPC codes
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Structure, property, and design of nonbinary regular cycle codes
IEEE Transactions on Communications
Design of nonbinary LDPC codes over GF(q) for multiple-antenna transmission
MILCOM'06 Proceedings of the 2006 IEEE conference on Military communications
Application of Nonbinary LDPC Cycle Codes to MIMO Channels
IEEE Transactions on Wireless Communications
Good error-correcting codes based on very sparse matrices
IEEE Transactions on Information Theory
Quasicyclic low-density parity-check codes from circulant permutation matrices
IEEE Transactions on Information Theory
Rate-compatible puncturing of low-density parity-check codes
IEEE Transactions on Information Theory
Regular and irregular progressive edge-growth tanner graphs
IEEE Transactions on Information Theory
Achieving the Welch bound with difference sets
IEEE Transactions on Information Theory
Quasi-cyclic LDPC codes for fast encoding
IEEE Transactions on Information Theory
Quasi-Cyclic Low-Density Parity-Check Codes With Girth Larger Than 12
IEEE Transactions on Information Theory
Nonbinary LDPC Coding for Multicarrier Underwater Acoustic Communication
IEEE Journal on Selected Areas in Communications
Uplink Cooperative Detection for Non-binary Coded Wireless Network
GREENCOM '11 Proceedings of the 2011 IEEE/ACM International Conference on Green Computing and Communications
Hi-index | 0.00 |
In this paper, we construct nonbinary quasi-cyclic low-density parity-check (QC-LDPC) codes whose parity check matrices consist of an array of square sub-matrices which are either zero matrices or circulant permutation matrices. We propose a novel method to design the shift offset values of the circulant permutation sub-matrices, so that the code length can vary while maintaining a large girth. Extensive Monte Carlo simulations demonstrate that the obtained codes of a wide range of rates (from 1/2 to 8/9) with length from 1000 to 10000 bits have very good performance over both AWGN and Rayleigh fading channels. Furthermore, the proposed method is extended to design multiple nonbinary QC-LDPC codes simultaneously where each individual code can achieve large girth with variable lengths. The proposed codes are appealing to practical adaptive systems where the block length and code rate need to be adaptively adjusted depending on traffic characteristics and channel conditions.