Return
Improved Block Oriented Unit Memory Convolutional Codes
DOI:10.1109/TCOMM.2021.3111605.png)
Abstract
En 中文
This paper is concerned with a special class of unit memory convolutional codes (UMCCs), called block oriented UMCCs (BOUMCCs). Distinguished from conventional UMCCs, which usually have small constraint lengths, the BOUMCCs have relatively large constraint lengths. We conduct the performance analysis by assuming a first-order Markov model, which indicates that the performance of the BOUMCCs depends critically on both the error propagation and the sub-frame error rate of the first layer. The error propagation can be alleviated by the use of partial superposition, which is specified by a superposition matrix with a fraction of columns being nulled. Given a superposition fraction, we propose a tree growing and pruning algorithm (TGPA) with a tunable sliding window, which provides a convenient way to trade off the decoding delay and the performance. We also present a structured construction and show by simulation that there is no performance degradation compared with random construction. Numerical results also show that, by taking the TBCCs as basic codes, the performance of BOUMCCs with TGPA is comparable to that of other short codes but with a more flexible construction or a lower complexity.
Keywords:
Codes
Decoding
Encoding
Convolutional codes
Windows
Complexity theory
Error analysis
Error-propagation
partial superposition
ultra-reliable and low latency communication (URLLC)
unit memory convolutional code
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
8.3
Papers:
1.2W
Citations:
3.6W
Organization
Cited Papers
The Innovative FlexPlan Grid-Planning Methodology: How Storage and Flexible Resources Could Help in De-Bottlenecking the European System
Energies
IF0

