论文信息 - Analysis of fast sparse superposition codes

Analysis of fast sparse superposition codes

Sparse superposition codes with a fast adaptive successive decoder for the additive white Gaussian noise channel were introduced last year by the authors, along with presentation of reliability at rates approaching capacity. The present work presents ingredients of the distributional analysis of the decoder.

Andrew R. Barron | Antony Joseph

[1] Sundeep Rangan,et al. On-Off Random Access Channels: A Compressed Sensing Framework , 2009, ArXiv.

[2] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..

[3] Andrew R. Barron,et al. Toward fast reliable communication at rates near capacity with Gaussian noise , 2010, 2010 IEEE International Symposium on Information Theory.

[4] Tong Zhang,et al. Adaptive Forward-Backward Greedy Algorithm for Learning Sparse Representations , 2011, IEEE Transactions on Information Theory.

[5] A. Barron,et al. Sparse Superposition Codes: Fast and Reliable at Rates Approaching Capacity with Gaussian Noise , 2010 .

[6] Joel A. Tropp,et al. Just relax: convex programming methods for identifying sparse signals in noise , 2006, IEEE Transactions on Information Theory.

[7] L. Jones. A Simple Lemma on Greedy Approximation in Hilbert Space and Convergence Rates for Projection Pursuit Regression and Neural Network Training , 1992 .

[8] A. Sridharan. Broadcast Channels , 2022 .