Comparison of generalized Q- function algorithms (Corresp.)

DOI10.1109/TIT.1987.1057323MaRDI QIDQ3768800zbMATH OpenFDO

Authors Pierce E. Cantrell, Anand K. Ojha

Publication date 1987

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.1987.1057323

zbMATH Keywords

algorithmsgeneralized Q-function

Mathematics Subject Classification ID

Probabilistic methods, stochastic differential equations (65C99) Detection theory in information and communication theory (94A13)

Recommendations

• Computing approximations for the generalized Q function and its complement (Corresp.)
• scientific article; zbMATH DE number 953050
• An equivalence between two algorithms for general quadratic programming
• The QP-DYN algorithms
• Optimal iterative QP and QPQC algorithms
• scientific article; zbMATH DE number 592767
• scientific article; zbMATH DE number 4009674
• The QR Algorithm Revisited
• Comparison of optimal quadrature formulas
• Parallelization of the quantile function optimization algorithms

Cited in

(6)

• Evaluation of \(q\)-gamma function and \(q\)-analogues by iterative algorithms
• Proposal of simple and accurate two-parametric approximation for the \(Q\)-function
• Marcum \(Q\)-functions and explicit kernels for stabilization of \(2 \times 2\) linear hyperbolic systems with constant coefficients
• The incomplete Pochhammer symbols and their applications to hypergeometric and related functions
• Highly accurate analytic approximation to the Gaussian \(Q\)-function based on the use of nonlinear least squares optimization algorithm
• On the calculation of the generalized<tex>Q</tex>-function via Parl's method (Corresp.)

This page was built for publication: Comparison of generalized Q- function algorithms (Corresp.)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3768800)