DocumentCode :
742950
Title :
A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes
Author :
Weiqiang Yang ; Ying Li ; Xiaopu Yu ; Juan Li
Author_Institution :
State Key Lab. of ISN, Xidian Univ., Xi´an, China
Volume :
19
Issue :
7
fYear :
2015
fDate :
7/1/2015 12:00:00 AM
Firstpage :
1105
Lastpage :
1108
Abstract :
A forward stack decoding (FSD) algorithm for rateless 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 :
sequential decoding; trees (mathematics); FSD algorithm; bubble decoder; decoding tree; forward stack decoding algorithm; low complexity sequential decoding algorithm; rateless spinal codes; Algorithm design and analysis; Complexity theory; Encoding; Maximum likelihood decoding; Measurement; Signal to noise ratio; Rateless spinal codes; forward stack decoding algorithm; sequential decoding;
fLanguage :
English
Journal_Title :
Communications Letters, IEEE
Publisher :
ieee
ISSN :
1089-7798
Type :
jour
DOI :
10.1109/LCOMM.2015.2438062
Filename :
7113798
Link To Document :
بازگشت