An official website of the United States government
Here's how you know
Official websites use .gov
A
.gov website belongs to an official
government organization in the United States.
Secure .gov websites use HTTPS
A lock (
) or https:// means you've safely
connected to the .gov website. Share sensitive
information only on official, secure websites.
As a library, NLM provides access to scientific literature. Inclusion in an NLM database does not imply endorsement of, or agreement with,
the contents by NLM or the National Institutes of Health.
Learn more:
PMC Disclaimer
|
PMC Copyright Notice
Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (http://creativecommons.org/licenses/by/4.0/).
Closed-form expressions for the expected logarithm and for arbitrary negative integer moments of a noncentral -distributed random variable are presented in the cases of both even and odd degrees of freedom. Moreover, some basic properties of these expectations are derived and tight upper and lower bounds on them are proposed.
The noncentral distribution is a family of probability distributions of wide interest. They appear in situations where one or several independent Gaussian random variables (RVs) of equal variance (but potentially different means) are squared and summed together. The noncentral distribution contains as special cases among others the central distribution, the exponential distribution (which is equivalent to a squared Rayleigh distribution), and the squared Rice distribution.
In this paper, we present closed-form expressions for the expected logarithm and for arbitrary negative integer moments of a noncentral -distributed RV with even or odd degrees of freedom. Note that while the probability density function (PDF), the moment-generating function (MGF), and the moments of a noncentral -distributed RV are well-known, the expected logarithm and the negative integer moments have only been derived relatively recently for even degrees of freedom [1,2,3,4,5,6], but—to the best of our knowledge—for odd degrees of freedom they have been completely unknown so far. These expectations have many interesting applications. So, for example, in the field of information theory, there is a close relationship between the expected logarithm and entropy, and thus the expected logarithm of a noncentral -distributed RV plays an important role, e.g., in the description of the capacity of multiple-input, multiple-output noncoherent fading channels [1,2]. Many more examples in the field of information theory can be found in [7].
We will see that the expected logarithm and the negative integer moments can be expressed using two families of functions and that will be defined in Section 3. Not unexpectedly, and are not elementary, but contain special functions like the exponential integral function ([8], Sec. 8.21), the imaginary error function [9], or a generalized hypergeometric function ([8], Sec. 9.14). While numerically this does not pose any problem as the required special functions are commonly implemented in many mathematical programming environments, working with them analytically can be cumbersome. We thus investigate and more in detail, present important properties, and derive tight elementary upper and lower bounds to them.
The structure of this paper is as follows. After a few comments about our notation, we will formally define the noncentral distribution in the following Section 2 and also state some fundamental properties of the expected logarithm and the negative integer moments. In Section 3 we present the two families of functions and that are needed for our main results in Section 4. Section 5 summarizes properties of and , and Section 6 presents tight upper and lower bounds on them. Many proofs are deferred to the appendices.
We use upper-case letters to denote random quantities, e.g., U, and the corresponding lower-case letter for their realization, e.g., u. The expectation operator is denoted by ; is the natural logarithm; denotes the Gamma function ([8], Sec. 8.31–8.33); and is the imaginary number . We use to denote the set of all even natural numbers:
(1)
Accordingly, is the set of all odd natural numbers.
For a function , denotes its derivative:
(2)
The real Gaussian distribution of mean and variance is denoted by , while describes the complex Gaussian distribution of mean and variance . Thus, if and are independent standard Gaussian RVs, , , then
(3)
is circularly symmetric complex Gaussian, .
2. The Noncentral Distribution
Definition1.
For some , let be independent and identically distributed (IID) real, standard Gaussian RVs, , let be real constants, and define
(4)
Then the nonnegative RV
(5)
is said to have a noncentral distribution with n degrees of freedom and noncentrality parameter . Note that the distribution of U depends on the constants only via the sum of their squares (4). The corresponding PDF is ([10], Ch. 29)
(6)
where denotes the modified Bessel function of the first kind of order ([8], Eq. 8.445):
(7)
For we obtain the central distribution, for which the PDF (6) simplifies to
(8)
Note that in this work any RV U will always be defined as given in (5). Sometimes we will write to clarify the degrees of freedom n and the noncentrality parameter of U.
If the number of degrees of freedom n is even (i.e., if for some natural number m), there exists a second, slightly different definition of the noncentral distribution that is based on complex Gaussian random variables.
Definition2.
For some , let be IID , let be complex constants, and define
(9)
Then the nonnegative RV
(10)
is said to have a noncentral distribution with degrees of freedom and noncentrality parameter . It has a PDF
(11)
which in the central case of simplifies to
(12)
Note that in this work any RV V will always be defined as given in (10). Sometimes we will write to clarify the degrees of freedom and the noncentrality parameter of V.
Lemma1.
Let be an even natural number and a nonnegative constant. Then
(13)
where “” denotes equality in probability law.
Proof.
Let be IID and as given in Definition 1. Define and for all ,
(14)
(15)
Then
(16)
(17)
(18)
and
(19)
(20)
(21)
(22)
(23)
□
Proposition1
(Existence of Negative Integer Moments).For , the negative moment of a noncentral -distributed RV of degrees of freedom and noncentrality parameter ,
For the special case of the central
distribution (i.e., the case when ), it is straightforward to compute the expected logarithm and the negative integer moments by evaluating the corresponding integrals.
Proposition5
(Expected Logarithm and Negative Integer Moments for Central Distribution).For any , we have
(31)
(32)
where denotes the digamma function ([8], Sec. 8.36) (see also (37) and (51) below).
Moreover, for any ,
(33)
(34)
Proof.
These results follow directly by evaluating the corresponding integrals using the PDF (8) and (12), respectively. See also (A2) in Appendix A.1 and (A46) in Appendix B. □
3. Two Families of Functions
3.1. The Family of Functions
The following family of functions will be essential for the expected logarithm and the negative integer moments of a noncentral -distributed RV of even degrees of freedom.
Definition3.
([1,2]) For an arbitrary , we define the function ,
(35)
Here, denotes the exponential integral function ([8], Sec. 8.21)
(36)
and is the digamma function ([8], Sec. 8.36) that for natural values takes the form
(37)
with being Euler’s constant.
Note that in spite of the case distinction in its definition, actually is continuous for all . In particular,
(38)
for all . This will follow from Proposition 3 once we have shown the connection between and the expected logarithm (see Theorem 1).
Therefore, its first derivative is defined for all and can be evaluated to
(39)
Using the following expression for the incomplete Gamma function [11]
Note that also is continuous and that in particular
(42)
This can be checked directly using the series expansion of the exponential function to write
(43)
(44)
and plug in, or it follows from (63a) in Theorem 3, which shows that can be written as a difference of two continuous functions.
Figure 1 and Figure 2 depict and , respectively, for various values of m.
Note that the derivative of can be expressed as a finite sum of or of , see Corollary 2 in Section 5.
3.2. The Family of Functions
The following family of functions will be essential for the expected logarithm and the negative integer moments of a noncentral -distributed RV of odd degrees of freedom.
Definition4.
For an arbitrary odd , we define the function ,
(45)
Here denotes Euler’s constant, is the digamma function ([8], Sec. 8.36), is a generalized hypergeometric function ([8], Sec. 9.14)
The first derivative of is defined for all and can be evaluated to
(52)
Note that also is continuous and that in particular
(53)
for all . Checking this directly is rather cumbersome. It is easier to deduce this from (76a) in Theorem 5, which shows that can be written as a difference of two continuous functions.
Figure 1 and Figure 2 depict and , respectively, for various values of n.
Note that the derivative of can be expressed as a finite sum of or of , see Corollary 6 in Section 5.
4. Expected Logarithm and Negative Integer Moments
We are now ready for our main results. We will show how the functions and from Section 3 are connected to the expected logarithm and the negative integer moments of noncentral -distributed random variables.
Theorem1
(Expected Logarithm).For some and , let be as in Definition 1. Then
(54)
Similarly, for some and , let be as in Definition 2. Then
(55)
Theorem2
(Negative Integer Moments).For some and , let be as in Definition 1. Then, for any ,
(56)
Similarly, for some and , let be as in Definition 2. Then, for any ,
(57)
In particular, this means that for any ,
(58)
and for any ,
(59)
A proof for these two main theorems can be found in Appendix B.
5. Properties
We next investigate the two families of functions and more closely and state some useful properties.
5.1. Properties of
Proposition6.
For any , the function is monotonically strictly increasing and strictly concave ().
Proof.
Using the expression (A104), we have
(60)
(61)
i.e., the first derivative of is positive and the second derivative is negative. □
Proposition7.
For any , the function is monotonically strictly increasing ().
Proof.
This follows directly from Theorem 1 and Proposition 2. □
Proposition8.
For any , the function is positive, monotonically strictly decreasing, and strictly convex ().
Proof.
The positivity and the monotonicity follow directly from (60) and (61). To see the convexity, use (A104) to write
(62)
which is positive. □
Proposition9.
For any , the function is monotonically strictly decreasing ().
Proof.
This follows directly from Theorem 2 and Proposition 2. □
Theorem3.
For all , , and , we have the following relations:
The relations (85) and (86) follow from (54) and Proposition 2; and (87) and (88) follow from (58) and Proposition 2. See also Figure 1 and Figure 2 for a graphical representation of this relationship. □
Lemma2.
For any , the function is monotonically strictly decreasing and convex. Similarly, for any , the function is monotonically strictly decreasing and convex.
Proof.
Since
(89)
and because (by Proposition 8) , we conclude that is monotonically strictly decreasing.
To check convexity, we use Theorem 3 to rewrite (89) as
(90)
such that
(91)
(92)
(93)
(94)
(95)
Here, in the second equality we use Theorems 3 and 4; and the inequality follows from the lower bound (105) in Theorem 8 below. (Note that while the derivation of the bounds in Section 6 do strongly rely on the properties derived in Section 5, the results of this Lemma 2 are not needed there.)
The derivation for is completely analogous. In particular, using Theorems 5 and 6 one shows that
(96)
(97)
(98)
where the inequality follows from (117) in Theorem 10 below. □
6. Bounds
Finally, we derive some elementary upper and lower bounds on and and their first derivative.
Note that the lower bound (105) is exact for and asymptotically when . The upper bound (106) is tighter for small values of and is exact for , while (107) is better for larger values of and is exact asymptotically when . Concretely, we have
(108)
and
(109)
In general, also here it holds that the tightness of the bounds increases with increasing m.
The bounds of Theorem 8 are depicted in Figure 5 for the cases of , , and .
Note that the lower bound (117) is exact for and asymptotically when . The upper bound (118) is tighter for small values of and is exact for , while (119) is better for larger values of and is exact asymptotically when . Concretely, we have
(120)
or
(121)
respectively, and
(122)
In the special case , the improved version of (119b) is exact also for , but it is still less tight for low than (118).
In general, also here it holds that the tightness of the bounds increases with increasing n.
These bounds are depicted in Figure 8 and Figure 9 for the cases , , and .
7. Discussion
We have shown that the expected logarithm and the negative integer moments of a noncentral -distributed RV can be expressed with the help of two families of functions and , depending on whether the degrees of freedom are even or odd. While these two families of functions are very similar in many respects, they are actually surprisingly different in their description. The case of odd degrees of freedom thereby turns out to be quite a bit more complicated than the situation of even degrees of freedom (which explains why was defined in [1] already, while is newly introduced in this work).
We have also provided a whole new set of properties of both family of functions and derived new tight upper and lower bounds that are solely based on elementary functions.
It is intuitively pleasing that —being proportional to the derivative of —has an expectation that is related to the derivative of the function describing the expectation of the logarithm.
The recently proposed trick of representing the logarithm by an integral [7] turned out to be very helpful in the proof of the continuity of the expected logarithm (see Appendix A.3). While in general very well behaved, the logarithmic function nevertheless is a fickle beast due to its unboundedness both at zero and infinity.
Acknowledgments
I would like to express a big thank you for the accurate and very helpful comments of the two anonymous reviewers.
We first look at the case . Using the PDF (8), we compute
(A1)
(A2)
where (A2) follows from ([8], Eq. 3.381-4) as long as
(A3)
On the other hand, if , then (A1) can be bounded as follows:
(A4)
(A5)
where the first inequality holds because all terms in the integral are positive; where in the second inequality we have bounded
(A6)
and where the integral is infinite because from it follows that
(A7)
Next, assume that . Using the PDF (6) we write the negative moment as an integral and make a change of integration variable :
(A8)
(A9)
(A10)
(A11)
where in (A10) we have relied on the series representation (7) of the modified Bessel function.
Now, if we again assume that , we can use ([8], Eq. 3.381-4) to evaluate the integral and obtain
(A12)
(A13)
Using and noting that because we must have , we bound
(A14)
(A15)
Thus, using the series expansion of the exponential function, we obtain from (A13),
(A16)
(A17)
(A18)
On the other hand, if , we bound (A10) by reducing the integral boundaries and by dropping all terms in the sum apart from :
(A19)
(A20)
where the second inequality follows because
(A21)
and where the integral is infinite because (A7) holds. This concludes the proof of Proposition 1.
Appendix A.2. Proof of Proposition 2
We fix some , two arbitrary natural numbers such that , and some such that . We choose , , and let be IID . Then
(A22)
(A23)
(A24)
(A25)
where the first equality follows from (5); the subsequent equality from splitting the sum into two parts; the subsequent inequality from the monotonicity of and from dropping some terms that with probability 1 are positive; and the final equality again from (5). This proves the (decreasing) monotonicity of the negative integer moment in n.
The derivation of the (increasing) monotonicity of the expected logarithm is identical apart from that we rely on the (increasing) monotonicity of the logarithm instead of the (decreasing) monotonicity of .
Appendix A.3. Proof of Proposition 3
To prove that is continuous in we need to show that we are allowed to swap the order of a limit on and the expectation. This could be done using the Monotone Convergence Theorem or the Dominated Convergence Theorem [13]. Unfortunately, neither can be applied directly because is not nonnegative and unbounded both above and below.
Instead we rely on a trick recently presented in [7] that allows us to write the expected logarithm with the help of the MGF:
(A26)
So, using the MGF of ,
(A27)
we have
(A28)
We use this to prove continuity as follows. Assume that for some arbitrary large, but finite constant . Then
(A29)
(A30)
(A31)
(A32)
It only remains to justify the swap of integration and limit in (A30). To that goal we rely on the Dominated Convergence Theorem applied to the function
(A33)
Note that if
(A34)
we have from
(A35)
(A36)
On the other hand, if
(A37)
we have
(A38)
(A39)
Thus, for all ,
(A40)
Since both functions in the maximum of are nonnegative for all , we can bound the maximum by the sum:
(A41)
(A42)
(A43)
and therefore
(A44)
where the finiteness of the integral is obvious once we realize that the integrand is finite for all , in particular,
(A45)
and that for , the integrand grows like . Thus, all conditions needed for the Dominated Convergence Theorem are satisfied and the swap in (A30) is proven.
Appendix B. Derivations of the Main Results (Theorems 1 and 2)
Appendix B.1. Odd Degrees of Freedom
Appendix B.1.1. Expected Logarithm
Let n be odd and assume first . Taking the PDF (8) and using ([8], Eq. 4.352-1), we obtain
(A46)
which proves the result for .
For , we need to evaluate the following integral:
(A47)
Expressing as the power series (7) we obtain:
(A48)
(A49)
(A50)
(A51)
(A52)
(A53)
Here the interchange of summation and integral in (A50) is valid because we show in Appendix E that the sum converges uniformly for all ; in (A51) we use the result from (A46) with replaced by ; (A52) follows from (51); and the last equality (A53) from the series expansion of the exponential function. We introduce the shorthand
(A54)
and define the function
(A55)
such that
(A56)
The proof will be concluded once we show that in fact .
To that goal, we compute the derivative of (A55) by interchanging the derivative and the infinite summation (which again is valid due to uniform convergence proven in Appendix E):
(A57)
(A58)
(A59)
(A60)
(A61)
(A62)
Here, in (A59) we shift k by in the first sum; and (A62) follows from the substitution .
Using the relation
(A63)
we thus obtain from (A62)
(A64)
(A65)
(A66)
We next swap the order of the sums in the term and shift the counter ℓ by j, i.e., :
(A67)
Now, the counters k and j cover the values shown by the black dots in Figure A1.
We investigate the missing “triangle” of red dots, where we reorder the double sum to have an inner sum going along the “diagonals” (see again Figure A1) and an outer sum counting the diagonals:
(A68)
(A69)
(A70)
(A71)
where in (A68) we set (in a diagonal the sum of k and j is constant!) and ; and (A70) follows from
(A72)
Thus, we can rewrite in (A67) as follows:
(A73)
and we therefore obtain from (A66)
(A74)
(A75)
(A76)
Here, in the last equality we used that , and (A75) can be shown as follows:
(A77)
(A78)
(A79)
(A80)
(A81)
where (A80) follows from the series expansion of the exponential function and (A81) from the series expansion of the imaginary error function [14].
It thus remains to integrate the expression (A76). We only attempt this for the case . Using the substitution , we obtain:
(A82)
(A83)
(A84)
(A85)
(A86)
where we used the indefinite integral of Dawson’s function [12]. From the fact that is continuous in and that the expected logarithm is continuous in (Proposition 3), and because the expected logarithm of a central -distributed RV of one degree of freedom is (see (A46)), it follows from (A56) that the integration constant c in (A86) is
(A87)
(One could also take (A55) and evaluate it for to see that .)
Comparing with now proves that for all , and thus (54) holds true for .
To prove for general , we first point out that by comparing (A76) with (52) we see that for all and all . The case follows trivially from (A61).
Next, we use the derivation shown in (A105)–(A108) applied to and to show that
(A88)
A recursive application of this relation now proves that for all odd ,
(A89)
(also compare with Corollary 7). Plugging (A86) and (A76) into this, and comparing with (45), proves and thus (54) for all odd n.
Appendix B.1.2. Negative Integer Moments
To prove the expression of the negative integer moments, fix some with . (Note that the result for follows directly from Proposition 1.) We directly focus on . We need to evaluate
(A90)
Again using the power series (7), we obtain:
(A91)
(A92)
(A93)
(A94)
Here, (A92) follows from ([8], Eq. 3.381-4), in (A93) we again use the shorthand (A54), and the last equality (A94) follows because .
Now recall from the equivalence of and from (A61) that
(A95)
Thus, the second derivative can be computed to be (uniform convergence of the summation in (A95) can be shown similarly to (A221)–(A228)):
(A96)
(A97)
(A98)
and, in general, the derivative is
(A99)
The claim (56) for now follows by comparing (A99) with (A94).
Appendix B.2. Even Degrees of Freedom
Note that all results regarding with follow directly from the corresponding result of using Lemma 1.
Appendix B.2.1. Expected Logarithm
The derivation of (55) has been published before in ([1], Lem. 10.1) and ([2], Lem. A.6) (see also [3]). It is similar to the derivation shown in Appendix B.1.1, but easier because in (A51) has an integer argument instead of integer plus . This leads to an expression corresponding to (A62) with only integers and thus to a much simpler version of (A63):
(A100)
containing only one term on the right. The change of variables is similar as shown in Figure A1, but again simpler because the sum over the red values in Figure A1 actually equals to zero. We omit further details.
Appendix B.2.2. Negative Integer Moments
The derivation of (57) is fully analogous to the derivation shown in Appendix B.1.2. We need to evaluate
(A101)
Using the power series (7) we obtain from ([8], Eq. 3.351-3) (using that )
(A102)
(A103)
Using the corresponding expression of the derivative of , which is derived similarly to (A98),
We start with . To prove (76a), we use (A55) to write
(A105)
(A106)
(A107)
(A108)
where the last equality follows from (A95).
To prove (76b), we use (A99) to write
(A109)
(A110)
(A111)
(A112)
The derivations for are fully analogous. In particular, we can use the equivalent of (A55), i.e.,
(A113)
to rewrite the corresponding version of (A105)–(A108). For the interested reader we show a different, slightly more cumbersome proof that directly relies on the definition of and in (35) and (39), respectively:
(A114)
(A115)
(A116)
(A117)
(A118)
(A119)
Here, the first equality follows from the definitions given in (35) and (39); in the subsequent equality we combine the second last term with the first sum and reorder the last summation by introducing a new counter-variable ; the subsequent three equalities follow from arithmetic rearrangements; and the final equality follows again from definition (35). This proves (63a).
To prove (63b), we use (A104) to write
(A120)
(A121)
(A122)
(A123)
Appendix C.2. Proof of Theorems 4 and 6
Using (60) we have
(A124)
(A125)
(A126)
(A127)
(A128)
(A129)
(A130)
Here, the first equality follows from (60); in the subsequent equality we use the series expansion of ; the subsequent two equalities follow from algebraic rearrangements; in the next equality we note that for the terms in the sum are equal to zero; the second last equality then follows from renumbering the terms; and the last equality follows again from (60). This proves (73).
The derivation of (83) is completely analogous, but where m is replaced by in most places and where we rely on (A61) instead of (60):
We start with the proof of Theorem 8, because the derivation of the bounds on depend strongly on the bounds on .
We start with the observation that (105) holds with equality for . Moreover, we notice that the bound is asymptotically tight, too:
(A137)
(A138)
(the first equality follows directly from (39)). Since additionally both functions and are monotonically strictly decreasing and strictly convex, they cannot cross. So, it suffices to find some for which (105) is satisfied. We pick and check:
(A139)
(A140)
(A141)
(A142)
(A143)
(A144)
(A145)
(A146)
Here, (A141) follows from the series expansion of the exponential function; in (A142) we split the sum into two sums over the even and odd values of j; (A143) holds because is even and is odd; and the inequality (A145) follows from dropping all terms in the sum (they are all positive!) apart from the first.
Next, we turn to (106). From Theorem 4 we have for any ,
(A147)
(A148)
(A149)
where the inequality follows from (105).
To derive (107), we first look at the case and consider the difference between the expression of the upper bound and :
(A150)
(A151)
(A152)
where the first equality follows from Theorem 4 and the subsequent inequality from the lower bound (105). For and , (107) holds trivially, so it remains to show the case and . This follows directly from (39):
(A153)
We next address the claims in Theorem 7.
The upper bound (101) has been proven before in ([15], App. B) and is based on Jensen’s inequality:
(A154)
(A155)
(A156)
The lower bound (99) follows from a slightly more complicated argument: Note that both and are monotonically strictly increasing and strictly concave functions (see Proposition 6). Hence, they can cross at most twice. Asymptotically as the two functions coincide, i.e., this corresponds to one of these “crossings.” (This can be seen directly from (A156).) So, they can only cross at most once more for finite . For , we have
(A157)
for all (where for we take ), see, e.g., ([16], Eq. (94)).
By contradiction, let us assume for the moment that there is another crossing at a finite value. At that value, the slope of is larger than the slope of . Since asymptotically the two function coincide again, there must exist some value such that for the slope of is strictly smaller than the slope of . We know from (107), however, that
(A158)
which leads to a contradiction. Thus, there cannot be another crossing and must be strictly smaller that for all .
The lower and upper bounds (100) and (102) rely on the fundamental theorem of calculus:
(A159)
(A160)
(A161)
(A162)
where the inequality follows from (105). Thus,
(A163)
(A164)
Similarly,
(A165)
(A166)
(A167)
where the inequality follows from (106).
Appendix D.2. Proof of Theorems 9 and 10
We start with the proof of Theorem 10, because the derivation of the bounds on depend strongly on the bounds on .
We start with the observation that (117) holds with equality for . Moreover, we notice that the bound is asymptotically tight, too:
(A168)
(A169)
(the first equality follows directly from (52)). Since additionally both functions and are monotonically strictly decreasing and strictly convex, they cannot cross. So, it suffices to find some for which (117) is satisfied. We pick and check:
(A170)
(A171)
(A172)
(A173)
(A174)
(A175)
(A176)
(A177)
(A178)
(A179)
Here, (A171) follows from the series expansion of Dawson’s function [12]
(A180)
and from a substitution ; in (A174) we split the sum into two sums over the even and odd values of k; in (A175) we combine the terms using the relation ; the inequality (A176) follows from dropping all terms in the sum (they are all positive!) apart from the first; and (A178) follows again from .
Next we turn to (118). From Theorem 6 we have for any ,
(A181)
(A182)
(A183)
where the inequality follows from (117).
To derive (119a), we consider the difference between the expression of the upper bound and :
(A184)
(A185)
(A186)
where the first equality follows from Theorem 6 (with ) and the subsequent inequality from the lower bound (117). For a derivation of (119b), we start with (A61):
(A187)
(A188)
(A189)
(A190)
(A191)
(A192)
(A193)
(A194)
Here, the inequality holds because ; and in (A193) we again rely on the series expansion of the exponential function. The weaker version of (119b) follows directly from this because . This finishes the proof of Theorem 10.
We next address the claims in Theorem 9.
The upper bound (112) is based on Jensen’s inequality:
(A195)
(A196)
(A197)
Thus,
(A198)
The lower bound (110a) follows from a slightly more complicated argument. Note that for , both and are monotonically strictly increasing and strictly concave functions (see Proposition 10). Hence, they can cross at most twice. Asymptotically as the two functions coincide (this can be seen directly from (A198)), i.e., this corresponds to one of these “crossings.” So, they can only cross at most once more for finite . For , we have
(A199)
for all , see, e.g., ([16], Eq. (94)). By contradiction, let us assume for the moment that there is another crossing at a finite value. At that value, the slope of is larger than the slope of . Since asymptotically the two function coincide again, there must exist some value such that for the slope of is strictly smaller than the slope of . We know from (199a), however, that
(A200)
which leads to a contradiction. Thus, there cannot be another crossing and must be strictly smaller that for all and .
To derive the lower bound (110b), we use (76a) in Theorem 5 and apply (110a) and (119b):
(A201)
(A202)
The upper and lower bounds (111) and (113) rely on the fundamental theorem of calculus:
(A203)
(A204)
(A205)
(A206)
where the inequality follows from (117). Thus,
(A207)
(A208)
Similarly,
(A209)
(A210)
(A211)
where the inequality follows from (118).
Appendix E. Uniform Convergence
In the following we will prove uniform convergence using Weierstrass’ -test ([13], Sec. 8.11): An infinite sum converges uniformly for all , if we can find constants that do not depend on x, that satisfy
(A212)
and whose sum converges:
(A213)
The condition (A213) can be confirmed by d’Alembert’s ratio test [17]: if
(A214)
then the sum in (A213) indeed converges.
Appendix E.1. Uniform Convergence of (A49)
We assume and note that has its maximum for . Thus,
(A215)
(A216)
Next, we verify that
(A217)
(A218)
(A219)
because
(A220)
Thus, we see that Weierstrass’ -test is satisfied and that thus (A49) is uniformly converging for all .
Appendix E.2. Uniform Convergence of (A55)
We note that for any :
(A221)
(A222)
(A223)
(A224)
(A225)
(A226)
Since
(A227)
(A228)
we see that Weierstrass’ -test is satisfied and that thus (A55) is uniformly converging for all finite .
Funding
This work was started while the author stayed at NCTU and was at that time supported by the Industrial Technology Research Institute (ITRI), Zhudong, Taiwan, under JRC NCTU-ITRI and by the National Science Council under NSC 95-2221-E-009-046.
Conflicts of Interest
The author declares no conflict of interest.
References
1.Lapidoth A., Moser S.M. Capacity Bounds via Duality with Applications to Multiple-Antenna Systems on Flat Fading Channels. IEEE Trans. Inf. Theory. 2003;49-10:2426–2467. doi: 10.1109/TIT.2003.817449. [DOI] [Google Scholar]
2.Moser S.M. Ph.D. Thesis. ETH Zürich; Zürich, Switzerland: 2004. Duality-Based Bounds on Channel Capacity. Diss. ETH No. 15769. [Google Scholar]
3.Lapidoth A., Moser S.M. The Expected Logarithm of a Noncentral Chi-Square Random Variable. [(accessed on 17 September 2020)]; Available online: https://moser-isi.ethz.ch/explog.html.
4.Moser S.M. Some Expectations of a Non-Central Chi-Square Distribution With an Even Number of Degrees of Freedom; Proceedings of the IEEE International Region 10 Conference (TENCON); Taipei, Taiwan. 31 October–2 November 2007. [Google Scholar]
5.Moser S.M. Expectations of a Noncentral Chi-Square Distribution With Application to IID MIMO Gaussian Fading; Proceedings of the IEEE International Symposium on Information Theory and Its Applications; Auckland, New Zealand. 7–10 December 2008; pp. 495–500. [Google Scholar]
6.Lozano A., Tulino A.M., Verdú S. High-SNR Power Offset in Multiantenna Communication. IEEE Trans. Inf. Theory. 2005;51-12:4134–4151. doi: 10.1109/TIT.2005.858937. [DOI] [Google Scholar]
7.Merhav N., Sason I. An Integral Representation of the Logarithmic Function with Applications in Information Theory. Entropy. 2020;22:51. doi: 10.3390/e22010051. [DOI] [PMC free article] [PubMed] [Google Scholar]
8.Gradshteyn I.S., Ryzhik I.M. In: Table of Integrals, Series, and Products. 7th ed. Jeffrey A., Zwillinger D., editors. Academic Press; San Diego, CA, USA: 2007. [Google Scholar]