A List-Decoding Approach to Low-Complexity Soft Maximum-Likelihood Decoding of Cyclic Codes

Yang, Hengjie; Liang, Ethan; Yao, Hanwen; Vardy, Alexander; Wesel, Richard D.

doi:10.1109/globecom38437.2019.9014092

Cited by 5 publications

(2 citation statements)

References 20 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

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

show abstract

“…Recently, convolutional codes concatenated with CRCs have shown excellent performance in short blocklength regimes [10]- [12]. Yang et al in [10] show that a tail-biting convolutional code (TBCC) concatenated with CRC can achieve FER performance very close to random short-blocklength RCU bound when the decoder implements the serial list Viterbi decoding (S-LVD) algorithm.…”

Section: Introductionmentioning

confidence: 99%

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

Wang¹,

Song²,

Areces³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

This paper applies probabilistic amplitude shaping (PAS) to a cyclic redundancy check (CRC) aided trellis coded modulation (TCM) to achieve the short-blocklength random coding union (RCU) bound. In the transmitter, the equally likely message bits are first encoded by distribution matcher to generate amplitude symbols with the desired distribution. The binary representations of the distribution matcher outputs are then encoded by a CRC. Finally, the CRC-encoded bits are encoded and modulated by Ungerboeck's TCM scheme, which consists of a systematic k 0 k 0 +1 tail-biting convolutional code and a mapping function that maps coded bits to channel signals with capacityachieving distribution. This paper proves that, for the proposed transmitter, the CRC bits have uniform distribution and that the channel signals have symmetric distribution. In the receiver, the serial list Viterbi decoding (S-LVD) is used to estimate the information bits. Simulation results show that, for the proposed CRC-TCM-PAS system with 87 input bits and 65-67 8-AM coded output symbols, the decoding performance under additive white Gaussian noise channel achieves the RCU bound with properly designed CRC and convolutional codes.

show abstract

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

Wang

Song

Areces

et al. 2022

ICC 2022 - IEEE International Conference on Communications

View full text Add to dashboard Cite

A List-Decoding Approach to Low-Complexity Soft Maximum-Likelihood Decoding of Cyclic Codes

Cited by 5 publications

References 20 publications

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

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

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

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

Contact Info

Product

Resources

About