Construction and iterative decoding of LDPC codes over rings for phase-noisy channels
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Structured LDPC codes over integer residue rings
EURASIP Journal on Wireless Communications and Networking - Advances in Error Control Coding Techniques
Turbo coded multiple-antenna systems for near-capacity performance
IEEE Journal on Selected Areas in Communications - Special issue on capaciyy approaching codes
The capacity of finite Abelian group codes over symmetric memoryless channels
IEEE Transactions on Information Theory
Linear-programming decoding of nonbinary linear codes
IEEE Transactions on Information Theory
Density evolution for nonbinary LDPC codes under Gaussian approximation
IEEE Transactions on Information Theory
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
IEEE Transactions on Information Theory
| Hi-index | 755.08 |
This paper describes the design and analysis of low-density parity-check (LDPC) codes over rings and shows how these codes, when mapped onto appropriate signal constellations, can be used to effect bandwidth-efficient modulation. Specifically, LDPC codes are constructed over the integer rings$BBZ_m$and$BBG_m^2$and mapped onto phase-shift keying (PSK)-type signal sets to yield geometrically uniform signal space codes. This paper identifies and addresses the design issues that affect code performance. Examples of codes over$BBZ_8$and$BBG_64$mapped onto$8$-ary and$64$-ary signal sets at a spectral efficiency of 1.5 and 2.0 bits per second per hertz (b/s/Hz) illustrate the approach; simulation of these codes over the additive white Gaussian noise (AWGN) channel demonstrates that this approach is a good alternative to bandwidth-efficient techniques based on binary LDPC codes—e.g., bit-interleaved coded modulation.