4.5 Article

Capacity-Achieving Spatially Coupled Sparse Superposition Codes With AMP Decoding

Journal

IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 67, Issue 7, Pages 4446-4484

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2021.3083733

Keywords

Decoding; Standards; Compressed sensing; AWGN channels; Modulation; Iterative decoding; Sparse matrices; Sparse superposition codes; spatial coupling; approximate message passing decoding; state evolution; AWGN channel; coded modulation

Funding

  1. Engineering and Physical Sciences Research Council (EPSRC) Doctoral Training Award
  2. Turing Fellowship through the Alan Turing Institute
  3. National Science Foundation (NSF) through Computing and Communications Foundation (CCF) [1849883]
  4. Simons Institute for the Theory of Computing
  5. NTT Research
  6. Direct For Computer & Info Scie & Enginr
  7. Division of Computing and Communication Foundations [1849883] Funding Source: National Science Foundation

Ask authors/readers for more resources

Sparse superposition codes, also known as sparse regression codes, are efficient for communication over the AWGN channel at rates approaching channel capacity. By utilizing the spatially coupled structure and AMP decoding, these codes can achieve channel capacity. Numerical simulations show that spatially coupled SPARCs perform well in finite lengths and outperform LDPC codes in terms of error performance.
Sparse superposition codes, also referred to as sparse regression codes (SPARCs), are a class of codes for efficient communication over the AWGN channel at rates approaching the channel capacity. In a standard SPARC, codewords are sparse linear combinations of columns of an i.i.d. Gaussian design matrix, while in a spatially coupled SPARC the design matrix has a block-wise structure, where the variance of the Gaussian entries can be varied across blocks. A well-designed spatial coupling structure can significantly enhance the error performance of iterative decoding algorithms such as Approximate Message Passing (AMP). In this paper, we obtain a non-asymptotic bound on the probability of error of spatially coupled SPARCs with AMP decoding. Applying this bound to a simple band-diagonal design matrix, we prove that spatially coupled SPARCs with AMP decoding achieve the capacity of the AWGN channel. The bound also highlights how the decay of error probability depends on each design parameter of the spatially coupled SPARC. An attractive feature of AMP decoding is that its asymptotic mean squared error (MSE) can be predicted via a deterministic recursion called state evolution. Our result provides the first proof that the MSE concentrates on the state evolution prediction for spatially coupled designs. Combined with the state evolution prediction, this result implies that spatially coupled SPARCs with the proposed band-diagonal design are capacity-achieving. Using the proof technique used to establish the main result, we also obtain a concentration inequality for the MSE of AMP applied to compressed sensing with spatially coupled design matrices. Finally, we provide numerical simulation results that demonstrate the finite length error performance of spatially coupled SPARCs. The performance is compared with coded modulation schemes that use LDPC codes from the DVB-S2 standard.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available