论文标题

高斯Q功能的全局最小值近似值和界限。

Global Minimax Approximations and Bounds for the Gaussian Q-Function by Sums of Exponentials

论文作者

Tanash, Islam M., Riihonen, Taneli

论文摘要

本文提出了一种新型的系统方法论,可为高斯Q功能获得新的简单而紧密的近似值,下限和上限,并以指数函数的加权总和的形式获得其功能。它们基于最小化最大绝对误差或相对误差,从而导致具有均衡极值的全球均匀误差函数。特别是,我们构造了描述目标误差函数行为并以数值求解的方程组集,以找到指数之和的优化系数集。这还允许通过控制分配给错误函数极端的权重来建立绝对错误和相对误差之间的权衡。我们进一步扩展了提出的程序,以得出Q功能的任何多项式的近似值和边界,这又允许近似和边界符合Taylor串联条件的Q功能的许多功能,并将Q-功能的整数幂视为特殊情况。在数值结果中,将相同和不同形式的其他已知近似值以及直接从正交规则获得的近似值与所提出的近似值和边界进行了比较,以证明它们在整体误差方面实现了越来越高的准确性,因此,与任何相同形式的参考方法相比,要求达到相同的准确度以达到相同的准确度。

This paper presents a novel systematic methodology to obtain new simple and tight approximations, lower bounds, and upper bounds for the Gaussian Q-function, and functions thereof, in the form of a weighted sum of exponential functions. They are based on minimizing the maximum absolute or relative error, resulting in globally uniform error functions with equalized extrema. In particular, we construct sets of equations that describe the behaviour of the targeted error functions and solve them numerically in order to find the optimized sets of coefficients for the sum of exponentials. This also allows for establishing a trade-off between absolute and relative error by controlling weights assigned to the error functions' extrema. We further extend the proposed procedure to derive approximations and bounds for any polynomial of the Q-function, which in turn allows approximating and bounding many functions of the Q-function that meet the Taylor series conditions, and consider the integer powers of the Q-function as a special case. In the numerical results, other known approximations of the same and different forms as well as those obtained directly from quadrature rules are compared with the proposed approximations and bounds to demonstrate that they achieve increasingly better accuracy in terms of the global error, thus requiring significantly lower number of sum terms to achieve the same level of accuracy than any reference approach of the same form.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源