Papers
Topics
Authors
Recent
Search
2000 character limit reached

Constellations on the Sphere with Efficient Encoding-Decoding for Noncoherent Communications

Published 9 Sep 2022 in cs.IT and math.IT | (2209.04172v1)

Abstract: In this paper, we propose a new structured Grassmannian constellation for noncoherent communications over single-input multiple-output (SIMO) Rayleigh block-fading channels. The constellation, which we call Grass-Lattice, is based on a measure preserving mapping from the unit hypercube to the Grassmannian of lines. The constellation structure allows for on-the-fly symbol generation, low-complexity decoding, and simple bit-to-symbol Gray coding. Simulation results show that Grass-Lattice has symbol and bit error rate performance close to that of a numerically optimized unstructured constellation, and is more power efficient than other structured constellations proposed in the literature and a coherent pilot-based scheme.

Citations (5)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.