A Low Complexity Sequential Decoding Algorithm for Rateless Spinal Codes

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 de...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE communications letters Ročník 19; číslo 7; s. 1105 - 1108
Hlavní autoři: Yang, Weiqiang, Li, Ying, Yu, Xiaopu, Li, Juan
Médium: Journal Article
Jazyk:angličtina
Vydáno: IEEE 01.07.2015
Témata:
Algorithm design and analysis
Complexity theory
Encoding
forward stack decoding algorithm
Maximum likelihood decoding
Measurement
Rateless spinal codes
sequential decoding
Signal to noise ratio
forward stack decoding algorithm
sequential decoding
Rateless spinal codes
ISSN:1089-7798
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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.
ISSN:1089-7798
DOI:10.1109/LCOMM.2015.2438062