Lancho Serrano, AlejandroÖstman, JohanKoch, Tobias MircoVázquez Vilar, Gonzalo2020-07-242020-07-242020-03-3053rd Asilomar Conference on Signals, Systems, and Computers(ACSSC 2019), 3-6 Nov. 2019, Pacific Grove, CA, USA. IEEE, 2020, Pp. 815-819978-1-7281-4300-2https://hdl.handle.net/10016/30733Proceeding of: 53rd Asilomar Conference on Signals, Systems, and Computers (ACSSC 2019), 3-6 Nov. 2019, Pacific Grove, CA, USASeveral emerging wireless communication services and applications have stringent latency requirements, necessitating the transmission of short packets. To obtain performance benchmarks for short-packet wireless communications, it is crucial to study the maximum coding rate as a function of the blocklength, commonly called finite-blocklength analysis. A finiteblocklength analysis can be performed via nonasymptotic bounds or via refined asymptotic approximations. This paper reviews finite-blocklength approximations for the noncoherent Rayleigh block-fading channel. These approximations have negligible computational cost compared to the nonasymptotic bounds and are shown to be accurate for error probabilities as small as 10-8 [super index] and SNRs down to 0 dB.5eng© 2020 IEEE.Finite-Blocklength Approximations for Noncoherent Rayleigh Block-Fading Channelsconference paperElectrónicaTelecomunicacioneshttps://doi.org/10.1109/TIT.2013.2262919open access81581953rd Asilomar Conference on Signals, Systems, and Computers, 3-6 Nov. 2019, Pacific Grove, CA, USA. IEEE, 2020CC/0000030814