CaltechAUTHORS
  A Caltech Library Service

On Convexity of Error Rates in Digital Communications

Loyka, Sergey and Kostina, Victoria and Gagnon, François (2013) On Convexity of Error Rates in Digital Communications. IEEE Transactions on Information Theory, 59 (10). pp. 6501-6516. ISSN 0018-9448. doi:10.1109/TIT.2013.2267772. https://resolver.caltech.edu/CaltechAUTHORS:20190213-084137169

[img] PDF - Submitted Version
See Usage Policy.

376kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20190213-084137169

Abstract

Convexity properties of error rates of a class of decoders, including the maximum-likelihood/min-distance one as a special case, are studied for arbitrary constellations, bit mapping, and coding. Earlier results obtained for the additive white Gaussian noise channel are extended to a wide class of noise densities, including unimodal and spherically invariant noise. Under these broad conditions, symbol and bit error rates are shown to be convex functions of the signal-to-noise ratio (SNR) in the high-SNR regime with an explicitly determined threshold, which depends only on the constellation dimensionality and minimum distance, thus enabling an application of the powerful tools of convex optimization to such digital communication systems in a rigorous way. It is the decreasing nature of the noise power density around the decision region boundaries that ensures the convexity of symbol error rates in the general case. The known high/low-SNR bounds of the convexity/concavity regions are tightened and no further improvement is shown to be possible in general. The high-SNR bound fits closely into the channel coding theorem: all codes, including capacity-achieving ones, whose decision regions include the hardened noise spheres (from the noise sphere hardening argument in the channel coding theorem), satisfy this high-SNR requirement and thus has convex error rates in both SNR and noise power. We conjecture that all capacity-achieving codes have convex error rates. Convexity properties in signal amplitude and noise power are also investigated. Some applications of the results are discussed. In particular, it is shown that fading is convexity-preserving and is never good in low dimensions under spherically invariant noise, which may also include any linear diversity combining.


Item Type:Article
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/TIT.2013.2267772DOIArticle
https://arxiv.org/abs/1304.8102arXivDiscussion Paper
https://resolver.caltech.edu/CaltechAUTHORS:20190213-075441906Related ItemConference Paper
ORCID:
AuthorORCID
Kostina, Victoria0000-0002-2406-7440
Additional Information:© 2013 British Crown Copyright. Manuscript received August 21, 2012; revised February 15, 2013; accepted April 08, 2013. Date of publication June 11, 2013; date of current version September 11, 2013. This paper was presented in part at the International Zurich Seminar on Communications, Zurich, Switzerland, March 3–5, 2010 and in part at the 2010 IEEE International Symposium on Information Theory.
Subject Keywords:Bit error rate (BER), convexity/concavity, error rate, maximum-likelihood (ML) decoding, pairwise probability of error, spherically invariant noise, unimodal noise
Issue or Number:10
DOI:10.1109/TIT.2013.2267772
Record Number:CaltechAUTHORS:20190213-084137169
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20190213-084137169
Official Citation:S. Loyka, V. Kostina and F. Gagnon, "On Convexity of Error Rates in Digital Communications," in IEEE Transactions on Information Theory, vol. 59, no. 10, pp. 6501-6516, Oct. 2013. doi: 10.1109/TIT.2013.2267772
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:92872
Collection:CaltechAUTHORS
Deposited By: Tony Diaz
Deposited On:13 Feb 2019 18:31
Last Modified:16 Nov 2021 16:54

Repository Staff Only: item control page