arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1004.2683cs.ITmath.IT
收藏

容量实现码的出错率是凸的

Error Rates of Capacity-Achieving Codes Are Convex

Sergey Loyka, Francois Gagnon, Victoria Kostina

摘要:

基于凸优化技术的广泛应用,研究了任意星座和比特映射下AWGN信道下最大似然检测器的比特出错率的凸性特性,其中也包括最大似然译码下的编码.在这种通用设置下,成对的错误概率和比特出错率被示出为在高SNR/低噪声状态下具有明确确定的边界的SNR和噪声功率的凸函数。任何码,包括容量实现码,其判决区域包括硬化的噪声球(根据信道编码定理中的噪声球硬化论点),都满足这种高SNR要求,因此在SNR和噪声功率方面都具有凸的出错率。我们推测,所有的容量实现码有凸出错率。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑