Name
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
<italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">rate</italic>
) performance, and to reduce both complexity and frame error rate. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1109/TVT.2019.2901495 | IEEE Transactions on Vehicular Technology |
Keywords | DocType | Volume |
Complexity theory,Heuristic algorithms,Encoding,Maximum likelihood decoding,Signal to noise ratio,Vehicle dynamics | Journal | 68 |
Issue | ISSN | Citations |
5 | 0018-9545 | 3 |
PageRank | References | Authors |
0.47 | 0 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yingmeng Hu | 1 | 3 | 2.16 |
| Rongke Liu | 2 | 127 | 35.79 |
| Hongxiu Bian | 3 | 3 | 1.82 |
| Daiyi Lyu | 4 | 3 | 0.47 |