.png){kind=icon}
Return
A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes
.png){kind=icon}
PRE
AI
DOI：10.1109/LCOMM.2015.2438062.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
A forward stack decoding (FSD) algorithm for rate-less spinal codes is proposed in this letter. This decoding algorithm divides the decoding tree of the spinal code into several layers, and then searches the decoding paths in each single layer. Compared with the bubble decoder, which was initially designed for spinal codes, the proposed FSD algorithm can decrease the complexity significantly without sacrificing the rate performance. We also illustrate that the complexity of the FSD algorithm decreases with the increase of the signal-to-noise ratio (SNR). Simulation shows that the complexity of the FSD algorithm is only 15.37% of that of the bubble decoder when SNR is 20 dB.
Keywords:
Rateless spinal codes
sequential decoding
forward stack decoding algorithm
Journal
IF:
4.4
Papers:
1.3W
Citations:
2.4W
Organization
Cited Papers
Nanostructured hybrid NiFeOOH/CNT electrocatalysts for oxygen evolution reaction with low overpotential.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSaveShareSaveStructural Basis of the Ferrous Iron Specificity of the Yeast Ferroxidase, Fet3pBiochemistry
BiochemistryIF0
PREAI
ShareSaveShareSave
ShareSaveShareSave
no more
no more