Fast Sparse Superposition Codes Have Near Exponential Error Probability for $R<{cal C}$
Fast Sparse Superposition Codes Have Near Exponential Error Probability for $R<{cal C}$
复制标题
快速稀疏叠加码对于 $R<{cal C}$ 具有接近指数的错误概率
DOI：
--
复制
发表时间：
2014
影响因子：
2.5
通讯作者：
A. Barron
中科院分区：
文献类型：
--
作者：
Antony Joseph;A. Barron
针对加性白色高斯噪声信道，在平均码字功率受限的情况下，提出了稀疏叠加码.这些代码是基于统计高维回归框架。在以前的论文中，我们研究了使用最佳最大似然解码方案的解码。在这里，一个快速解码算法，称为自适应连续解码器，开发。对于任何速率R小于容量C，通信被证明是可靠的，几乎指数小的错误概率。具体而言，对于块长度n，它示出的错误概率是指数小的n/logn。
For the additive white Gaussian noise channel with average codeword power constraint, sparse superposition codes are developed. These codes are based on the statistical high-dimensional regression framework. In a previous paper, we investigated decoding using the optimal maximum-likelihood decoding scheme. Here, a fast decoding algorithm, called the adaptive successive decoder, is developed. For any rate R less than the capacity C, communication is shown to be reliable with nearly exponentially small error probability. Specifically, for blocklength n, it is shown that the error probability is exponentially small in n/logn.