eduzhai > Applied Sciences > Engineering >

Orthogonal Sparse Superposition Codes for Ultra-Reliable Low-Latency Communications

  • king
  • (0) Download
  • 20210506
  • Save

... pages left unread,continue reading

Document pages: 30 pages

Abstract: This paper presents a new class of sparse superposition codes for low-ratesand short-packet communications over the additive white Gaussian noise channel.The new code is orthogonal sparse superposition (OSS) code. A codeword of OSScodes is represented as a superposition of sparse sub-codewords whose supportsets are mutually non-overlapping. To construct such codewords in acomputationally efficient manner, a successive encoding method is presented.Harnessing the orthogonal property among sub-codewords, a simple yetnear-optimal decoding method is proposed, which performs element-wise maximum aposterior decoding with successive support set cancellation. This decoder issuper-fast by a linear decoding complexity in block lengths, far less than thecommercially used channel decoders for modern channel codes. The upper boundsfor the block error rates (BLERs) are analytically derived for few-layered OSScodes as a function of block lengths and code rates. It turns out that asingle-layered OSS code achieves the ultimate Shannon limit in thepower-limited regime, even with the linear complexity decoder. Via simulations,the proposed OSS codes are shown to perform better than commercially used codedmodulation techniques for low-rate and short-latency communication scenarios.

Please select stars to rate!

         

0 comments Sign in to leave a comment.

    Data loading, please wait...
×