Computing Approximations for the Generalized Q Function and its Complement

IEEE Transactions on Information Theory

Volumn 17, Issue 4, 1971, Pages 497-498

  Rappaport, Stephen S ^a  

^a STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SIGNAL DETECTION;

INFORMATION THEORY;

EID: 0015095236     PISSN: 00189448     EISSN: 15579654     Source Type: Journal    
DOI: 10.1109/TIT.1971.1054651     Document Type: Article

References (8)

1. W. F. McGee, “Another recursive method of computing the Q function,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-16. July 1970. pp. 500–501.
2. L. E. Brennan and I. S. Reed,’ “Recursive method of computing the Q function,” IEEE Trans. Inform. Theory (Corresp.), vol. IT-ll, Apr. 1965, pp. 312–313.
3. C. W. Helstrom, Statistical Theory of Signal Detection, 2nd ed. New York: Pergamon, 1968.
4. G. H. Robertson, “Computation of the noncentral chi-square distribution,” Bell Syst, Tech. J• vol 48. Jan. 1969. pp 201–208.
5. H. Sagon, “Numerical calculation of-the incomplete Toronto function,” Proc, IEEE (Lett.), vol, 54. Aug. 1966, p, 1095.
6. S.O. Rice, “Uniform asymptotic expansions for saddle point integrals-Application to a probability distribution occurring in noise theory,” Bell Syst. Tech. J,. vol. 47, Nov. 1968, pp 1971–2013.
7. J. E. Mazo and J. Salz, “Probability of error for quadratic detectors,” Bell Syst, Tech. J vol. 44. Nov. 1965.p. 2165–2186.
8. J. M. Wozencraft and I. M. Jacobs, Principles of Communication Engineering. New York: Wiley, 1965, pp. 97–106.