Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2025
|
| Sujets: | |
| Accès en ligne: | https://arxiv.org/abs/2510.15070 |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866918162397659136 |
|---|---|
| author | Pendás-Recondo, Álvaro Pendás-Recondo, Enrique |
| author_facet | Pendás-Recondo, Álvaro Pendás-Recondo, Enrique |
| contents | 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 $4M^2$ points, where $M$ 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 power amplifier is 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 $M$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2510_15070 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Structured Family of Grassmannian Constellations via Geodesic Mapping for MIMO Noncoherent Communications Pendás-Recondo, Álvaro Pendás-Recondo, Enrique Signal Processing Differential Geometry 94A14, 94A12, 14M15, 53C22 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 $4M^2$ points, where $M$ 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 power amplifier is 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 $M$. |
| title | A Structured Family of Grassmannian Constellations via Geodesic Mapping for MIMO Noncoherent Communications |
| topic | Signal Processing Differential Geometry 94A14, 94A12, 14M15, 53C22 |
| url | https://arxiv.org/abs/2510.15070 |