Abstract
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.
| Original language | English |
|---|---|
| Article number | 8653979 |
| Pages (from-to) | 4667-4679 |
| Number of pages | 13 |
| Journal | IEEE Transactions on Vehicular Technology |
| Volume | 68 |
| Issue number | 5 |
| DOIs | |
| State | Published - May 2019 |
Keywords
- Time-varying channels
- capacity-achieving
- low decoding complexity
- rateless coding
- spinal codes
Fingerprint
Dive into the research topics of 'Design and Analysis of a Low-Complexity Decoding Algorithm for Spinal Codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver