Low-Complexity Block-Based Decoding Algorithms for Short Block Channels
Enregistré dans:
| Publié dans: | arXiv.org (Apr 15, 2024), p. n/a |
|---|---|
| Auteur principal: | |
| Autres auteurs: | |
| Publié: |
Cornell University Library, arXiv.org
|
| Sujets: | |
| Accès en ligne: | Citation/Abstract Full text outside of ProQuest |
| Tags: |
Pas de tags, Soyez le premier à ajouter un tag!
|
| Résumé: | This paper presents low-complexity block-based encoding and decoding algorithms for short block length channels. In terms of the precise use-case, we are primarily concerned with the baseline 3GPP Short block transmissions in which payloads are encoded by Reed-Muller codes and paired with orthogonal DMRS. In contemporary communication systems, the short block decoding often employs the utilization of DMRS-based least squares channel estimation, followed by maximum likelihood decoding. However, this methodology can incur substantial computational complexity when processing long bit length codes. We propose an innovative approach to tackle this challenge by introducing the principle of block/segment encoding using First-Order RM Codes which is amenable to low-cost decoding through block-based fast Hadamard transforms. The Block-based FHT has demonstrated to be cost-efficient with regards to decoding time, as it evolves from quadric to quasi-linear complexity with a manageable decline in performance. Additionally, by incorporating an adaptive DMRS/data power adjustment technique, we can bridge/reduce the performance gap and attain high sensitivity, leading to a good trade-off between performance and complexity to efficiently handle small payloads. |
|---|---|
| ISSN: | 2331-8422 |
| DOI: | 10.1109/AFRICON55910.2023.10293604 |
| Source: | Engineering Database |