.png){kind=icon}
Return
Design and Analysis of a Low-Complexity Decoding Algorithm for Spinal Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/TVT.2019.2901495.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In order to facilitate reliable and efficient data transmission in time-varying environments, a block dynamic decoding algorithm for spinal codes is proposed in this paper. First, the code tree is divided into several decoding units to scatter the decoding complexity. According to the results of the last decoding, the decoder will modify the scope of nodes accessed with dynamic parameters, which improves the execution efficiency of the algorithm. Furthermore, the complexity and related parameters of the algorithm are analyzed and verified by some simulations. The results show that the proposed algorithm has the ability to enhance the bandwidth efficiency (or rate) performance, and to reduce both complexity and frame error rate.
Keywords:
Time-varying channels
rateless coding
spinal codes
capacity-achieving
low decoding complexity
Journal
IF:
7.1
Papers:
1.8W
Citations:
6.6W
Organization
Cited Papers
ShareSaveShareSaveShareSave
ShareSaveStructural Basis of the Ferrous Iron Specificity of the Yeast Ferroxidase, Fet3p.png)
Biochemistry
BiochemistryIF0
PREAI
ShareSaveShareSave
View more