Generalized Karagiannidis–Lioumpas Approximations and Bounds to the Gaussian <i>Q</i>-Function With Optimized Coefficients

نویسندگان

چکیده

We develop extremely tight novel approximations, lower bounds and upper for the Gaussian $Q$ -function offer multiple alternatives coefficient sets thereof, which are optimized in terms of four most relevant criteria: minimax absolute/relative error total error. To minimize maximum, we modify classic Remez algorithm to comply with challenging nonlinearity that pertains proposed expression approximations bounds. On other hand, numerically using quasi-Newton algorithm. The so well matching actual they can be regarded as virtually exact many applications since absolute relative errors 10 −9 xmlns:xlink="http://www.w3.org/1999/xlink">−5 , respectively, reached only ten terms. significant advance accuracy is shown by numerical comparisons key reference cases.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Unimodality of generalized Gaussian coefficients

A combinatorial proof of the unimodality of the generalized q-Gaussian coefficients [ N λ ] q based on the explicit formula for Kostka-Foulkes polynomials is given. 1. Let us mention that the proof of the unimodality of the generalized Gaussian coefficients based on theoretic-representation considerations was given by E.B. Dynkin [1] (see also [2], [10], [11]). Recently K.O’Hara [6] gave a cons...

متن کامل

the modified exp-function method and its applications to the generalized k(n,n) and bbm equations with variable coefficients

in this article, the modified exp-function method is used to construct many exact solutions to the nonlineargeneralized k(n,n) and bbm equations with variable coefficients. under different parameter conditions, explicitformulas for some new exact solutions are successfully obtained. the proposed solutions are found to beimportant for the explanation of some practical physical problems.

متن کامل

Learning Curves for Gaussian Process Regression: Approximations and Bounds

We consider the problem of calculating learning curves (i.e., average generalization performance) of gaussian processes used for regression. On the basis of a simple expression for the generalization error, in terms of the eigenvalue decomposition of the covariance function, we derive a number of approximation schemes. We identify where these become exact and compare with existing bounds on lea...

متن کامل

Bounds on the Fourier Coefficients of the Weighted Sum Function

We estimate Fourier coefficients of a Boolean function which has recently been introduced in the study of read-once branching programs. Our bound implies that this function has an asymptotically “flat” Fourier spectrum and thus implies several lower bounds of its various complexity measures.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Communications Letters

سال: 2022

ISSN: ['1558-2558', '1089-7798', '2373-7891']

DOI: https://doi.org/10.1109/lcomm.2021.3139372