Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding
Fuente:
arXiv
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910756765696000 |
|---|---|
| author | Griffin, Joseph Yuan, Peihong Duffy, Ken R. Medard, Muriel |
| author_facet | Griffin, Joseph Yuan, Peihong Duffy, Ken R. Medard, Muriel |
| contents | Guessing Codeword Decoding (GCD) is a recently proposed soft-input forward error correction decoder for arbitrary binary linear codes. Inspired by recent proposals that leverage binary linear codebook structure to reduce the number of queries made by Guessing Random Additive Noise Decoding (GRAND), for binary linear codes that include a full-message single parity-check (SPC) bit, we show that it is possible to reduce the number of queries made by GCD by a factor of up to 2 with the greatest guesswork reduction realized at lower SNRs, without impacting decoding precision. Codes without a full-message SPC can be modified to include one by changing a column of the generator matrix to obtain a decoding complexity advantage, and we demonstrate that this can often be done without losing decoding precision. To practically avail of the complexity advantage, a noise effect pattern generator capable of producing sequences for given Hamming weights, such as the landslide algorithm developed for ORBGRAND, is necessary. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2411_09803 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding Griffin, Joseph Yuan, Peihong Duffy, Ken R. Medard, Muriel Information Theory Guessing Codeword Decoding (GCD) is a recently proposed soft-input forward error correction decoder for arbitrary binary linear codes. Inspired by recent proposals that leverage binary linear codebook structure to reduce the number of queries made by Guessing Random Additive Noise Decoding (GRAND), for binary linear codes that include a full-message single parity-check (SPC) bit, we show that it is possible to reduce the number of queries made by GCD by a factor of up to 2 with the greatest guesswork reduction realized at lower SNRs, without impacting decoding precision. Codes without a full-message SPC can be modified to include one by changing a column of the generator matrix to obtain a decoding complexity advantage, and we demonstrate that this can often be done without losing decoding precision. To practically avail of the complexity advantage, a noise effect pattern generator capable of producing sequences for given Hamming weights, such as the landslide algorithm developed for ORBGRAND, is necessary. |
| title | Using a Single-Parity-Check to Reduce the Guesswork of Guessing Codeword Decoding |
| topic | Information Theory |
| url | https://arxiv.org/abs/2411.09803 |