Achieving Short-Blocklength RCU Bound via CRC List Decoding of TCM with Probabilistic Shaping

Wang, Linfang; Song, Dan; Areces, Felipe; Wesel, Richard D.

doi:10.1109/icc45855.2022.9838498

Cited by 6 publications

(1 citation statement)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the short block length regime, concatenating an inner convolutional code with an outer CRC code (referred to hereafter as ''CRC+CC'') with moderate/small memory has shown remarkable performance, closely approaching finite block length bounds [8] even at low error rates, while maintaining doable decoding complexity [4]. Extensive research has been conducted on CRC+CC schemes [1], [4], [9], [10], [11], [12], [13], [14], [15], [16], [17], [18], [19], [20], [21].…”

Section: Introductionmentioning

confidence: 99%

Performance Improvement of Space Missions Using Convolutional Codes by CRC-Aided List Viterbi Algorithms

2023

View full text Add to dashboard Cite

We analyze the performance of enhanced spread spectrum Aloha (E-SSA) in the framework of unsourced multiple access (UMAC). The asynchronous, unframed transmission of E-SSA is modified to enable a direct comparison with framed UMAC schemes, as well as with the Polyanskiy's achievability bound. The design of E-SSA is tailored to the peculiarities of the UMAC setting, resorting to short polar codes and the use of a timing channel to improve the energy efficiency of the protocol. We assess the impact of the preamble length and of the spreading factor on the system efficiency. The resulting scheme exhibits simplicity at the transmitter and linear complexity with respect to the number of active users at the receiver, approaching the UMAC achievability bound in close competition with the best known UMAC schemes.

show abstract