Some Expectations of a Non-Central Chi-Square Distribution With an Even Number of Degrees of Freedom
|
|
- Homer Owens
- 6 years ago
- Views:
Transcription
1 Some Expectations of a Non-Central Chi-Square Distribution With an Even Number of Degrees of Freedom Stefan M. Moser April 7, 007 Abstract The non-central chi-square distribution plays an important role in communications, for example in the analysis of mobile and wireless communication systems. It not only includes the important cases of a squared Rayleigh distribution and a squared Rice distribution, but also the generalizations to a sum of independent squared Gaussian random variables of identical variance with or without mean, i.e., a squared MIMO Rayleigh and squared MIMO Rice distribution. In this paper closed-form expressions are derived for the expectation of the logarithm and for the expectation of the n-th power of the reciprocal value of a non-central chi-square random variable. It is shown that these expectations can be expressed by a family of continuous functions g m ( ) and that these families have nice properties (monotonicity, convexity, etc.). Moreover, some tight upper and lower bounds are derived that are helpful in situations where the closed-form expression of g m ( ) is too complex for further analysis. Index Terms: Non-central chi-square distribution, Rayleigh, Rice, expected logarithm, expected reciprocal value. Introduction It is well known that adding several independent squared Gaussian random variables of identical variance yields a random variable that is non-central chi-square distributed. This distribution often shows up in information theory and communications. As an example we mention the situation of a non-coherent multiple-input multiple-output (MIMO) fading channel Y = Hx + Z () with an additive white Gaussian noise vector Z and with a fading matrix H that consists of independent and unit-variance Gaussian distributed components with or without mean. Here conditional on the input x the squared magnitude of the output Y is non-central chi-square distributed. The author is with the Department of Communication Engineering, National Chiao Tung University (NCTU), Hsinchu, Taiwan. This work was supported by the Industrial Technology Research Institute (ITRI), Zhudong, Taiwan, under JRC NCTU-ITRI and by the National Science Council under NSC 95--E Part of this work has been submitted to TENCON 007 in Taipei, Taiwan. Stefan M. Moser, April 7, 007, submitted
2 While the special case of a squared Rayleigh distribution is well understood in the sense that there exist closed-form expressions for more or less all interesting expected values, the more general situation of a non-central chi-square distribution is far more complex. Here, standard integration tools (e.g., Maple) or integration lookup tables (e.g., []) will very quickly cease to provide closed-form expressions. In this paper we will state closed-form expressions for some of these situations: we will give closed-form solutions to E[lnV ] and E [ ] V for a non-central chi-square n random variable V with an even number of degrees of freedom. Note that in practice we often have an even number of degrees of freedom because we usually consider complex Gaussian random variables consisting of two real Gaussian components. We will see that these expectations are all related to a family of functions g m ( ) that is defined in Definition in the following section. There we will also state the main results. In Section 3 we will then derive some properties of the functions g m ( ) and in Section 4 we will state tight upper and lower bounds. In Section 5 another property of g m ( ) is derived as an example of how the bounds from Section 4 could be applied. We conclude in Section 6. Definitions and Main Results A non-negative real random variable is said to have a non-central chi-square distribution with n degrees of freedom and non-centrality parameter s if it is distributed like n (X j + µ j ), () j= where {X j } n j= are IID N R (0, ) and the real constants {µ j } n j= satisfy s = n µ j. (3) j= (The distribution of () depends on the constants {µ j } only via the sum of their squares.) The probability density function of such a distribution is given by [3, Chapter 9] ( x ) n 4 s e s +x ( ) I n/ s x, x 0. (4) Here I ν ( ) denotes the modified Bessel function of the first kind of order ν R, i.e., I ν (x) ( x ) ν+k, x 0 (5) k! Γ(ν + k + ) (see [, Equation 8.445]). If the number of degrees of freedom n is even, i.e., if n = m for some positive integer m, then the non-central chi-square distribution can also be expressed as a sum of the squared norms of complex Gaussian random variables: Definition. Let the random variable V have a non-central chi-square distribution with an even number m of degrees of freedom, i.e., m V U j + µ j (6) A squared Rayleigh random variable is actually exponentially distributed. j= Stefan M. Moser, April 7, 007, submitted
3 where {U j } m j= are IID N C(0, ), and {µ j } m j= are complex constants. Let further the non-centrality parameter s be defined as s m µ j. (7) j= Next we define the following continuous functions: Definition. The functions g m ( ) are defined as follows: m ln() Ei( ) + ( ) [e j (j )! j= ] ( ) g m () (m )! j, > 0 j(m j)! ψ(m), = 0 (8) for m N, where Ei( ) denotes the exponential integral function defined as and ψ( ) is Euler s psi function given by e t Ei( x) dt, x > 0 (9) x t m ψ(m) γ + j j= (0) with γ denoting Euler s constant. lim 0 Note that g m () is continuous for all 0, i.e., in particular { m [ ln() Ei( ) + ( ) j e (m )! (j )! j(m j)! j= ]( ) } j = ψ(m) () for all m N. Therefore its first derivative is defined for all 0 and can be evaluated to g m() g m() = ( )m m Γ(m) e ( ) j m j () j! (see [4, Eq. (47)], [5, Eq. (A.39)]). Note that g m( ) is also continuous, i.e., in particular ( ) m m Γ(m) lim e ( ) j 0 m j j! = m = g m(0). (3) j=0 Now we give a closed-form expression for a first expectation of a non-central chi-square random variable: j=0 Stefan M. Moser, April 7, 007, submitted 3
4 Theorem 3. The expected value of the logarithm of a non-central chi-square random variable with an even number m of degrees of freedom is given as E[lnV ] = g m (s ), (4) where V and s are defined in (6) and (7). Hence, we have the solution to the following integral: for any m N and s 0. 0 ( v ) m lnv s e v s I m (s v)dv = g m (s ) (5) Proof. A proof can be found in [4, Lem. 0.], [5, Lem. A.6] Next we derive the following expectations: Theorem 4. Let n N with n < m. The expected value of the n-th power reciprocal value of a non-central chi-square random variable with an even number m of degrees of freedom is given as where [ ] E V n = ( )n (n!) g(n) m n (s ), m > n (6) g (l) m () = l g m () l (7) denotes the l-th derivative of g m ( ) and where V and s are defined in (6) and (7). In particular, for m > [ ] E = g V m (s ). (8) Hence, we have the solution to the following integral: 0 ( v ) m v n s e v s I m (s v)dv = ( )n (n!) g(n) m n (s ) (9) for any m, n N, m > n, and any real s 0. Note that in the cases where m n, the expectation is unbounded. Proof. A proof can be found in Appendix A. 3 Properties of g m ( ) and g m( ) In this section we will show that the family of functions g m ( ) and g m( ) are wellbehaved. Corollary 5. The functions g m ( ) are monotonically strictly increasing and strictly concave in the interval [0, ) for all m N. Stefan M. Moser, April 7, 007, submitted 4
5 Proof. From [4, Eqs. (45), (46)], [5, Eqs. (A.37), (A.38)] we know that g m() = g m() g m() = g m () = e k! = e k + m k, (0) k! (k + m)(k + m + ) k, () i.e., the first derivative of g m ( ) is positive and the second derivative is negative. Corollary 6. The function g m () is monotonically strictly increasing in m for all 0. Proof. Fix two arbitrary natural numbers m, m N such that m < m. Choose µ = s, µ =... = µ m = 0, with an arbitrary s 0. Let {U j } m j= be IID N C(0, ). Then m g m (s ) = E ln U j + µ j () j= m = E ln U j + µ j + j= m j=m + U j + µ j (3) m > E ln U j + µ j (4) j= = g m (s ), (5) where the first equality follows from (4); the subsequent equality from splitting the sum into two parts; the subsequent inequality from dropping some positive terms; and the final equality again from (4). Corollary 7. The functions g m( ) are positive, monotonically strictly decreasing, and strictly convex functions for all m N. Proof. The positivity and the monotonicity follow from (0) and (). To see the convexity, compute from () g m() = 3 g m () 3 = e which is positive. k! (k + m)(k + m + )(k + m + ) k (6) Corollary 8. The function g m() is monotonically strictly decreasing in m for all 0. Proof. Fix two arbitrary natural numbers m, m N such that m > m >. Choose µ = s, µ =... = µ m = 0, with an arbitrary s 0. Let {U j } m j= be IID Stefan M. Moser, April 7, 007, submitted 5
6 N C (0, ). Then [ ] g m (s ) = E m j= U j + µ j [ ] = E m j= U j + µ j + m j=m + U j + µ j [ ] < E m j= U j + µ j (7) (8) (9) = g m (s ), (30) where the first equality follows from (8); the subsequent equality from splitting the sum into two parts; the subsequent inequality from dropping some positive terms in the denominator; and the final equality again from (8). Theorem 9. We have the following relation: for all m N and all 0. Proof. A proof is given in Appendix B. Theorem 0. We have the following relation: for all m N and all 0. Proof. A proof is given in Appendix C. 4 Bounds on g m ( ) and g m( ) g m+ () = g m () + g m() (3) g m+() = m g m() (3) In this section we derive some tight bounds on the functions g m ( ) and g m( ). Theorem. The function g m( ) can be bounded as follows: { + m g m() min m + m( + m + ), + m }. (33) Note that for < m+ the first of the two upper bounds is tighter than second, while for > m + the second is tighter. Moreover, the first upper bound coincides with g m () for = 0, and the second upper bound is asymptotically tight when tends to infinity. Proof. A proof is given in Appendix D. The bounds (33) are depicted in Figure for the cases of m =, m = 3, and m = 8. Stefan M. Moser, April 7, 007, submitted 6
7 second upper bound (for > m + ) first upper bound (for < m + ) g m ( ) lower bound 0.8 g m() Figure : Upper and lower bounds on g m( ) according to Theorem. The top four curves correspond to m =, the middle four to m = 3, and the lowest group of four curves to m = gm() second upper bound first upper bound 0.5 upper bound (35) g m( ) lower bound (34) Figure : Upper and lower bounds on g m ( ) according to (34) and (35) in Theorem. The lowest curve corresponds to m = (in this case all bounds coincides with g ( )), the next five curves correspond to m = 3, and the top five to m = 8. Stefan M. Moser, April 7, 007, submitted 7
8 gm() upper bound g m( ) lower bound Figure 3: Upper and lower bounds on g m ( ) according to (36) in Theorem. The lowest three curves correspond to m =, the next three to m = 3, and the top three to m = 8. Theorem. For the functions g m ( ) we state two sets of bounds. The first set is tighter for smaller values of m: m g m () ln Ei( ) + + j, (34) j= m g m () ln Ei( ) + j= { min j + j( + j + ), + j Secondly, we give a set of bounds that is tight for large values of m: }. (35) ln( + m ) g m () ln( + m). (36) Note that this second set of bounds is very simple, i.e., it is particularly interesting for further analysis. Proof. A proof is given in Appendix E. The bounds (34) and (35) are depicted in Figure and the bounds (36) in Figure 3, both times for the cases of m =, m = 3, and m = 8. 5 Additional Properties As an example of how the properties given in Section 3 and the bounds given in Section 4 can be used to derive further results we state the following corollary: Stefan M. Moser, April 7, 007, submitted 8
9 ( ) Corollary 3. The functions g m are monotonically strictly decreasing and convex in for all m N. Proof. We start as follows: g m ( ) = g m ( ) = ( g m+ ( (37) ) ( )) g m, (38) where the last equality follows from Theorem 9. From ( ) Corollary 7 we know that g m( ) > 0, so that we can conclude from (37) that g m is monotonically strictly decreasing. To check convexity, we continue as follows: ( ) g m = ( ) 3g m+ + ( ) 4g m+ ( ) 3g m ( ) 4g m (39) ( ) ( ) = ( ) mg m g m 3g m + 4 (40) ( ) = g m m (4) m + m (4) = (m + ). (43) Here, in the second equality we use Theorems 9 and 0; and the inequality follows from the lower bound of Theorem. Hence, the second derivative is positive and the statement proved. 6 Conclusions We have derived closed-form expressions for some important expectations in the field of information theory and communications. We have shown that the resulting functions behave nicely and we have given tight upper and lower bounds to them. For brevity we will not include a detailed example of how these results can be used, but only mention that the derivation of the fading number of a non-coherent MIMO Gaussian fading channel [6] strongly depends on them. There are many more examples. A Proof of Theorem 4 Let n N be arbitrary and assume that m > n. Then the required expectation can be written as [ ] ( v ) m E V n = 0 v n s e v s I m (s v)dv. (44) Expressing I m ( ) as a power series (5) ( z ) m +k I m (z) = (45) k! Γ(m + k) Stefan M. Moser, April 7, 007, submitted 9
10 we obtain from [, Eq ] (using that m > n) [ ] E V n = s m e s = e s = e s k! Γ(m + k) sk+m 0 v k+m n e v dv (46) k! (m + k )! sk (k + m n)! (47) k! (k + m ) (k + m n) sk. (48) Generalizing (0), (), and (6) to the l-th derivative, we have g m (l) () = l g m () l = ( ) l e k! (l )! (k + m) (k + m + l ) k. (49) Comparing this with (48) we see that [ ] E V n = ( )n (n!) g(n) m n (s ). (50) B Proof of Theorem 9 Using (8) and () we get g m () + g m() m ( ) j = ln() Ei( ) + ( ) j e (j )! m j= j= ( ) j (m )! j(m j)! ( ) j + ( )m (m )! m e m ( ) i+m(m )! i m (5) i! i=0 m ( ) j = ln() Ei( ) + ( ) j e (j )! m j= j= ( ) j (m )! j(m j)! = ln() Ei( ) + m ( ) j m j= m ( ) j e (j )! j= ( ) j+m }{{} ( =( ) j ) j ( ) ( ) j (m )! j(m j)! + (m j)! j= }{{} j= = m j(m j)! (m )! (m j)! j (5) ( ) j ( ) ( ) m(m )! m (53) 0! m ( ) j = ln() Ei( ) + ( ) j e (j )! Stefan M. Moser, April 7, 007, submitted 0
11 m ( ) j m (m )! j(m j)! j= m = ln() Ei( ) + ( ) j e (j )! m j= j= ( ) j m! j(m j)! ( ) j ( ) m m! m 0! ( ) j ( ) m (54) ( ) j (55) = g m+ (). (56) Here, the first equality follows from the definitions given in (8) and (); 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 j = m i; the subsequent three equalities follows from arithmetic rearrangements; and the final equality follows again from definition (8). C Proof of Theorem 0 Using (0) we get m g m() = e e m e = e k! k e = e = e = e k= = e k! ( m k + m k! k + m k (57) k! m k + m k (58) ) k (59) k! k k + m k (60) (k )! k + m k (6) k! k + m + k (6) = g m+(). (63) Here, the first equality follows from (0); in the subsequent equality we use the series expansion of e which is valid for all 0; the subsequent two equalities follow from algebraic rearrangements; in the next equality we note that for k = 0 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 (0). D Proof of Theorem We start with the lower bound and note that for = 0 the bound is tight: g m(0) = g m+ (0) g m (0) = ψ(m + ) ψ(m) = m (64) Stefan M. Moser, April 7, 007, submitted
12 where the first equality follows from Theorem 9, the second from (8) and the final from (0); and + m = =0 m. (65) Moreover we notice that the bound is asymptotically tight, too: lim g m() = 0; (66) = 0. + m (67) lim Hence, since additionally both functions g m( ) and +m are monotonically strictly decreasing and strictly convex, they cannot cross. Moreover, it is shown in Theorem that g m () ln( + m), so that we must have g m() ln( + m) = + m. (68) Next we turn to the first upper bound which will follow from the lower bound (33) derived above together with Theorem 0: g m () = g m() m +m m = m (m )( + m). (69) To derive the second upper bound we use once again Theorem 0 and the lower bound (33) derived above: + m g m() = + m + m g m () (70) + m + m + m (7) = 0, (7) where the first equality follows from Theorem 0 and the inequality from the lower bound in (33). E Proof of Theorem The first set of bounds (34) and (35) follow directly from Theorems 9 and and from the fact that g () = ln Ei( ). (73) The upper bound in the second set of bounds (36) has been proven before in [7, App. B]. The proof is based on Jensen s inequality. The lower bound in (36) follows from a slightly more complicated argument: Note that both g m ( ) and ln( + m ) are monotonically strictly increasing and strictly concave (see Corollary 5). Hence, they can cross at most twice. Now asymptotically as the two functions coincide which corresponds to one of these crossings. So they can only cross at most once more for finite. For = 0, we have g m (0) = ψ(m) > ln(m ) (74) Note that this part of the proof of Theorem does not rely in any way on the theorem under consideration. Stefan M. Moser, April 7, 007, submitted
13 for all m N (where for m = we take ln0 = ). Let s assume for the moment that there is another crossing for a finite value 0. Then, for > 0, ln( + m ) is strictly larger than g m (). However, since asymptotically they will coincide, the slope of ln( + m ) must then be strictly smaller than the slope of g m ( ). But we know from Theorem that ln( + m ) = + m g m(). (75) This is a contradiction which leads to the conclusion that there cannot be another crossing and ln( + m ) must be a strict lower bound to g m ( ). Acknowledgment This work was supported by the Industrial Technology Research Institute (ITRI), Zhudong, Taiwan, under JRC NCTU-ITRI and by the National Science Council under NSC 95--E References [] A. Lapidoth and S. M. Moser, The expected logarithm of a non-central chi-square random variable, website. [Online]. Available: [] I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series, and Products, 5th ed., A. Jeffrey, Ed. Academic Press, San Diego, 996. [3] N. L. Johnson, S. Kotz, and N. Balakrishnan, Continuous Univariate Distributions, nd ed. John Wiley & Sons, 995, vol.. [4] A. Lapidoth and S. M. Moser, Capacity bounds via duality with applications to multiple-antenna systems on flat fading channels, IEEE Transactions on Information Theory, vol. 49, no. 0, pp , October 003. [5] S. M. Moser, Duality-based bounds on channel capacity, Ph.D. dissertation, Swiss Federal Institute of Technology, Zurich, October 004, Diss. ETH No [Online]. Available: [6], Fading number and degrees of freedom, March 007, in preparation. [7], The fading number of memoryless multiple-input multipleoutput fading channels, July 007, to appear in IEEE Transactions on Information Theory, vol. 53, no. 7. [Online]. Available: Stefan M. Moser, April 7, 007, submitted 3
The Fading Number of a Multiple-Access Rician Fading Channel
The Fading Number of a Multiple-Access Rician Fading Channel Intermediate Report of NSC Project Capacity Analysis of Various Multiple-Antenna Multiple-Users Communication Channels with Joint Estimation
More informationCapacity Analysis of Multiple-Access OFDM Channels
Capacity Analysis of Multiple-Access OFDM Channels Final Report of Project TW4G Wireless Access Technology Contract-Number: G-9600 Project Duration: January 2007 3 December 2007 Funded by: Industrial Technology
More informationOn the Capacity of Free-Space Optical Intensity Channels
On the Capacity of Free-Space Optical Intensity Channels Amos Lapidoth TH Zurich Zurich, Switzerl mail: lapidoth@isi.ee.ethz.ch Stefan M. Moser National Chiao Tung University NCTU Hsinchu, Taiwan mail:
More informationWE consider a memoryless discrete-time channel whose
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 1, JANUARY 2009 303 On the Capacity of the Discrete-Time Poisson Channel Amos Lapidoth, Fellow, IEEE, and Stefan M. Moser, Member, IEEE Abstract The
More informationWE study the capacity of peak-power limited, single-antenna,
1158 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 3, MARCH 2010 Gaussian Fading Is the Worst Fading Tobias Koch, Member, IEEE, and Amos Lapidoth, Fellow, IEEE Abstract The capacity of peak-power
More informationarxiv: v1 [math.st] 26 Jun 2011
The Shape of the Noncentral χ 2 Density arxiv:1106.5241v1 [math.st] 26 Jun 2011 Yaming Yu Department of Statistics University of California Irvine, CA 92697, USA yamingy@uci.edu Abstract A noncentral χ
More informationTight Lower Bounds on the Ergodic Capacity of Rayleigh Fading MIMO Channels
Tight Lower Bounds on the Ergodic Capacity of Rayleigh Fading MIMO Channels Özgür Oyman ), Rohit U. Nabar ), Helmut Bölcskei 2), and Arogyaswami J. Paulraj ) ) Information Systems Laboratory, Stanford
More informationK distribution: an appropriate substitute for Rayleigh-lognormal. distribution in fading-shadowing wireless channels
K distribution: an appropriate substitute for Rayleigh-lognormal distribution in fading-shadowing wireless channels A. Abdi and M. Kaveh Indexing terms: Rayleigh-lognormal distribution, K distribution,
More informationUSING multiple antennas has been shown to increase the
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 1, JANUARY 2007 11 A Comparison of Time-Sharing, DPC, and Beamforming for MIMO Broadcast Channels With Many Users Masoud Sharif, Member, IEEE, and Babak
More informationTitle. Author(s)Tsai, Shang-Ho. Issue Date Doc URL. Type. Note. File Information. Equal Gain Beamforming in Rayleigh Fading Channels
Title Equal Gain Beamforming in Rayleigh Fading Channels Author(s)Tsai, Shang-Ho Proceedings : APSIPA ASC 29 : Asia-Pacific Signal Citationand Conference: 688-691 Issue Date 29-1-4 Doc URL http://hdl.handle.net/2115/39789
More informationNearest Neighbor Decoding in MIMO Block-Fading Channels With Imperfect CSIR
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 3, MARCH 2012 1483 Nearest Neighbor Decoding in MIMO Block-Fading Channels With Imperfect CSIR A. Taufiq Asyhari, Student Member, IEEE, Albert Guillén
More informationMA 137 Calculus 1 with Life Science Applications Monotonicity and Concavity (Section 5.2) Extrema, Inflection Points, and Graphing (Section 5.
MA 137 Calculus 1 with Life Science Applications Monotonicity and Concavity (Section 52) Extrema, Inflection Points, and Graphing (Section 53) Alberto Corso albertocorso@ukyedu Department of Mathematics
More informationComparison of DPSK and MSK bit error rates for K and Rayleigh-lognormal fading distributions
Comparison of DPSK and MSK bit error rates for K and Rayleigh-lognormal fading distributions Ali Abdi and Mostafa Kaveh ABSTRACT The composite Rayleigh-lognormal distribution is mathematically intractable
More informationThe Additive Inverse Gaussian Noise Channel: an Attempt on Modeling Molecular Communication
National Chiao Tung University Taiwan Dept. of Electrical and Computer Engineering 2013 IEEE Taiwan/Hong Kong Joint Workshop on Information Theory and Communications The Additive Inverse Gaussian Noise
More informationProducts and Ratios of Two Gaussian Class Correlated Weibull Random Variables
Products and Ratios of Two Gaussian Class Correlated Weibull Random Variables Petros S. Bithas, Nikos C. Sagias 2, Theodoros A. Tsiftsis 3, and George K. Karagiannidis 3 Electrical and Computer Engineering
More informationarxiv: v4 [cs.it] 17 Oct 2015
Upper Bounds on the Relative Entropy and Rényi Divergence as a Function of Total Variation Distance for Finite Alphabets Igal Sason Department of Electrical Engineering Technion Israel Institute of Technology
More informationConvex Functions. Wing-Kin (Ken) Ma The Chinese University of Hong Kong (CUHK)
Convex Functions Wing-Kin (Ken) Ma The Chinese University of Hong Kong (CUHK) Course on Convex Optimization for Wireless Comm. and Signal Proc. Jointly taught by Daniel P. Palomar and Wing-Kin (Ken) Ma
More informationOn the Duality between Multiple-Access Codes and Computation Codes
On the Duality between Multiple-Access Codes and Computation Codes Jingge Zhu University of California, Berkeley jingge.zhu@berkeley.edu Sung Hoon Lim KIOST shlim@kiost.ac.kr Michael Gastpar EPFL michael.gastpar@epfl.ch
More informationOn the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method
On the Entropy of Sums of Bernoulli Random Variables via the Chen-Stein Method Igal Sason Department of Electrical Engineering Technion - Israel Institute of Technology Haifa 32000, Israel ETH, Zurich,
More informationStatic Problem Set 2 Solutions
Static Problem Set Solutions Jonathan Kreamer July, 0 Question (i) Let g, h be two concave functions. Is f = g + h a concave function? Prove it. Yes. Proof: Consider any two points x, x and α [0, ]. Let
More informationMonotonicity and Aging Properties of Random Sums
Monotonicity and Aging Properties of Random Sums Jun Cai and Gordon E. Willmot Department of Statistics and Actuarial Science University of Waterloo Waterloo, Ontario Canada N2L 3G1 E-mail: jcai@uwaterloo.ca,
More informationMinimum Feedback Rates for Multi-Carrier Transmission With Correlated Frequency Selective Fading
Minimum Feedback Rates for Multi-Carrier Transmission With Correlated Frequency Selective Fading Yakun Sun and Michael L. Honig Department of ECE orthwestern University Evanston, IL 60208 Abstract We consider
More informationAn Efficient Approach to Multivariate Nakagami-m Distribution Using Green s Matrix Approximation
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL 2, NO 5, SEPTEMBER 2003 883 An Efficient Approach to Multivariate Nakagami-m Distribution Using Green s Matrix Approximation George K Karagiannidis, Member,
More informationA NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES
Sankhyā : The Indian Journal of Statistics 1998, Volume 6, Series A, Pt. 2, pp. 171-175 A NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES By P. HITCZENKO North Carolina State
More informationTHE inverse tangent function is an elementary mathematical
A Sharp Double Inequality for the Inverse Tangent Function Gholamreza Alirezaei arxiv:307.983v [cs.it] 8 Jul 03 Abstract The inverse tangent function can be bounded by different inequalities, for eample
More informationCell throughput analysis of the Proportional Fair scheduler in the single cell environment
Cell throughput analysis of the Proportional Fair scheduler in the single cell environment Jin-Ghoo Choi and Seawoong Bahk IEEE Trans on Vehicular Tech, Mar 2007 *** Presented by: Anh H. Nguyen February
More informationOn the Multivariate Nakagami-m Distribution With Exponential Correlation
1240 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 51, NO. 8, AUGUST 2003 On the Multivariate Nakagami-m Distribution With Exponential Correlation George K. Karagiannidis, Member, IEEE, Dimitris A. Zogas,
More informationAn Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 4, APRIL 2012 2427 An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel Ersen Ekrem, Student Member, IEEE,
More informationPERFECTLY secure key agreement has been studied recently
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 2, MARCH 1999 499 Unconditionally Secure Key Agreement the Intrinsic Conditional Information Ueli M. Maurer, Senior Member, IEEE, Stefan Wolf Abstract
More informationOn the Ratio of Rice Random Variables
JIRSS 9 Vol. 8, Nos. 1-, pp 61-71 On the Ratio of Rice Random Variables N. B. Khoolenjani 1, K. Khorshidian 1, 1 Departments of Statistics, Shiraz University, Shiraz, Iran. n.b.khoolenjani@gmail.com Departments
More informationOptimal Power Control in Decentralized Gaussian Multiple Access Channels
1 Optimal Power Control in Decentralized Gaussian Multiple Access Channels Kamal Singh Department of Electrical Engineering Indian Institute of Technology Bombay. arxiv:1711.08272v1 [eess.sp] 21 Nov 2017
More informationOptimum Power Allocation in Fading MIMO Multiple Access Channels with Partial CSI at the Transmitters
Optimum Power Allocation in Fading MIMO Multiple Access Channels with Partial CSI at the Transmitters Alkan Soysal Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland,
More informationSeptember Math Course: First Order Derivative
September Math Course: First Order Derivative Arina Nikandrova Functions Function y = f (x), where x is either be a scalar or a vector of several variables (x,..., x n ), can be thought of as a rule which
More informationSome Theoretical Properties and Parameter Estimation for the Two-Sided Length Biased Inverse Gaussian Distribution
Journal of Probability and Statistical Science 14(), 11-4, Aug 016 Some Theoretical Properties and Parameter Estimation for the Two-Sided Length Biased Inverse Gaussian Distribution Teerawat Simmachan
More informationResearch Article The Laplace Likelihood Ratio Test for Heteroscedasticity
International Mathematics and Mathematical Sciences Volume 2011, Article ID 249564, 7 pages doi:10.1155/2011/249564 Research Article The Laplace Likelihood Ratio Test for Heteroscedasticity J. Martin van
More informationDirty Paper Coding vs. TDMA for MIMO Broadcast Channels
TO APPEAR IEEE INTERNATIONAL CONFERENCE ON COUNICATIONS, JUNE 004 1 Dirty Paper Coding vs. TDA for IO Broadcast Channels Nihar Jindal & Andrea Goldsmith Dept. of Electrical Engineering, Stanford University
More informationAn Achievable Error Exponent for the Mismatched Multiple-Access Channel
An Achievable Error Exponent for the Mismatched Multiple-Access Channel Jonathan Scarlett University of Cambridge jms265@camacuk Albert Guillén i Fàbregas ICREA & Universitat Pompeu Fabra University of
More informationWeibull-Gamma composite distribution: An alternative multipath/shadowing fading model
Weibull-Gamma composite distribution: An alternative multipath/shadowing fading model Petros S. Bithas Institute for Space Applications and Remote Sensing, National Observatory of Athens, Metaxa & Vas.
More informationModule 3. Function of a Random Variable and its distribution
Module 3 Function of a Random Variable and its distribution 1. Function of a Random Variable Let Ω, F, be a probability space and let be random variable defined on Ω, F,. Further let h: R R be a given
More informationMath 141: Lecture 11
Math 141: Lecture 11 The Fundamental Theorem of Calculus and integration methods Bob Hough October 12, 2016 Bob Hough Math 141: Lecture 11 October 12, 2016 1 / 36 First Fundamental Theorem of Calculus
More information672 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 2, FEBRUARY We only include here some relevant references that focus on the complex
672 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 2, FEBRUARY 2009 Ordered Eigenvalues of a General Class of Hermitian Rom Matrices With Application to the Performance Analysis of MIMO Systems Luis
More informationThe Least Degraded and the Least Upgraded Channel with respect to a Channel Family
The Least Degraded and the Least Upgraded Channel with respect to a Channel Family Wei Liu, S. Hamed Hassani, and Rüdiger Urbanke School of Computer and Communication Sciences EPFL, Switzerland Email:
More informationStochastic Comparisons of Order Statistics from Generalized Normal Distributions
A^VÇÚO 1 33 ò 1 6 Ï 2017 c 12 Chinese Journal of Applied Probability and Statistics Dec. 2017 Vol. 33 No. 6 pp. 591-607 doi: 10.3969/j.issn.1001-4268.2017.06.004 Stochastic Comparisons of Order Statistics
More informationONE of the main applications of wireless sensor networks
2658 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 Coverage by Romly Deployed Wireless Sensor Networks Peng-Jun Wan, Member, IEEE, Chih-Wei Yi, Member, IEEE Abstract One of the main
More informationCapacity Pre-Log of SIMO Correlated Block-Fading Channels
Capacity Pre-Log of SIMO Correlated Block-Fading Channels Wei Yang, Giuseppe Durisi, Veniamin I. Morgenshtern, Erwin Riegler 3 Chalmers University of Technology, 496 Gothenburg, Sweden ETH Zurich, 809
More informationEE 4TM4: Digital Communications II Scalar Gaussian Channel
EE 4TM4: Digital Communications II Scalar Gaussian Channel I. DIFFERENTIAL ENTROPY Let X be a continuous random variable with probability density function (pdf) f(x) (in short X f(x)). The differential
More informationCapacity of Block Rayleigh Fading Channels Without CSI
Capacity of Block Rayleigh Fading Channels Without CSI Mainak Chowdhury and Andrea Goldsmith, Fellow, IEEE Department of Electrical Engineering, Stanford University, USA Email: mainakch@stanford.edu, andrea@wsl.stanford.edu
More informationMMSE Dimension. snr. 1 We use the following asymptotic notation: f(x) = O (g(x)) if and only
MMSE Dimension Yihong Wu Department of Electrical Engineering Princeton University Princeton, NJ 08544, USA Email: yihongwu@princeton.edu Sergio Verdú Department of Electrical Engineering Princeton University
More informationEnergy Harvesting Multiple Access Channel with Peak Temperature Constraints
Energy Harvesting Multiple Access Channel with Peak Temperature Constraints Abdulrahman Baknina, Omur Ozel 2, and Sennur Ulukus Department of Electrical and Computer Engineering, University of Maryland,
More informationVector Channel Capacity with Quantized Feedback
Vector Channel Capacity with Quantized Feedback Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 9697-65 Email: syed@ece.uci.edu,
More information1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer 11(2) (1989),
Real Analysis 2, Math 651, Spring 2005 April 26, 2005 1 Real Analysis 2, Math 651, Spring 2005 Krzysztof Chris Ciesielski 1/12/05: sec 3.1 and my article: How good is the Lebesgue measure?, Math. Intelligencer
More informationLimits at Infinity. Horizontal Asymptotes. Definition (Limits at Infinity) Horizontal Asymptotes
Limits at Infinity If a function f has a domain that is unbounded, that is, one of the endpoints of its domain is ±, we can determine the long term behavior of the function using a it at infinity. Definition
More informationLOW-density parity-check (LDPC) codes were invented
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 1, JANUARY 2008 51 Extremal Problems of Information Combining Yibo Jiang, Alexei Ashikhmin, Member, IEEE, Ralf Koetter, Senior Member, IEEE, and Andrew
More informationConvergence of generalized entropy minimizers in sequences of convex problems
Proceedings IEEE ISIT 206, Barcelona, Spain, 2609 263 Convergence of generalized entropy minimizers in sequences of convex problems Imre Csiszár A Rényi Institute of Mathematics Hungarian Academy of Sciences
More informationInterference Reduction In Cognitive Networks via Scheduling
1 Interference Reduction In Cognitive Networks via Scheduling Patrick Mitran, Member, IEEE Abstract In this letter, we first define a cognitive network to be useful if at least one node can be scheduled
More informationApproximate Capacity of Fast Fading Interference Channels with no CSIT
Approximate Capacity of Fast Fading Interference Channels with no CSIT Joyson Sebastian, Can Karakus, Suhas Diggavi Abstract We develop a characterization of fading models, which assigns a number called
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
More informationEE 5407 Part II: Spatial Based Wireless Communications
EE 5407 Part II: Spatial Based Wireless Communications Instructor: Prof. Rui Zhang E-mail: rzhang@i2r.a-star.edu.sg Website: http://www.ece.nus.edu.sg/stfpage/elezhang/ Lecture II: Receive Beamforming
More informationInfinite Limits. By Tuesday J. Johnson
Infinite Limits By Tuesday J. Johnson Suggested Review Topics Algebra skills reviews suggested: Evaluating functions Graphing functions Working with inequalities Working with absolute values Trigonometric
More informationTHE information capacity is one of the most important
256 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 1, JANUARY 1998 Capacity of Two-Layer Feedforward Neural Networks with Binary Weights Chuanyi Ji, Member, IEEE, Demetri Psaltis, Senior Member,
More informationOn capacity of multi-antenna wireless channels: Effects of antenna separation and spatial correlation
3rd AusCTW, Canberra, Australia, Feb. 4 5, 22 On capacity of multi-antenna wireless channels: Effects of antenna separation and spatial correlation Thushara D. Abhayapala 1, Rodney A. Kennedy, and Jaunty
More informationCharacterization of Mutual Information of Spatially Correlated MIMO Channels with Keyhole
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the ICC 7 proceedings. Characterization of Mutual Information of Spatially
More informationON BEAMFORMING WITH FINITE RATE FEEDBACK IN MULTIPLE ANTENNA SYSTEMS
ON BEAMFORMING WITH FINITE RATE FEEDBACK IN MULTIPLE ANTENNA SYSTEMS KRISHNA KIRAN MUKKAVILLI ASHUTOSH SABHARWAL ELZA ERKIP BEHNAAM AAZHANG Abstract In this paper, we study a multiple antenna system where
More informationMetric Diophantine Approximation for Formal Laurent Series over Finite Fields
Metric Diophantine Approximation for Formal Laurent Series over Finite Fields Michael Fuchs Department of Applied Mathematics National Chiao Tung University Hsinchu, Taiwan Fq9, July 16th, 2009 Michael
More informationDETERMINING the information theoretic capacity of
IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 7, JULY 007 369 Transactions Letters Outage Capacity and Optimal Power Allocation for Multiple Time-Scale Parallel Fading Channels Subhrakanti
More informationOptimal Data and Training Symbol Ratio for Communication over Uncertain Channels
Optimal Data and Training Symbol Ratio for Communication over Uncertain Channels Ather Gattami Ericsson Research Stockholm, Sweden Email: athergattami@ericssoncom arxiv:50502997v [csit] 2 May 205 Abstract
More informationSchur-convexity of the Symbol Error Rate in Correlated MIMO Systems with Precoding and Space-time Coding
Schur-convexity of the Symbol Error Rate in Correlated MIMO Systems with Precoding and Space-time Coding RadioVetenskap och Kommunikation (RVK 08) Proceedings of the twentieth Nordic Conference on Radio
More informationTowards control over fading channels
Towards control over fading channels Paolo Minero, Massimo Franceschetti Advanced Network Science University of California San Diego, CA, USA mail: {minero,massimo}@ucsd.edu Invited Paper) Subhrakanti
More informationParallel Additive Gaussian Channels
Parallel Additive Gaussian Channels Let us assume that we have N parallel one-dimensional channels disturbed by noise sources with variances σ 2,,σ 2 N. N 0,σ 2 x x N N 0,σ 2 N y y N Energy Constraint:
More informationAsymptotic Probability Density Function of. Nonlinear Phase Noise
Asymptotic Probability Density Function of Nonlinear Phase Noise Keang-Po Ho StrataLight Communications, Campbell, CA 95008 kpho@stratalight.com The asymptotic probability density function of nonlinear
More informationTHIS paper addresses the quadratic Gaussian two-encoder
1938 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 54, NO 5, MAY 2008 Rate Region of the Quadratic Gaussian Two-Encoder Source-Coding Problem Aaron B Wagner, Member, IEEE, Saurabha Tavildar, Pramod Viswanath,
More informationWhat is the Value of Joint Processing of Pilots and Data in Block-Fading Channels?
What is the Value of Joint Processing of Pilots Data in Block-Fading Channels? Nihar Jindal University of Minnesota Minneapolis, MN 55455 Email: nihar@umn.edu Angel Lozano Universitat Pompeu Fabra Barcelona
More informationMultiuser Capacity in Block Fading Channel
Multiuser Capacity in Block Fading Channel April 2003 1 Introduction and Model We use a block-fading model, with coherence interval T where M independent users simultaneously transmit to a single receiver
More informationTIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION
TIGHT BOUNDS FOR THE FIRST ORDER MARCUM Q-FUNCTION Jiangping Wang and Dapeng Wu Department of Electrical and Computer Engineering University of Florida, Gainesville, FL 3611 Correspondence author: Prof.
More informationStandard forms for writing numbers
Standard forms for writing numbers In order to relate the abstract mathematical descriptions of familiar number systems to the everyday descriptions of numbers by decimal expansions and similar means,
More informationMinimum Energy Per Bit for Secret Key Acquisition Over Multipath Wireless Channels
Minimum Energy Per Bit for Secret Key Acquisition Over Multipath Wireless Channels Tzu-Han Chou Email: tchou@wisc.edu Akbar M. Sayeed Email: akbar@engr.wisc.edu Stark C. Draper Email: sdraper@ece.wisc.edu
More informationPROMPTED by recent results suggesting possible extraordinary
1102 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 4, NO. 3, MAY 2005 On the Capacity of Multiple-Antenna Systems in Rician Fading Sudharman K. Jayaweera, Member, IEEE, and H. Vincent Poor, Fellow,
More informationThe Capacity of Finite Abelian Group Codes Over Symmetric Memoryless Channels Giacomo Como and Fabio Fagnani
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 5, MAY 2009 2037 The Capacity of Finite Abelian Group Codes Over Symmetric Memoryless Channels Giacomo Como and Fabio Fagnani Abstract The capacity
More informationError Exponent Region for Gaussian Broadcast Channels
Error Exponent Region for Gaussian Broadcast Channels Lihua Weng, S. Sandeep Pradhan, and Achilleas Anastasopoulos Electrical Engineering and Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationCharacterization of Rate Region in Interference Channels with Constrained Power
Characterization of Rate Region in Interference Channels with Constrained Power Hajar Mahdavi-Doost, Masoud Ebrahimi, and Amir K. Khandani Coding & Signal Transmission Laboratory Department of Electrical
More informationStatistics of Correlated Generalized Gamma Variates
Statistics of Correlated Generalized Gamma Variates Petros S. Bithas 1 and Theodoros A. Tsiftsis 2 1 Department of Electrical & Computer Engineering, University of Patras, Rion, GR-26500, Patras, Greece,
More information,... We would like to compare this with the sequence y n = 1 n
Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.
More informationIf g is also continuous and strictly increasing on J, we may apply the strictly increasing inverse function g 1 to this inequality to get
18:2 1/24/2 TOPIC. Inequalities; measures of spread. This lecture explores the implications of Jensen s inequality for g-means in general, and for harmonic, geometric, arithmetic, and related means in
More informationBounded Infinite Sequences/Functions : Orders of Infinity
Bounded Infinite Sequences/Functions : Orders of Infinity by Garimella Ramamurthy Report No: IIIT/TR/2009/247 Centre for Security, Theory and Algorithms International Institute of Information Technology
More informationOn Exponential Decay and the Riemann Hypothesis
On Exponential Decay and the Riemann Hypothesis JEFFREY N. COOK ABSTRACT. A Riemann operator is constructed in which sequential elements are removed from a decaying set by means of prime factorization,
More informationRECURSIVE TRAINING WITH UNITARY MODULATION FOR CORRELATED BLOCK-FADING MIMO CHANNELS
RECURSIVE TRAINING WITH UNITARY MODULATION FOR CORRELATED BLOCK-FADING MIMO CHANNELS Wenyi Zhang, Student Member, IEEE, and J Nicholas Laneman, Member, IEEE Department of Electrical Engineering University
More informationNotes on a skew-symmetric inverse double Weibull distribution
Journal of the Korean Data & Information Science Society 2009, 20(2), 459 465 한국데이터정보과학회지 Notes on a skew-symmetric inverse double Weibull distribution Jungsoo Woo 1 Department of Statistics, Yeungnam
More informationOn Comparability of Multiple Antenna Channels
On Comparability of Multiple Antenna Channels Majid Fozunbal, Steven W. McLaughlin, and Ronald W. Schafer School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA 30332-0250
More informationDegrees of Freedom Region of the Gaussian MIMO Broadcast Channel with Common and Private Messages
Degrees of Freedom Region of the Gaussian MIMO Broadcast hannel with ommon and Private Messages Ersen Ekrem Sennur Ulukus Department of Electrical and omputer Engineering University of Maryland, ollege
More informationA Framework for Training-Based Estimation in Arbitrarily Correlated Rician MIMO Channels with Rician Disturbance
A Framework for Training-Based Estimation in Arbitrarily Correlated Rician MIMO Channels with Rician Disturbance IEEE TRANSACTIONS ON SIGNAL PROCESSING Volume 58, Issue 3, Pages 1807-1820, March 2010.
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationAsymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections
IEEE TRANSACTIONS ON INFORMATION THEORY, SUBMITTED (MAY 10, 2005). 1 Asymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections arxiv:cs/0505020v1 [cs.it] 10 May 2005
More informationDesign of MMSE Multiuser Detectors using Random Matrix Techniques
Design of MMSE Multiuser Detectors using Random Matrix Techniques Linbo Li and Antonia M Tulino and Sergio Verdú Department of Electrical Engineering Princeton University Princeton, New Jersey 08544 Email:
More informationStability and Sensitivity of the Capacity in Continuous Channels. Malcolm Egan
Stability and Sensitivity of the Capacity in Continuous Channels Malcolm Egan Univ. Lyon, INSA Lyon, INRIA 2019 European School of Information Theory April 18, 2019 1 / 40 Capacity of Additive Noise Models
More informationContinuous Univariate Distributions
Continuous Univariate Distributions Volume 1 Second Edition NORMAN L. JOHNSON University of North Carolina Chapel Hill, North Carolina SAMUEL KOTZ University of Maryland College Park, Maryland N. BALAKRISHNAN
More informationApplication of Harmonic Convexity to Multiobjective Non-linear Programming Problems
International Journal of Computational Science and Mathematics ISSN 0974-3189 Volume 2, Number 3 (2010), pp 255--266 International Research Publication House http://wwwirphousecom Application of Harmonic
More informationOn the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise
On the Impact of Quantized Channel Feedback in Guaranteeing Secrecy with Artificial Noise Ya-Lan Liang, Yung-Shun Wang, Tsung-Hui Chang, Y.-W. Peter Hong, and Chong-Yung Chi Institute of Communications
More informationBurr Type X Distribution: Revisited
Burr Type X Distribution: Revisited Mohammad Z. Raqab 1 Debasis Kundu Abstract In this paper, we consider the two-parameter Burr-Type X distribution. We observe several interesting properties of this distribution.
More informationA Generalized Uncertainty Principle and Sparse Representation in Pairs of Bases
2558 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 48, NO 9, SEPTEMBER 2002 A Generalized Uncertainty Principle Sparse Representation in Pairs of Bases Michael Elad Alfred M Bruckstein Abstract An elementary
More informationAsymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections
IEEE TRANSACTIONS ON INFORMATION THEORY, SUBMITTED (MAY 10, 2005). 1 Asymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections arxiv:cs.it/0505020 v1 10 May 2005 Thomas
More information