Design and Analysis of a Low-Complexity Decoding Algorithm for Spinal Codes

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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE transactions on vehicular technology Ročník 68; číslo 5; s. 4667 - 4679
Hlavní autoři: Hu, Yingmeng, Liu, Rongke, Bian, Hongxiu, Lyu, Daiyi
Médium: Journal Article
Jazyk:angličtina
Vydáno: New York IEEE 01.05.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Binary system
capacity-achieving
Codes
Complexity
Complexity theory
Computer simulation
Data transmission
Decoding
Encoding
Heuristic algorithms
low decoding complexity
Maximum likelihood decoding
Parameter modification
rateless coding
Signal to noise ratio
spinal codes
Time-varying channels
Vehicle dynamics
ISSN:0018-9545, 1939-9359
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í: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.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0018-9545
1939-9359
DOI:10.1109/TVT.2019.2901495