On Non-Linear Space-Time Block Codes
Key: SPP02-1
Author: Sumeet Sandhu, Krishna Pandit, Arogyaswami Paulraj
Date: May 2002
Kind: In proceedings
Book title: Proceedings of 2002 International Conference on Acoustics, Speech, and Signal Processing, Orlando, USA
Abstract: A number of space-time block codes have been proposed for the quasi-static, flat-fading channel with coherent receiver. All of these block codes are linear codes, i.e., the encoded codeword is a linear function of the input scalar symbols. Here we propose new non-linear space-time block codes, i.e., the codewords are non-linear functions of the input scalar 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 non-linear code design and the well-known simplex conjecture for multi-dimensional AWGN codes. Finally we show that for certain non-uniformly distributed input symbols, the optimal signal set cannot be designed with linear modulation and non-linear modulation is essential for optimality. This has applications in the design of space-time trellis codes and concatenated space-time coding schemes.
View Full paper (PDF) | Download Full paper (PDF)

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.