DocumentCode :
2061423
Title :
On non-linear space-time block codes
Author :
Sandhu, Sumeet ; Pandit, Krishna ; Paulraj, Arogyaswami
Author_Institution :
Stanford Univ., CA, USA
fYear :
2002
fDate :
2002
Firstpage :
416
Abstract :
A number of S-T (space-time) block codes have been proposed for the quasi-static, flat-fading channel with coherent receiver. Most of these are linear codes, i.e., the codeword is a linear function of the scalar input symbols. We propose new non-linear S-T block codes, i.e., the codewords are non-linear functions of the input symbols. We demonstrate a non-linear code that outperforms the corresponding linear code by 0.6 to 1.2 dB. We draw parallels between optimal S-T code design and the well-known simplex conjecture for multi-dimensional AWGN codes. Finally we show that for certain nonuniformly distributed input symbols, the optimal signal set cannot be designed with linear S-T modulation and non-linear modulation is essential for optimality. This has applications in the design of S-T trellis codes and concatenated codes.
Keywords :
block codes; channel coding; concatenated codes; fading channels; nonlinear codes; space-time codes; trellis codes; coherent receiver; concatenated codes; multi-dimensional AWGN codes; nonlinear codes; nonlinear modulation; nonuniformly distributed input symbols; optimal signal set; quasi-static flat fading channel; simplex conjecture; space-time block codes; trellis codes; AWGN; Binary phase shift keying; Block codes; Concatenated codes; Convolutional codes; Fading; Linear code; Linear matrix inequalities; Modulation coding; Receiving antennas;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory, 2002. Proceedings. 2002 IEEE International Symposium on
Print_ISBN :
0-7803-7501-7
Type :
conf
DOI :
10.1109/ISIT.2002.1023688
Filename :
1023688
Link To Document :
بازگشت