Quasi-Gray Labelling for Grassmannian Constellations

This paper presents two polynomial-complexity techniques for assigning Gray-like binary labels to arbitrary Grassmannian constellations. In the first technique, the constellation of interest, C, is matched directly to an auxiliary constellation that can be readily Gray labelled. The optimal matching in this technique can be obtained efficiently, but its application is limited to cases in which an auxiliary constellation with a geometric …