DocumentCode
2625366
Title
Weakly-matched groups to signal constellations
Author
Massey, Peter ; Mathys, Peter
Author_Institution
Dept. of Electr. & Comput. Eng., Colorado Univ., Boulder, CO, USA
fYear
1994
fDate
27 Jun-1 Jul 1994
Firstpage
484
Abstract
A signal constellation which has been subdivided by cosets into subconstellations may not be geometrically uniform (i.e. not all cosets have the same list of distances to other cosets). The geometrically uniform cases have an isomorphic mapping between an algebraic group and the minimum coset distances of the constellation. The nongeometrically uniform constellations may have an algebraic group which matches the weakest list of coset distances. Otherwise, there may be a group which matches a lower-bound list of distances. TCM codes can be designed over these weakly-matched groups, or lower-bound-matched groups, and will have codeword-independent lower-bound distance properties
Keywords
Gaussian channels; linear codes; trellis coded modulation; TCM codes; algebraic group; codeword-independent lower-bound distance properties; cosets; geometrically uniform cases; isomorphic mapping; lower-bound-matched groups; minimum coset distances; signal constellations; subconstellations; weakly-matched groups; Constellation diagram; Euclidean distance; Gaussian channels; Imaging phantoms; Labeling; Linear code; Notice of Violation; Signal mapping; Signal processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on
Conference_Location
Trondheim
Print_ISBN
0-7803-2015-8
Type
conf
DOI
10.1109/ISIT.1994.395099
Filename
395099
Link To Document