Optimum asymmetric constellation design for trellis-coded modulation over Gaussian channels
IEEE Communications Letters
The capacity of finite Abelian group codes over symmetric memoryless channels
IEEE Transactions on Information Theory
Optimum TCM codes design for Gaussian channels by considering both euclidean and hamming distances
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
Group codes outperform binary-coset codes on nonbinary symmetric memoryless channels
IEEE Transactions on Information Theory
| Hi-index | 754.96 |
The well-known uniform error property for signal constellations and codes is extended to encompass information bits. We introduce a class of binary labelings for signal constellations, called bit geometrically uniform (BGU) labelings, for which the uniform bit error property holds, i.e., the bit error probability does not depend on the transmitted signal. Strong connections between the symmetries of constellations and binary Hamming spaces are involved. For block-coded modulation (BCM) and trellis-coded modulation (TCM) Euclidean-space codes, BGU encoders are introduced and studied. The properties of BGU encoders prove quite useful for the analysis and design of codes aimed at minimizing the bit, rather than symbol, error probability. Applications to the analysis and the design of serially concatenated trellis codes are presented, together with a case study which realizes a spectral efficiency of 2 b/s/Hz