Proof of threshold saturation for spatially coupled sparse superposition codes
Proof of threshold saturation for spatially coupled sparse superposition codes
复制标题
空间耦合稀疏叠加码的阈值饱和证明
DOI：
--
复制
发表时间：
2016
期刊：
影响因子：
--
通讯作者：
N. Macris
中科院分区：
文献类型：
--
作者：
Jean Barbier;M. Dia;N. Macris
最近，一类新的代码，称为稀疏叠加或稀疏回归码，已被提出用于在AWGN信道上的通信。已经证明，它们使用功率分配和各种形式的迭代解码来实现容量。经验证据也强烈表明，当使用空间耦合和近似消息传递解码时，代码实现容量，而不需要功率分配。在这份说明中，我们证明了状态演化（跟踪消息传递）确实饱和的潜在阈值的底层代码集成，在适当的限制接近的最佳阈值。我们的证明使用低密度奇偶校验码和压缩感知理论中的思想。
Recently, a new class of codes, called sparse superposition or sparse regression codes, has been proposed for communication over the AWGN channel. It has been proven that they achieve capacity using power allocation and various forms of iterative decoding. Empirical evidence has also strongly suggested that the codes achieve capacity when spatial coupling and approximate message passing decoding are used, without need of power allocation. In this note we prove that state evolution (which tracks message passing) indeed saturates the potential threshold of the underlying code ensemble, which approaches in a proper limit the optimal threshold. Our proof uses ideas developed in the theory of low-density parity-check codes and compressive sensing.
影响因子：
2.5
作者：
Rush, Cynthia;Greig, Adam;Venkataramanan, Ramji
通讯作者：
Venkataramanan, Ramji