DocumentCode :
3088574
Title :
Rotationally invariant, geometrically uniform trellis codes
Author :
Sarvis, James P. ; Trott, Mitchell D.
Author_Institution :
Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA
fYear :
1997
fDate :
29 Jun-4 Jul 1997
Firstpage :
525
Abstract :
Given a group trellis and a partitioned signal set, we show how to find all geometrically uniform mappings from the trellis branches to the partition cells. The result is a procedure for constructing geometrically uniform trellis codes and a simple test for rotational invariance
Keywords :
search problems; trellis codes; geometrically uniform mappings; group trellis; partition cells; partitioned signal set; rotational invariance; rotationally invariant geometrically uniform trellis codes; trellis branches; Convolutional codes; Error probability; Gaussian noise; Labeling; Laboratories; Legged locomotion; Linear code; Nearest neighbor searches; Signal mapping; Testing;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location :
Ulm
Print_ISBN :
0-7803-3956-8
Type :
conf
DOI :
10.1109/ISIT.1997.613462
Filename :
613462
Link To Document :
بازگشت