Saddlepoint Approximations for Short-Packet Wireless Communications

Lancho, Alejandro; Östman, Johan; Durisi, Giuseppe; Koch, Tobias; Vazquez-Vilar, Gonzalo

doi:10.1109/twc.2020.2987573

Cited by 36 publications

(29 citation statements)

References 37 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…The input symmetry described in [43,Definition 3.2] can be generalized by relying on a compact group with the associated Haar measure, rather than a finite additive group with the uniform distribution. The Rayleigh fading channel with per coherence interval power constraint analyzed in [44] is input symmetric for this more general definition. The covariant channels analyzed by Holevo in [45], can be seen as the counterparts of [43,Definition 3.2] and its generalization in the framework of Quantum Information Theory.…”

Section: B Codes On Rényi Symmetric Channelsmentioning

confidence: 99%

A Simple Derivation of the Refined SPB for the Constant Composition Codes

Nakiboğlu

2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

A judicious application of the Berry-Esseen theorem via suitable Augustin information measures is demonstrated to be sufficient for deriving the sphere packing bound with a prefactor that is Ω n −0.5(1−E ′ sp (R)) for all codes on certain families of channels -including the Gaussian channels and the non-stationary Rényi symmetric channels-and for the constant composition codes on stationary memoryless channels. The resulting non-asymptotic bounds have definite approximation error terms. As a preliminary result that might be of interest on its own, the trade-off between type I and type II error probabilities in the hypothesis testing problem with (possibly non-stationary) independent samples is determined up to some multiplicative constants, assuming that the probabilities of both types of error are decaying exponentially with the number of samples, using the Berry-Esseen theorem.

show abstract

Section: B Codes On Rényi Symmetric Channelsmentioning

confidence: 99%

A Simple Derivation of the Refined SPB for the Constant Composition Codes

Nakiboğlu

2019

2019 IEEE International Symposium on Information Theory (ISIT)

View full text Add to dashboard Cite

show abstract

“…where o ρ (1) comprises terms that are uniform in L and vanish as ρ → ∞. In (19), ψ(•) denotes the digamma function and Similar to the CLT, the saddlepoint method [15, Ch. XVI] can be used to estimate tail probabilities.…”

Section: Normal Approximationsmentioning

confidence: 99%

Finite-Blocklength Approximations for Noncoherent Rayleigh Block-Fading Channels

Lancho

Östman

Koch

et al. 2019

2019 53rd Asilomar Conference on Signals, Systems, and Computers

Self Cite

View full text Add to dashboard Cite

Several 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 and SNRs down to 0 dB.

show abstract

“…Later on, simple asymptotic approximations of converse and achievability bounds on the maximal coding rates, particularly useful for short packets, have been provided in [15]. Further, close bounds on the maximum coding rates have been studied in wireless channels of practical interest, e.g., no a priori channel state information available and pilot-assisted or noncoherent transmissions utilized in Rayleigh and Rician fading [16], [17].…”

Section: Introductionmentioning

confidence: 99%

Opportunistic Bits in Short-Packet Communications: A Finite Blocklength Perspective

Yin

Yang

et al. 2021

IEEE Trans. Commun.

View full text Add to dashboard Cite

In this paper, the concept of opportunistic bits (OBs) is developed in short-packet communications and investigated from a finite blocklength perspective. In the OB-based transmission, the data unit of a packet is divided into two parts: OBs and conventional bits (CBs). The OBs are not physically transmitted but used to indicate the index of the time slot (TS) when the packet containing CBs is transmitted. The loading of a bulk of OB-based packets into multiple TSs can be modelled as a Repeated Balls-into-Bins process with a multi-queue storage. If the bulk is not large enough, certain combination(s) of OBs will not appear, which leaves certain TS(s) empty and hence reduces the TS load efficiency. To evaluate the OB-based transmission performance, we formulate its maximal payload rate and TS load efficiency. With the aid of these two formulations, the energy gain, the goodput, and the latency of OB-based short-packet communications are derived and obtained in analytical forms. For achieving further insights, illustrative numerical results on the resource utilisation efficiency and the performance not only substantiate the advantages of the OB-based transmission over the conventional but also provide useful tools and specifications for its design in massive short-packet communications.Index Terms-Opportunistic bit (OB), short-packet communications, finite blocklength, time slot (TS) load efficiency, maximal payload rate, energy gain, goodput.

show abstract

Saddlepoint Approximations for Short-Packet Wireless Communications

Cited by 36 publications

References 37 publications

A Simple Derivation of the Refined SPB for the Constant Composition Codes

A Simple Derivation of the Refined SPB for the Constant Composition Codes

Finite-Blocklength Approximations for Noncoherent Rayleigh Block-Fading Channels

Opportunistic Bits in Short-Packet Communications: A Finite Blocklength Perspective

Contact Info

Product

Resources

About