TY - GEN
T1 - A Low Complexity Decoding Algorithm for Spinal Codes with Efficiently Distributed Symbols
AU - Hu, Yingmeng
AU - Liu, Rongke
AU - Kaushik, Aryan
AU - Shi, Xiaoyan
AU - Thompson, John
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/11/20
Y1 - 2018/11/20
N2 - A fast decoding algorithm with an efficientdistribution of symbols (EDS) for spinal codes is proposed in this paper. Firstly, the EDS decoder takes a grouping method to improve the efficiency of the distributed symbols through getting rid of the interference from the other groups. Then by taking the method of enhanced sequence decoding algorithm, the decoder has the ability to achieve dynamic search scope of nodes where it visits the flexible number of nodes in each decoding unit according to the real-time channel conditions. When compared with the Bubble algorithm, the unequal error protection (UEP) decoding algorithm, and the forward sequence decoding (FSD) algorithm, the proposed EDS algorithm obtains a better coding gain, significantly reduces the number of nodes visited, and achieves a rate (the bandwidth efficiency) closer to the capacity of the channel. Simulation results show that the rate of the proposed algorithm has a gain of 6%15% and the complexity decreases by more than 70% when compared with the Bubble algorithm for the signal-to-noise ratio (SNR) range of 0 30 dB.
AB - A fast decoding algorithm with an efficientdistribution of symbols (EDS) for spinal codes is proposed in this paper. Firstly, the EDS decoder takes a grouping method to improve the efficiency of the distributed symbols through getting rid of the interference from the other groups. Then by taking the method of enhanced sequence decoding algorithm, the decoder has the ability to achieve dynamic search scope of nodes where it visits the flexible number of nodes in each decoding unit according to the real-time channel conditions. When compared with the Bubble algorithm, the unequal error protection (UEP) decoding algorithm, and the forward sequence decoding (FSD) algorithm, the proposed EDS algorithm obtains a better coding gain, significantly reduces the number of nodes visited, and achieves a rate (the bandwidth efficiency) closer to the capacity of the channel. Simulation results show that the rate of the proposed algorithm has a gain of 6%15% and the complexity decreases by more than 70% when compared with the Bubble algorithm for the signal-to-noise ratio (SNR) range of 0 30 dB.
KW - low decoding complexity
KW - spinal codes
KW - time-varying channel
KW - wireless communications
UR - https://www.scopus.com/pages/publications/85059948554
U2 - 10.1109/AHS.2018.8541487
DO - 10.1109/AHS.2018.8541487
M3 - 会议稿件
AN - SCOPUS:85059948554
T3 - 2018 NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2018
SP - 184
EP - 191
BT - 2018 NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 NASA/ESA Conference on Adaptive Hardware and Systems, AHS 2018
Y2 - 6 August 2018 through 9 August 2018
ER -