By Topic

Block-coded PSK modulation using two-level group codes over dihedral groups

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
J. Bali ; Dept. of Electr. Eng., Indian Inst. of Sci., Bangalore, India ; B. S. Rajan

A length n group code over a group G is a subgroup of Gn under component-wise group operation. Group codes over dihedral groups DM, with 2M elements, that are two-level constructible using a binary code and a code over ZM residue class integer ring modulo M, as component codes are studied for arbitrary M. A set of necessary and sufficient conditions on the component codes for the two-level construction to result in a group code over DM are obtained. The conditions differ for M odd and even. Using two-level group codes over DM as label codes, the performance of a block-coded modulation scheme is discussed under all possible matched labelings of 2M-APSK and 2M-SPSK (asymmetric and symmetric PSK) signal sets in terms of the minimum squared Euclidean distance. Matched labelings that lead to automorphic Euclidean distance equivalent codes are identified. It is shown that depending upon the ratio of Hamming distances of the component codes some labelings perform better than others. The best labeling is identified under a set of restrictive conditions. Finally, conditions on the component codes for phase rotational invariance properties of the signal space codes are discussed

Published in:

IEEE Transactions on Information Theory  (Volume:44 ,  Issue: 4 )