Marcum Q-function

From testwiki
Revision as of 10:14, 10 January 2025 by imported>Swinub (Applications: Grammar)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

In statistics, the generalized Marcum Q-function of order ν is defined as

Qν(a,b)=1aν1bxνexp(x2+a22)Iν1(ax)dx

where b0 and a,ν>0 and Iν1 is the modified Bessel function of first kind of order ν1. If b>0, the integral converges for any ν. The Marcum Q-function occurs as a complementary cumulative distribution function for noncentral chi, noncentral chi-squared, and Rice distributions. In engineering, this function appears in the study of radar systems, communication systems, queueing system, and signal processing. This function was first studied for ν=1, and hence named after, by Jess Marcum for pulsed radars.[1]

Properties

Finite integral representation

Using the fact that Qν(a,0)=1, the generalized Marcum Q-function can alternatively be defined as a finite integral as

Qν(a,b)=11aν10bxνexp(x2+a22)Iν1(ax)dx.

However, it is preferable to have an integral representation of the Marcum Q-function such that (i) the limits of the integral are independent of the arguments of the function, (ii) and that the limits are finite, (iii) and that the integrand is a Gaussian function of these arguments. For positive integer values of ν=n, such a representation is given by the trigonometric integral[2][3]

Qn(a,b)={Hn(a,b)a<b,12+Hn(a,a)a=b,1+Hn(a,b)a>b,

where

Hn(a,b)=ζ1n2πexp(a2+b22)02πcos(n1)θζcosnθ12ζcosθ+ζ2exp(abcosθ)dθ,

and the ratio ζ=a/b is a constant.

For any real ν>0, such finite trigonometric integral is given by[4]

Qν(a,b)={Hν(a,b)+Cν(a,b)a<b,12+Hν(a,a)+Cν(a,b)a=b,1+Hν(a,b)+Cν(a,b)a>b,

where Hn(a,b) is as defined before, ζ=a/b, and the additional correction term is given by

Cν(a,b)=sin(νπ)πexp(a2+b22)01(x/ζ)ν1ζ+xexp[ab2(x+1x)]dx.

For integer values of ν, the correction term Cν(a,b) tend to vanish.

Monotonicity and log-concavity

  • The generalized Marcum Q-function Qν(a,b) is strictly increasing in ν and a for all a0 and b,ν>0, and is strictly decreasing in b for all a,b0 and ν>0.[5]
  • The function νQν(a,b) is log-concave on [1,) for all a,b0.[5]
  • The function bQν(a,b) is strictly log-concave on (0,) for all a0 and ν>1, which implies that the generalized Marcum Q-function satisfies the new-is-better-than-used property.[6]
  • The function a1Qν(a,b) is log-concave on [0,) for all b,ν>0.[5]

Series representation

  • The generalized Marcum Q function of order ν>0 can be represented using incomplete Gamma function as[7][8][9]
Qν(a,b)=1ea2/2k=01k!γ(ν+k,b22)Γ(ν+k)(a22)k,
where γ(s,x) is the lower incomplete Gamma function. This is usually called the canonical representation of the ν-th order generalized Marcum Q-function.
Qν(a,b)=1ea2/2k=0(1)kLk(ν1)(a22)Γ(ν+k+1)(b22)k+ν,
where Lk(α)() is the generalized Laguerre polynomial of degree k and of order α.
  • The generalized Marcum Q-function of order ν>0 can also be represented as Neumann series expansions[4][8]
Qν(a,b)=e(a2+b2)/2α=1ν(ab)αIα(ab),
1Qν(a,b)=e(a2+b2)/2α=ν(ba)αIα(ab),
where the summations are in increments of one. Note that when α assumes an integer value, we have Iα(ab)=Iα(ab).
  • For non-negative half-integer values ν=n+1/2, we have a closed form expression for the generalized Marcum Q-function as[8][10]
Qn+1/2(a,b)=12[erfc(ba2)+erfc(b+a2)]+e(a2+b2)/2k=1n(ba)k1/2Ik1/2(ab),
where erfc() is the complementary error function. Since Bessel functions with half-integer parameter have finite sum expansions as[4]
I±(n+0.5)(z)=1πk=0n(n+k)!k!(nk)![(1)kez(1)nez(2z)k+0.5],
where n is non-negative integer, we can exactly represent the generalized Marcum Q-function with half-integer parameter. More precisely, we have[4]
Qn+1/2(a,b)=Q(ba)+Q(b+a)+1b2πi=1n(ba)ik=0i1(i+k1)!k!(ik1)![(1)ke(ab)2/2+(1)ie(a+b)2/2(2ab)k],
for non-negative integers n, where Q() is the Gaussian Q-function. Alternatively, we can also more compactly express the Bessel functions with half-integer as sum of hyperbolic sine and cosine functions:[11]
In+12(z)=2zπ[gn(z)sinh(z)+gn1(z)cosh(z)],
where g0(z)=z1, g1(z)=z2, and gn1(z)gn+1(z)=(2n+1)z1gn(z) for any integer value of n.

Recurrence relation and generating function

  • Integrating by parts, we can show that generalized Marcum Q-function satisfies the following recurrence relation[8][10]
Qν+1(a,b)Qν(a,b)=(ba)νe(a2+b2)/2Iν(ab).
  • The above formula is easily generalized as[10]
Qνn(a,b)=Qν(a,b)(ba)νe(a2+b2)/2k=1n(ab)kIνk(ab),
Qν+n(a,b)=Qν(a,b)+(ba)νe(a2+b2)/2k=0n1(ba)kIν+k(ab),
for positive integer n. The former recurrence can be used to formally define the generalized Marcum Q-function for negative ν. Taking Q(a,b)=1 and Q(a,b)=0 for n=, we obtain the Neumann series representation of the generalized Marcum Q-function.
  • The related three-term recurrence relation is given by[7]
Qν+1(a,b)(1+cν(a,b))Qν(a,b)+cν(a,b)Qν1(a,b)=0,
where
cν(a,b)=(ba)Iν(ab)Iν+1(ab).
We can eliminate the occurrence of the Bessel function to give the third order recurrence relation[7]
a22Qν+2(a,b)=(a22ν)Qν+1(a,b)+(b22+ν)Qν(a,b)b22Qν1(a,b).
  • Another recurrence relationship, relating it with its derivatives, is given by
Qν+1(a,b)=Qν(a,b)+1aaQν(a,b),
Qν1(a,b)=Qν(a,b)+1bbQν(a,b).
  • The ordinary generating function of Qν(a,b) for integral ν is[10]
n=tnQn(a,b)=e(a2+b2)/2t1te(b2t+a2/t)/2,
where |t|<1.

Symmetry relation

  • Using the two Neumann series representations, we can obtain the following symmetry relation for positive integral ν=n
Qn(a,b)+Qn(b,a)=1+e(a2+b2)/2[I0(ab)+k=1n1a2k+b2k(ab)kIk(ab)].
In particular, for n=1 we have
Q1(a,b)+Q1(b,a)=1+e(a2+b2)/2I0(ab).

Special values

Some specific values of Marcum-Q function are[6]

  • Qν(0,0)=1,
  • Qν(a,0)=1,
  • Qν(a,+)=0,
  • Qν(0,b)=Γ(ν,b2/2)Γ(ν),
  • Qν(+,b)=1,
  • Q(a,b)=1,
  • For a=b, by subtracting the two forms of Neumann series representations, we have[10]
Q1(a,a)=12[1+ea2I0(a2)],
which when combined with the recursive formula gives
Qn(a,a)=12[1+ea2I0(a2)]+ea2k=1n1Ik(a2),
Qn(a,a)=12[1+ea2I0(a2)]ea2k=1nIk(a2),
for any non-negative integer n.
  • For ν=1/2, using the basic integral definition of generalized Marcum Q-function, we have[8][10]
Q1/2(a,b)=12[erfc(ba2)+erfc(b+a2)].
  • For ν=3/2, we have
Q3/2(a,b)=Q1/2(a,b)+2πsinh(ab)ae(a2+b2)/2.
  • For ν=5/2 we have
Q5/2(a,b)=Q3/2(a,b)+2πabcosh(ab)sinh(ab)a3e(a2+b2)/2.

Asymptotic forms

  • Assuming ν to be fixed and ab large, let ζ=a/b>0, then the generalized Marcum-Q function has the following asymptotic form[7]
Qν(a,b)n=0ψn,
where ψn is given by
ψn=12ζν2π(1)n[An(ν1)ζAn(ν)]ϕn.
The functions ϕn and An are given by
ϕn=[(ba)22ab]n12Γ(12n,(ba)22),
An(ν)=2nΓ(12+ν+n)n!Γ(12+νn).
The function An(ν) satisfies the recursion
An+1(ν)=(2n+1)24ν28(n+1)An(ν),
for n0 and A0(ν)=1.
  • In the first term of the above asymptotic approximation, we have
ϕ0=2πabbaerfc(ba2).
Hence, assuming b>a, the first term asymptotic approximation of the generalized Marcum-Q function is[7]
Qν(a,b)ψ0=(ba)ν12Q(ba),
where Q() is the Gaussian Q-function. Here Qν(a,b)0.5 as ab.
For the case when a>b, we have[7]
Qν(a,b)1ψ0=1(ba)ν12Q(ab).
Here too Qν(a,b)0.5 as ab.

Differentiation

  • The partial derivative of Qν(a,b) with respect to a and b is given by[12][13]
aQν(a,b)=a[Qν+1(a,b)Qν(a,b)]=a(ba)νe(a2+b2)/2Iν(ab),
bQν(a,b)=b[Qν1(a,b)Qν(a,b)]=b(ba)ν1e(a2+b2)/2Iν1(ab).
We can relate the two partial derivatives as
1aaQν(a,b)+1bbQν+1(a,b)=0.
  • The n-th partial derivative of Qν(a,b) with respect to its arguments is given by[10]
nanQν(a,b)=n!(a)nk=0[n/2](2a2)kk!(n2k)!p=0nk(1)p(nkp)Qν+p(a,b),
nbnQν(a,b)=n!a1ν2nbnν+1e(a2+b2)/2k=[n/2]n(2b2)k(nk)!(2kn)!p=0k1(k1p)(ab)pIνp1(ab).

Inequalities

Qν2(a,b)>Qν1(a,b)+Qν+1(a,b)2>Qν1(a,b)Qν+1(a,b)
for all ab>0 and ν>1.

Bounds

Based on monotonicity and log-concavity

Various upper and lower bounds of generalized Marcum-Q function can be obtained using monotonicity and log-concavity of the function νQν(a,b) and the fact that we have closed form expression for Qν(a,b) when ν is half-integer valued.

Let x0.5 and x0.5 denote the pair of half-integer rounding operators that map a real x to its nearest left and right half-odd integer, respectively, according to the relations

x0.5=x0.5+0.5
x0.5=x+0.50.5

where x and x denote the integer floor and ceiling functions.

  • The monotonicity of the function νQν(a,b) for all a0 and b>0 gives us the following simple bound[14][8][15]
Qν0.5(a,b)<Qν(a,b)<Qν0.5(a,b).
However, the relative error of this bound does not tend to zero when b.[5] For integral values of ν=n, this bound reduces to
Qn0.5(a,b)<Qn(a,b)<Qn+0.5(a,b).
A very good approximation of the generalized Marcum Q-function for integer valued ν=n is obtained by taking the arithmetic mean of the upper and lower bound[15]
Qn(a,b)Qn0.5(a,b)+Qn+0.5(a,b)2.
  • A tighter bound can be obtained by exploiting the log-concavity of νQν(a,b) on [1,) as[5]
Qν1(a,b)ν2vQν2(a,b)vν1<Qν(a,b)<Qν2(a,b)ν2ν+1Qν2+1(a,b)ν2ν,
where ν1=ν0.5 and ν2=ν0.5 for ν1.5. The tightness of this bound improves as either a or ν increases. The relative error of this bound converges to 0 as b.[5] For integral values of ν=n, this bound reduces to
Qn0.5(a,b)Qn+0.5(a,b)<Qn(a,b)<Qn+0.5(a,b)Qn+0.5(a,b)Qn+1.5(a,b).

Cauchy-Schwarz bound

Using the trigonometric integral representation for integer valued ν=n, the following Cauchy-Schwarz bound can be obtained[3]

eb2/2Qn(a,b)exp[12(b2+a2)]I0(2ab)2n12+ζ2(1n)2(1ζ2),ζ<1,
1Qn(a,b)exp[12(b2+a2)]I0(2ab)ζ2(1n)2(ζ21),ζ>1,

where ζ=a/b>0.

Exponential-type bounds

For analytical purpose, it is often useful to have bounds in simple exponential form, even though they may not be the tightest bounds achievable. Letting ζ=a/b>0, one such bound for integer valued ν=n is given as[16][3]

e(b+a)2/2Qn(a,b)e(ba)2/2+ζ1n1π(1ζ)[e(ba)2/2e(b+a)2/2],ζ<1,
Qn(a,b)112[e(ab)2/2e(a+b)2/2],ζ>1.

When n=1, the bound simplifies to give

e(b+a)2/2Q1(a,b)e(ba)2/2,ζ<1,
112[e(ab)2/2e(a+b)2/2]Q1(a,b),ζ>1.

Another such bound obtained via Cauchy-Schwarz inequality is given as[3]

eb2/2Qn(a,b)122n12+ζ2(1n)2(1ζ2)[e(ba)2/2+e(b+a)2/2],ζ<1
Qn(a,b)112ζ2(1n)2(ζ21)[e(ba)2/2+e(b+a)2/2],ζ>1.

Chernoff-type bound

Chernoff-type bounds for the generalized Marcum Q-function, where ν=n is an integer, is given by[16][3]

(12λ)nexp(λb2+λna212λ){Qn(a,b),b2>n(a2+2)1Qn(a,b),b2<n(a2+2)

where the Chernoff parameter (0<λ<1/2) has optimum value λ0 of

λ0=12(1nb2nb21+(ab)2n).

Semi-linear approximation

The first-order Marcum-Q function can be semi-linearly approximated by [17]

Q1(a,b)={1,ifb<c1β0e12(a2+(β0)2)I0(aβ0)(bβ0)+Q1(a,β0),ifc1bc20,ifb>c2

where

β0=a+a2+22,
c1(a)=max(0,β0+Q1(a,β0)1β0e12(a2+(β0)2)I0(aβ0)),

and

c2(a)=β0+Q1(a,β0)β0e12(a2+(β0)2)I0(aβ0).

Equivalent forms for efficient computation

It is convenient to re-express the Marcum Q-function as[18]

PN(X,Y)=QN(2NX,2Y).

The PN(X,Y) can be interpreted as the detection probability of N incoherently integrated received signal samples of constant received signal-to-noise ratio, X, with a normalized detection threshold Y. In this equivalent form of Marcum Q-function, for given a and b, we have X=a2/2N and Y=b2/2. Many expressions exist that can represent PN(X,Y). However, the five most reliable, accurate, and efficient ones for numerical computation are given below. They are form one:[18]

PN(X,Y)=k=0eNX(NX)kk!m=0N1+keYYmm!,

form two:[18]

PN(X,Y)=m=0N1eYYmm!+m=NeYYmm!(1k=0mNeNX(NX)kk!),

form three:[18]

1PN(X,Y)=m=NeYYmm!k=0mNeNX(NX)kk!,

form four:[18]

1PN(X,Y)=k=0eNX(NX)kk!(1m=0N1+keYYmm!),

and form five:[18]

1PN(X,Y)=e(NX+Y)r=N(YNX)r/2Ir(2NXY).

Among these five form, the second form is the most robust.[18]

Applications

The generalized Marcum Q-function can be used to represent the cumulative distribution function (cdf) of many random variables:

  • If XErlang(k,λ) is a Erlang distribution with shape parameter k and rate parameter λ, then its cdf is given by FX(x)=1Qk(0,2λx)
  • If XGamma(α,β) is a gamma distribution with shape parameter α and rate parameter β, then its cdf is given by FX(x)=1Qα(0,2βx)
  • If XWeibull(k,λ) is a Weibull distribution with shape parameters k and scale parameter λ, then its cdf is given by FX(x)=1Q1(0,2(xλ)k2)
  • If XRayleigh(σ) is a Rayleigh distribution with parameter σ, then its cdf is given by FX(x)=1Q1(0,xσ)
  • If Xχk is a chi distribution with k degrees of freedom, then its cdf is given by FX(x)=1Qk/2(0,x)
  • If XNakagami(m,Ω) is a Nakagami distribution with m as shape parameter and Ω as spread parameter, then its cdf is given by FX(x)=1Qm(0,2mΩx)
  • If XRice(ν,σ) is a Rice distribution with parameters ν and σ, then its cdf is given by FX(x)=1Q1(νσ,xσ)
  • If Xχk(λ) is a non-central chi distribution with non-centrality parameter λ and k degrees of freedom, then its cdf is given by FX(x)=1Qk/2(λ,x)

Footnotes

  1. J.I. Marcum (1960). A statistical theory of target detection by pulsed radar: mathematical appendix, IRE Trans. Inform. Theory, vol. 6, 59-267.
  2. M.K. Simon and M.-S. Alouini (1998). A Unified Approach to the Performance of Digital Communication over Generalized Fading Channels, Proceedings of the IEEE, 86(9), 1860-1877.
  3. 3.0 3.1 3.2 3.3 3.4 A. Annamalai and C. Tellambura (2001). Cauchy-Schwarz bound on the generalized Marcum-Q function with applications, Wireless Communications and Mobile Computing, 1(2), 243-253.
  4. 4.0 4.1 4.2 4.3 A. Annamalai and C. Tellambura (2008). A Simple Exponential Integral Representation of the Generalized Marcum Q-Function QM(a,b) for Real-Order M with Applications. 2008 IEEE Military Communications Conference, San Diego, CA, USA
  5. 5.0 5.1 5.2 5.3 5.4 5.5 5.6 Y. Sun, A. Baricz, and S. Zhou (2010). On the Monotonicity, Log-Concavity, and Tight Bounds of the Generalized Marcum and Nuttall Q-Functions. IEEE Transactions on Information Theory, 56(3), 1166–1186, Template:ISSN
  6. 6.0 6.1 Y. Sun and A. Baricz (2008). Inequalities for the generalized Marcum Q-function. Applied Mathematics and Computation 203(2008) 134-141.
  7. 7.0 7.1 7.2 7.3 7.4 7.5 N.M. Temme (1993). Asymptotic and numerical aspects of the noncentral chi-square distribution. Computers Math. Applic., 25(5), 55-63.
  8. 8.0 8.1 8.2 8.3 8.4 8.5 A. Annamalai, C. Tellambura and John Matyjas (2009). "A New Twist on the Generalized Marcum Q-Function QM(ab) with Fractional-Order M and its Applications". 2009 6th IEEE Consumer Communications and Networking Conference, 1–5, Template:ISBN
  9. 9.0 9.1 S. Andras, A. Baricz, and Y. Sun (2011) The Generalized Marcum Q-function: An Orthogonal Polynomial Approach. Acta Univ. Sapientiae Mathematica, 3(1), 60-76.
  10. 10.0 10.1 10.2 10.3 10.4 10.5 10.6 Y.A. Brychkov (2012). On some properties of the Marcum Q function. Integral Transforms and Special Functions 23(3), 177-182.
  11. M. Abramowitz and I.A. Stegun (1972). Formula 10.2.12, Modified Spherical Bessel Functions, Handbook of Mathematical functions, p. 443
  12. W.K. Pratt (1968). Partial Differentials of Marcum's Q Function. Proceedings of the IEEE, 56(7), 1220-1221.
  13. R. Esposito (1968). Comment on Partial Differentials of Marcum's Q Function. Proceedings of the IEEE, 56(12), 2195-2195.
  14. V.M. Kapinas, S.K. Mihos, G.K. Karagiannidis (2009). On the Monotonicity of the Generalized Marcum and Nuttal Q-Functions. IEEE Transactions on Information Theory, 55(8), 3701-3710.
  15. 15.0 15.1 R. Li, P.Y. Kam, and H. Fu (2010). New Representations and Bounds for the Generalized Marcum Q-Function via a Geometric Approach, and an Application. IEEE Trans. Commun., 58(1), 157-169.
  16. 16.0 16.1 M.K. Simon and M.-S. Alouini (2000). Exponential-Type Bounds on the Generalized Marcum Q-Function with Application to Error Probability Analysis over Fading Channels. IEEE Trans. Commun. 48(3), 359-366.
  17. H. Guo, B. Makki, M. -S. Alouini and T. Svensson, "A Semi-Linear Approximation of the First-Order Marcum Q-Function With Application to Predictor Antenna Systems," in IEEE Open Journal of the Communications Society, vol. 2, pp. 273-286, 2021, doi: 10.1109/OJCOMS.2021.3056393.
  18. 18.0 18.1 18.2 18.3 18.4 18.5 18.6 D.A. Shnidman (1989). The Calculation of the Probability of Detection and the Generalized Marcum Q-Function. IEEE Transactions on Information Theory, 35(2), 389-400.

References

  • Marcum, J. I. (1950) "Table of Q Functions". U.S. Air Force RAND Research Memorandum M-339. Santa Monica, CA: Rand Corporation, Jan. 1, 1950.
  • Nuttall, Albert H. (1975): Some Integrals Involving the QM Function, IEEE Transactions on Information Theory, 21(1), 95–96, Template:ISSN
  • Shnidman, David A. (1989): The Calculation of the Probability of Detection and the Generalized Marcum Q-Function, IEEE Transactions on Information Theory, 35(2), 389-400.
  • Weisstein, Eric W. Marcum Q-Function. From MathWorld—A Wolfram Web Resource. [1]