High-rate sparse superposition codes with iteratively optimal estimates
High-rate sparse superposition codes with iteratively optimal estimates
复制标题
具有迭代最优估计的高速率稀疏叠加码
DOI：
--
复制
发表时间：
2012
期刊：
影响因子：
--
通讯作者：
Sanghee Cho
中科院分区：
文献类型：
--
作者：
A. Barron;Sanghee Cho
最近，已经开发出具有迭代项选择的稀疏叠加码，其在数学上被证明在低于具有功率控制的加性白色高斯噪声信道的容量的任何速率下都是快速和可靠的。我们提高了性能，使用软判决解码器与贝叶斯最优统计在每次迭代，然后阈值只有在最后一步。该演示文稿包括制定的统计，证明其分布，数值模拟的性能改善，和有用的身份有关的平方误差风险的后验概率的错误。
Recently sparse superposition codes with iterative term selection have been developed which are mathematically proven to be fast and reliable at any rate below the capacity for the additive white Gaussian noise channel with power control. We improve the performance using a soft decision decoder with Bayes optimal statistics at each iteration, followed by thresholding only at the final step. This presentation includes formulation of the statistics, proof of their distributions, numerical simulations of the performance improvement, and useful identities relating a squared error risk to a posterior probability of error.