Name
Abstract | ||
|---|---|---|
This study proposes an enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity.Also, a logarithmic likelihood ratio-threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding. Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible trade-off between time complexity and computational complexity, while reducing storage space up to 70%. Based on the fact that most mobile devices operate in environments with stringent energy budget to support diverse applications, the proposed scheme is a promising candidate for meeting requirements of different applications while maintaining a low computational complexity and computing resource utilisation. |
Year | DOI | Venue |
|---|---|---|
2019 | 10.1049/iet-com.2018.5643 | IET Communications |
Keywords | DocType | Volume |
error correction codes,computational complexity,decoding | Journal | 13 |
Issue | ISSN | Citations |
14 | 1751-8628 | 0 |
PageRank | References | Authors |
0.34 | 0 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Haotian Zheng | 1 | 1 | 1.05 |
| Bin Chen | 2 | 36 | 7.19 |
| Luis F. Abanto-Leon | 3 | 0 | 2.03 |
| Zizheng Cao | 4 | 12 | 7.43 |
| A. M. J. Koonen | 5 | 149 | 32.10 |