Estamos realizando la búsqueda. Por favor, espere...


Union bound minimization approach for designing grassmannian constellations

Abstract: In this paper, we propose an algorithm for designing unstructured Grassmannian constellations for noncoherent multiple-input multiple-output (MIMO) communications over Rayleigh block-fading channels. Unlike the majority of existing unitary space-time or Grassmannian constellations, which are typically designed to maximize the minimum distance between codewords, in this work we employ the asymptotic pairwise error probability (PEP) union bound (UB) of the constellation as the design criterion. In addition, the proposed criterion allows the design of MIMO Grassmannian constellations specifically optimized for a given number of receiving antennas. A rigorous derivation of the gradient of the asymptotic UB on a Cartesian product of Grassmann manifolds, is the main technical ingredient of the proposed gradient descent algorithm. A simple modification of the proposed cost function, which weighs each pairwise error term in the UB according to the Hamming distance between the binary labels assigned to the respective codewords, allows us to jointly solve the constellation design and the bit labeling problem. Our simulation results show that the constellations designed with the proposed method outperform other structured and unstructured Grassmannian designs in terms of symbol error rate (SER) and bit error rate (BER), for a wide range of scenarios.

 Autoría: Cuevas D., Alvarez-Vizoso J., Beltran C., Santamaria I., Tucek V., Peters G.,

 Fuente: IEEE Transactions on Communications, 2023, 71(4), 1940 -1952

Editorial: Institute of Electrical and Electronics Engineers Inc.

 Fecha de publicación: 01/04/2023

Nº de páginas: 13

Tipo de publicación: Artículo de Revista

 DOI: 10.1109/TCOMM.2023.3244965

ISSN: 0090-6778,1558-0857

Proyecto español: PID2020-113887GB-I00

Url de la publicación: https://doi.org/10.1109/TCOMM.2023.3244965