Comparison of generalized Q- function algorithms (Corresp.)
- 1 July 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Information Theory
- Vol. 33 (4) , 591-596
- https://doi.org/10.1109/tit.1987.1057323
Abstract
Several methods have been proposed for calculating the generalizedQ-functionQ_{m}(alpha, beta), but only isolated comparisons of the various techniques have been reported. The accuracy, range, and execution time of prominent methods for computing theQ-function are compared, and limitations of the algorithms are identified.Keywords
This publication has 16 references indexed in Scilit:
- Computation of the Transient M/M/1 Queue cdf, pdf, and Mean with Generalized Q-FunctionsIEEE Transactions on Communications, 1986
- New expressions for the pdf and cdf of the filtered output of an analog cross correlator (Corresp.)IEEE Transactions on Information Theory, 1982
- A new method of calculating the generalized Q function (Corresp.)IEEE Transactions on Information Theory, 1980
- Efficient evaluation of probabilities of detection and the generalized Q-function (Corresp.)IEEE Transactions on Information Theory, 1976
- Computation of the Noncentral F Distribution (CFAR)DetectionIEEE Transactions on Aerospace and Electronic Systems, 1976
- Recursive Computation of the Generalized Q FunctionIEEE Transactions on Aerospace and Electronic Systems, 1973
- Another recursive method of computing the Q function (Corresp.)IEEE Transactions on Information Theory, 1970
- Uniform Asymptotic Expansions for Saddle Point Integrals-Application to a Probability Distribution Occurring in Noise TheoryBell System Technical Journal, 1968
- A recursive method of computing the Q function (Corresp.)IEEE Transactions on Information Theory, 1965
- Mathematical Analysis of Random NoiseBell System Technical Journal, 1945