By Topic

Block-coded modulation using two-level group codes over generalized quaternion 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)
T. V. Selvakumaran ; Dept. of Math., Indian Inst. of Technol., New Delhi, India ; B. Sundar Rajan

A length n group code over a group G is a subgroup of Gn under component-wise group operation. Two-level group codes over the class of generalized quaternion groups, Q(2m), m⩾3, are constructed using a binary code and a code over Z(2m-1 ), the ring of integers modulo 2m-1 as component codes and a mapping f from Z2×Z(2m-1)to Q(2m ). A set of necessary and sufficient conditions on the component codes is derived which will give group codes over Q(2m). Given the generator matrices of the component codes, the computational effort involved in checking the necessary and sufficient conditions is discussed. Starting from a four-dimensional signal set matched to Q(2 m), it is shown that the Euclidean space codes obtained from the group codes over Q(2m) have Euclidean distance profiles which are independent of the coset representative selection involved in f. A closed-form expression for the minimum Euclidean distance of the resulting group codes over Q(2m) is obtained in terms of the Euclidean distances of the component codes. Finally, it is shown that all four-dimensional signal sets matched to Q(2m) have the same Euclidean distance profile and hence the Euclidean space codes corresponding to each signal set for a given group code over Q(2m ) are automorphic Euclidean-distance equivalent

Published in:

IEEE Transactions on Information Theory  (Volume:45 ,  Issue: 1 )