Publication:
Efficient evaluation of the error probability for pilot-assisted URLLC with massive MIMO

dc.affiliation.dptoUC3M. Departamento de Teoría de la Señal y Comunicacioneses
dc.affiliation.grupoinvUC3M. Grupo de Investigación: Tratamiento de la Señal y Aprendizaje (GTSA)es
dc.contributor.authorKislal, A. Oguz
dc.contributor.authorLancho Serrano, Alejandro
dc.contributor.authorGiuseppe, Durisi
dc.contributor.authorStröm, Erik G.
dc.contributor.funderEuropean Commissionen
dc.date.accessioned2023-09-18T14:09:57Z
dc.date.available2023-09-18T14:09:57Z
dc.date.issued2023-07
dc.descriptionAn earlier version of this paper was presented in part at the Asilomar Conference on Signals, Systems, and Computers, Pacific Grove, CA, USA, November 2022.en
dc.description.abstractWe propose a numerically efficient method for evaluating the random-coding union bound with parameter s on the error probability achievable in the finite-blocklength regime by a pilot-assisted transmission scheme employing Gaussian codebooks and operating over a memoryless block-fading channel. Our method relies on the saddlepoint approximation, which, differently from previous results reported for similar scenarios, is performed with respect to the number of fading blocks (a.k.a. diversity branches) spanned by each codeword, instead of the number of channel uses per block. This different approach avoids a costly numerical averaging of the error probability over the realizations of the fading process and of its pilot-based estimate at the receiver and results in a significant reduction of the number of channel realizations required to estimate the error probability accurately. Our numerical experiments for both single-antenna communication links and massive multiple-input multiple-output (MIMO) networks show that, when two or more diversity branches are available, the error probability can be estimated accurately with the saddlepoint approximation with respect to the number of fading blocks using a numerical method that requires about two orders of magnitude fewer Monte-Carlo samples than with the saddlepoint approximation with respect to the number of channel uses per block.en
dc.description.sponsorshipThis work was supported in part by the Swedish Research Council under Grant 2018-04359 and in part by the National Science Foundation under Grant CCF-2131115. The work of Alejandro Lancho was supported by the European Union's Horizon 2020 Research and Innovation Programme through the Marie Sklodowska-Curie under Grant 101024432.en
dc.format.extent13
dc.identifier.bibliographicCitationKislal, A. O., Lancho, A., Durisi, G., & Ström, E. G. (2023). Efficient evaluation of the error probability for pilot-assisted URLLC with massive MIMO. IEEE Journal on Selected Areas in Communications, 41(7), 1969-1981.en
dc.identifier.doihttps://doi.org/10.1109/JSAC.2023.3280972
dc.identifier.issn0733-8716
dc.identifier.publicationfirstpage1969
dc.identifier.publicationissue7
dc.identifier.publicationlastpage1981
dc.identifier.publicationtitleIEEE Journal on Selected Areas in Communicationsen
dc.identifier.publicationvolume41
dc.identifier.urihttps://hdl.handle.net/10016/38368
dc.identifier.uxxiAR/0000033309
dc.language.isoengen
dc.publisherIEEEen
dc.relation.projectIDinfo:eu-repo/grantAgreement/EC/101024432
dc.rights© 2023 IEEE.es
dc.rights.accessRightsopen accessen
dc.subject.ecienciaElectrónicaes
dc.subject.ecienciaTelecomunicacioneses
dc.subject.otherPilot-assisted transmissionen
dc.subject.otherFinite-blocklength information theoryen
dc.subject.otherSaddlepoint approximationen
dc.subject.otherUltra-reliable low-latency communicationen
dc.subject.otherMassive MIMO systemen
dc.titleEfficient evaluation of the error probability for pilot-assisted URLLC with massive MIMOen
dc.typeresearch article*
dc.type.hasVersionVoR*
dspace.entity.typePublication
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
Efficient_JSAC_2023_ps.pdf
Size:
4.62 MB
Format:
Adobe Portable Document Format