Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published July 2013 | Submitted
Book Section - Chapter Open

Convexity of error rates in digital communications under non-Gaussian noise

Abstract

Convexity properties of error rates of a class of decoders, including the ML/min-distance one as a special case, are studied for arbitrary constellations. Earlier results obtained for the AWGN channel are extended to a wide class of (non-Gaussian) noise densities, including unimodal and spherically-invariant noise. Under these broad conditions, symbol error rates are shown to be convex functions of the 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 insures 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.

Additional Information

© 2013 IEEE.

Attached Files

Submitted - 1304.8102.pdf

Files

1304.8102.pdf
Files (376.0 kB)
Name Size Download all
md5:b64cf1cd1b2f1ab3ad93c588e3cfb80e
376.0 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 20, 2023