Yao Qi, Raja Das, et al.
ISSTA 2009
In this correspondence, we show that the problem of designing efficient multiple-antenna signal constellations for fading channels can be related to the problem of finding packings with large minimum distance in the complex Grassmannian space. We describe a numerical optimization procedure for finding good packings in the complex Grassmannian space and report the best signal constellations found by this procedure. These constellations improve significantly upon previously known results.
Yao Qi, Raja Das, et al.
ISSTA 2009
G. Ramalingam
Theoretical Computer Science
Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Matthias Kaiserswerth
IEEE/ACM Transactions on Networking