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 June 2010 | Submitted + Published
Book Section - Chapter Open

Error Rates of Capacity-Achieving Codes Are Convex

Abstract

Motivated by a wide-spread use of convex optimization techniques, convexity properties of bit error rate of the maximum likelihood detector operating in the AWGN channel are studied for arbitrary constellations and bit mappings, which also includes coding under maximum-likelihood decoding. Under this generic setting, the pairwise probability of error and bit error rate are shown to be convex functions of the SNR and noise power in the high SNR/low noise regime with explicitly-determined boundary. Any code, including capacity-achieving ones, whose decision regions include the hardened noise spheres (from the noise sphere hardening argument in the channel coding theorem) satisfies 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.

Additional Information

© 2010 Crown.

Attached Files

Published - 05513337.pdf

Submitted - 1004.2683.pdf

Files

1004.2683.pdf
Files (261.3 kB)
Name Size Download all
md5:71fc4edfc4107353ace03f20cf94f175
99.6 kB Preview Download
md5:f541c470f844354b2fb5b3f78de373d4
161.7 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
January 13, 2024