### Abstract

The symbol error rate of an arbitrary multidimensional constellation in the absence of coding impaired by additive white Gaussian noise is characterized as the product of a completely monotone function with a nonnegative power of the signal-to-noise ratio, when the minimum distance detector is used. This representation is also shown to apply to cases when the impairing noise is compound Gaussian. Using this general result, it is proved that the symbol error rate is completely monotone if the rank of its constellation matrix is either one or two. Further, a necessary and sufficient condition for the complete monotonicity of the symbol error rate of a constellation of any dimension is also obtained. Applications to stochastic ordering of wireless system performance are also discussed.

Original language | English (US) |
---|---|

Article number | 6423920 |

Pages (from-to) | 3922-3931 |

Number of pages | 10 |

Journal | IEEE Transactions on Information Theory |

Volume | 59 |

Issue number | 6 |

DOIs | |

State | Published - May 23 2013 |

### Keywords

- Canonical representation
- completely monotone
- convex
- stochastic ordering
- symbol error rate (SER)

### ASJC Scopus subject areas

- Information Systems
- Computer Science Applications
- Library and Information Sciences

## Fingerprint Dive into the research topics of 'A representation for the symbol error rate using completely monotone functions'. Together they form a unique fingerprint.

## Cite this

*IEEE Transactions on Information Theory*,

*59*(6), 3922-3931. [6423920]. https://doi.org/10.1109/TIT.2013.2243801