Please use this identifier to cite or link to this item:
|Title:||Computing and bounding the first-order Marcum Q-function: A geometric approach|
|Authors:||Kam, P.Y. |
|Keywords:||Complex Gaussian distribution|
|Source:||Kam, P.Y., Li, R. (2008-07). Computing and bounding the first-order Marcum Q-function: A geometric approach. IEEE Transactions on Communications 56 (7) : 1101-1110. ScholarBank@NUS Repository. https://doi.org/10.1109/TCOMM.2008.060360|
|Abstract:||A geometric interpretation of the first-order Marcum Q-function, Q(a, b), is introduced as the probability that complex, Gaussian random variable with real mean a, takes on values outside of a disk CO,b of radius b centered at the origin O. This interpretation engenders a fruitful approach for deriving new representations and tight, upper and lower bounds on Q(a, b). The new representations obtained involve finite-range integrals with pure exponential integrands. They are shown to be simpler and more robust than their counterparts in the literature. The new bounds obtained include the generic exponential bounds which involve an arbitrarily large number of exponential functions, and the simple erfc bounds which involve just a few erfc functions, together with exponential functions in some cases. The new generic exponential bounds approach the exact value of Q(a, b) as the number of exponential terms involved increases. These generic exponential bounds evaluated with only two terms and the new simple erfc bounds are much tighter than the existing exponential bounds in most cases, especially when the arguments a and b are large. Thus, in many applications requiring further analytical manipulations of Q(a, b), these new bounds can lead to some closed-form results which are better than the results available so far. © 2008 IEEE.|
|Source Title:||IEEE Transactions on Communications|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Jan 16, 2018
WEB OF SCIENCETM
checked on Nov 29, 2017
checked on Jan 21, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.