On the throughput gain for rapid dynamic symbol duration adaptation within discrete duration sets
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
| Hi-index | 0.00 |
For MQAM and MPAM with practical values of M and Gray mapping, we provide a rigorous proof that the associated bit error probability (BEP) functions are convex of the signal-to-noise ratio per symbol. The proof employs Taylor series expansions of the BEP functions' second derivatives and term-by-term comparisons between positive and negative terms. Convexity results are useful for optimizing communication systems as in optimizing adaptive transmission policies. Copyright © 2009 John Wiley & Sons, Ltd. For MQAM and MPAM with practical values of M and Gray mapping, we provide a rigorous proof that the associated bit error probability (BEP) functions are convex of the SNR per symbol. The proof employs Taylor series expansions of the BEP functions' second derivatives and term-by-term comparisons between positive and negative terms. Convexity results are useful for optimizing communication systems as in optimizing adaptive transmission policies. Copyright © 2009 John Wiley & Sons, Ltd.