List-Decoded Tail-Biting Convolutional Codes with Distance-Spectrum Optimal CRCS for 5G

Liang, Ethan; Yang, Hengjie; Wesel, Richard D.

doi:10.1109/globecom38437.2019.9013767

Cited by 15 publications

(14 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…We see that the LLRs Λ ℓ (v (1) ) calculated by (7) match with the channel if and only if the candidate v(0) ℓ is correct. In the case when v(0) ℓ is erroneous, the mismatch can be roughly measured by the weight of binary interference ∆v(I + RS, R), where ∆v = v(0) ℓ + v (0) = 0.…”

Section: B Decodingmentioning

confidence: 86%

“…• List Decoding: For 1 ℓ ℓ max , 1) Employ the list decoding algorithm of the basic code, resulting in the ℓ-th list decoding output v(0) ℓ . 2) Compute the LLRs of v (1) given by (7).…”

Section: Algorithm 2: Successive Cancellation List Decoding Of Tpstmentioning

confidence: 99%

“…However, it suffers from a high decoding complexity. To reduce the decoding complexity, TBCCs are designed by concatenating with cyclic redundancy checks (CRCs) [7]. The TBCC with CRC has been adopted in the Long-Term Evolution (LTE) standard, where the outer concatenated CRC can be viewed as an error detector for identifying the correct candidate codeword in the decoding list [8].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Twisted-Pair Superposition Transmission

Cai¹,

Ma²

2021

Preprint

View full text Add to dashboard Cite

We propose in this paper a new coding scheme called twisted-pair superposition transmission (TPST).The encoding is to "mix together" a pair of basic codes by superposition, while the decoding can be implemented as a successive cancellation list decoding algorithm. The most significant features of the TPST code are its predictable performance that can be estimated numerically from the basic codes and its flexible construction in the sense that it can be easily adapted to different coding rates. To construct good TPST codes in the finite length regime, we propose two design approaches -rate allocation and partial superposition. By taking tail-biting convolutional codes (TBCC) as basic codes, we show by numerical results that the TPST codes can have near-capacity performance in the short length regime.

show abstract

Section: B Decodingmentioning

confidence: 86%

Section: Algorithm 2: Successive Cancellation List Decoding Of Tpstmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Twisted-Pair Superposition Transmission

Cai¹,

Ma²

2021

Preprint

View full text Add to dashboard Cite

show abstract

Section: Introductionmentioning

confidence: 99%

“…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. This paper CRC-TCM-PAS architecture, which applies probabilistic amplitude shaping to a cyclic redundancy check aided trellis coded modulation to achieve the short-blocklength RCU bound.…”

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

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

List-Decoded Tail-Biting Convolutional Codes with Distance-Spectrum Optimal CRCS for 5G

Cited by 15 publications

References 18 publications

Twisted-Pair Superposition Transmission

Twisted-Pair Superposition Transmission

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

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

Contact Info

Product

Resources

About