An Upper Bound on the Error Induced by Saddlepoint Approximations—Applications to Information Theory †

This paper introduces an upper bound on the absolute difference between: (a) the cumulative distribution function (CDF) of the sum of a finite number of independent and identically distributed random variables with finite absolute third moment; and (b) a saddlepoint approximation of such CDF. This upper bound, which is particularly precise in the regime of large deviations, is used to study the dependence testing (DT) bound and the meta converse (MC) bound on the decoding error probability (DEP) in point-to-point memoryless channels. Often, these bounds cannot be analytically calculated and thus lower and upper bounds become particularly useful. Within this context, the main results include, respectively, new upper and lower bounds on the DT and MC bounds. A numerical experimentation of these bounds is presented in the case of the binary symmetric channel, the additive white Gaussian noise channel, and the additive symmetric α-stable noise channel.

[1]  Jean-Marie Gorce,et al.  On the saddlepoint approximation of the dependence testing bound in memoryless channels , 2020, ICC 2020 - 2020 IEEE International Conference on Communications (ICC).

[2]  Nico Temme,et al.  The uniform asymptotic expansion of a class of integrals related to cumulative distribution functions , 1981 .

[3]  J. Nicholas Laneman,et al.  A Second-Order Achievable Rate Region for Gaussian Multi-Access Channels via a Central Limit Theorem for Functions , 2015, IEEE Transactions on Information Theory.

[4]  Juan Carlos Abril,et al.  Saddlepoint Approximations , 2011, International Encyclopedia of Statistical Science.

[5]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[6]  V. Zolotarev One-dimensional stable distributions , 1986 .

[7]  Ebrahim MolavianJazi,et al.  A Unified Approach to Gaussian Channels with Finite Blocklength , 2014 .

[8]  H. E. Daniels,et al.  Tail Probability Approximations , 1987 .

[9]  I. Shevtsova On the absolute constants in the Berry-Esseen-type inequalities , 2011, 1111.6554.

[10]  Albert Guillén i Fàbregas,et al.  A complex-integration approach to the saddlepoint approximation for random-coding bounds , 2014, 2014 11th International Symposium on Wireless Communications Systems (ISWCS).

[11]  H. Daniels Exact saddlepoint approximations , 1980 .

[12]  H. Vincent Poor,et al.  Channel Coding Rate in the Finite Blocklength Regime , 2010, IEEE Transactions on Information Theory.

[13]  Gonzalo Vazquez-Vilar,et al.  Saddlepoint approximations of lower and upper bounds to the error probability in channel coding , 2018, 2018 52nd Annual Conference on Information Sciences and Systems (CISS).

[14]  H. Daniels Saddlepoint Approximations in Statistics , 1954 .

[15]  S. Rice,et al.  Saddle point approximation for the distribution of the sum of independent random variables , 1980, Advances in Applied Probability.

[16]  F Escher,et al.  On the probability function in the collective theory of risk , 1932 .