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 languageEnglish (US)
Article number6423920
Pages (from-to)3922-3931
Number of pages10
JournalIEEE Transactions on Information Theory
Volume59
Issue number6
DOIs
StatePublished - 2013

Fingerprint

symbol
coding
Signal to noise ratio
Detectors
performance

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

Cite this

A representation for the symbol error rate using completely monotone functions. / Rajan, Adithya; Tepedelenlioglu, Cihan.

In: IEEE Transactions on Information Theory, Vol. 59, No. 6, 6423920, 2013, p. 3922-3931.

Research output: Contribution to journalArticle

@article{dd6958ce7505472597b1e216b08d12f2,
title = "A representation for the symbol error rate using completely monotone functions",
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.",
keywords = "Canonical representation, completely monotone, convex, stochastic ordering, symbol error rate (SER)",
author = "Adithya Rajan and Cihan Tepedelenlioglu",
year = "2013",
doi = "10.1109/TIT.2013.2243801",
language = "English (US)",
volume = "59",
pages = "3922--3931",
journal = "IEEE Transactions on Information Theory",
issn = "0018-9448",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - A representation for the symbol error rate using completely monotone functions

AU - Rajan, Adithya

AU - Tepedelenlioglu, Cihan

PY - 2013

Y1 - 2013

N2 - 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.

AB - 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.

KW - Canonical representation

KW - completely monotone

KW - convex

KW - stochastic ordering

KW - symbol error rate (SER)

UR - http://www.scopus.com/inward/record.url?scp=84877885568&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84877885568&partnerID=8YFLogxK

U2 - 10.1109/TIT.2013.2243801

DO - 10.1109/TIT.2013.2243801

M3 - Article

AN - SCOPUS:84877885568

VL - 59

SP - 3922

EP - 3931

JO - IEEE Transactions on Information Theory

JF - IEEE Transactions on Information Theory

SN - 0018-9448

IS - 6

M1 - 6423920

ER -