Quasi-Orthogonal Sparse Superposition Codes

We introduce a new family of error correction codes based on sparse superposition called Quasi- Orthogonal} Sparse Superposition Codes (QO-SSC). The core of QO-SSC is a special structure of the SSC projection matrix which is obtained by concatenation of orthogonal submatrices. Concrete examples of Q...

Full description

Saved in:
Bibliographic Details
Published in2019 IEEE Global Communications Conference (GLOBECOM) pp. 1 - 6
Main Authors Perotti, Alberto G., Popovic, Branislav M.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.12.2019
Subjects
3GPP
Decoding
Error correction codes
Performance evaluation
Reliability
Transmitters
Upper bound
Online AccessGet full text

Cover

More Information
Summary:We introduce a new family of error correction codes based on sparse superposition called Quasi- Orthogonal} Sparse Superposition Codes (QO-SSC). The core of QO-SSC is a special structure of the SSC projection matrix which is obtained by concatenation of orthogonal submatrices. Concrete examples of QO-SCC constructions based on Zadoff- Chu sequences and Kerdock bent sequences are provided. A low-complexity iterative successive interference cancellation algorithm is proposed for QO-SSC decoding. Performance evaluations show that QO-SSC is an efficient solution for short- packet transmission at low signal-to-noise ratios, as it achieves lower block error rate than conventional coded modulation schemes, e.g., QPSK- modulated polar codes. As a further advantage, QO-SSC features a low PAPR when transmitted using OFDM waveforms.
ISSN:2576-6813
DOI:10.1109/GLOBECOM38437.2019.9013169