An Optimised GRAND Based on Cyclic Codebook.

Gespeichert in:
Bibliographische Detailangaben
Titel: An Optimised GRAND Based on Cyclic Codebook.
Autoren: Xue, Xiaona, Zhou, Zhigang, Ni, Jiangong, Chen, Gang
Quelle: Electronics Letters (Wiley-Blackwell); Jan2025, Vol. 61 Issue 1, p1-4, 4p
Schlagwörter: COMPUTER storage capacity, BIT error rate, CYCLIC codes, EMPIRICAL research, DECODING algorithms
Abstract: The cyclic codebook‐GRAND (CC‐GRAND) algorithm was proposed to address the issue of significant increases in storage capacity with code length in the GRAND algorithm, which uses a cyclic generation codebook to reduce codebook capacity. The simulation results show that the algorithm achieves the same bit error rate (BER) performance as the maximum likelihood decoding algorithm, while effectively reducing the codebook capacity. [ABSTRACT FROM AUTHOR]
Copyright of Electronics Letters (Wiley-Blackwell) is the property of Wiley-Blackwell and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Datenbank: Complementary Index
Beschreibung
Abstract:The cyclic codebook‐GRAND (CC‐GRAND) algorithm was proposed to address the issue of significant increases in storage capacity with code length in the GRAND algorithm, which uses a cyclic generation codebook to reduce codebook capacity. The simulation results show that the algorithm achieves the same bit error rate (BER) performance as the maximum likelihood decoding algorithm, while effectively reducing the codebook capacity. [ABSTRACT FROM AUTHOR]
ISSN:00135194
DOI:10.1049/ell2.70271