DocumentCode
2060552
Title
Nonintersecting subspaces based on finite alphabets
Author
Oggier, Frédérique E. ; Sloane, N. J A ; Diggavi, Suhas N. ; Calderbank, Robert
Author_Institution
EPFL, Lausanne, Switzerland
fYear
2004
fDate
27 June-2 July 2004
Firstpage
455
Abstract
This paper describes the construction of codewords and subspaces are nonintersecting over the finite field. When the alphabet is a finite field, constructions are lifted to the complex field to obtain maximal diversity differential space-time codes for the noncoherent multiple antenna problems. The construction of codewords (i.e. nonintersecting subspaces) subjects to the constraint that the elements of the codewords use symbols from a fixed, small PSK constellation.
Keywords
antenna arrays; phase shift keying; space-time codes; PSK constellation; code constraint; codeword construction; finite alphabet; maximal diversity differential space-time code; noncoherent multiple antenna problem; nonintersecting subspace; Error probability; Galois fields; Gaussian noise; Geometry; Phase shift keying; Receiving antennas; Space time codes; Subspace constraints; Transmitting antennas;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on
Print_ISBN
0-7803-8280-3
Type
conf
DOI
10.1109/ISIT.2004.1365493
Filename
1365493
Link To Document