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
Name | Size | Download all |
---|---|---|
md5:b64cf1cd1b2f1ab3ad93c588e3cfb80e
|
376.0 kB | Preview Download |
Additional details
- Eprint ID
- 92868
- DOI
- 10.1109/ISIT.2013.6620184
- Resolver ID
- CaltechAUTHORS:20190213-075441906
- Created
-
2019-02-13Created from EPrint's datestamp field
- Updated
-
2021-11-16Created from EPrint's last_modified field