1
Return

A Structured Family of Grassmannian Constellations via Geodesic Mapping for MIMO Noncoherent Communications

delete2026-08-03
delete0
delete
OA
AI
Á
Álvaro Pendás-Recondo
E
Enrique Pendás-Recondo
DOI:10.1109/twc.2026.3717208delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
This work presents a novel structured family of Grassmannian constellations for multiple-input multiple-output (MIMO) noncoherent communications over Rayleigh block-fading channels, where neither the transmitter nor the receiver has channel state information (CSI). The proposed constellation design is built upon the geodesic curves of the Grassmann manifold, thereby exploiting its underlying geometric structure. The resulting solution is limited in spectral efficiency (with a maximum constellation size of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$4M^{2}$ </tex-math></inline-formula> points, where <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula> is the number of transmit antennas), targeting a rate in the range of 0.25–1 bps/Hz. However, all space-time matrices resulting from this design exhibit the remarkable property of having a single nonzero entry per row, meaning that only one transmit antenna is active per time slot. This property significantly reduces hardware complexity and implementation cost, while also lowering power consumption, as only a single radio-frequency (RF) chain and power amplifier are required for transmission. Furthermore, within the constellation size limits, the proposed design achieves error performance comparable to state-of-the-art optimization-based unstructured designs, as validated through symbol error rate (SER) numerical results. It also enables simple yet effective bit labeling, confirmed by comparisons of bit error rate (BER) and SER, and reduces the computational complexity of the maximum-likelihood (ML) detector for Grassmannian constellations by a factor of <inline-formula xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink"> <tex-math notation="LaTeX">$M$ </tex-math></inline-formula>.
Keywords:
Multiple-input multiple-output (MIMO)
noncoherent communications
unitary space-time modulation (USTM)
Grassmannian constellations
geodesics
Grassmmann manifold
Rayleigh block-fading

Journal

IEEE Transactions on Wireless Communications cover
IEEE Transactions on Wireless Communications
IF:
10.7
Papers:
1.3W
Citations:
5.3W

Organization

Universidad de Oviedo cover
Universidad de Oviedo
Scholars:
459
Papers: 185
Citations: 1.0W
Cited Papers

Cited Papers

Citing Papers

Citing Papers