Guardado en:
| Autores principales: | , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | https://arxiv.org/abs/2501.04307 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866915094574661632 |
|---|---|
| author | Xue, Jiajie Kurkoski, Brian M. |
| author_facet | Xue, Jiajie Kurkoski, Brian M. |
| contents | Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail decoding even when $R< C$. This paper presents a new retry decoding scheme for finite dimensional lattice-based transmissions. When decoding errors are detected, the receiver is allowed to adjust the value of decoding coefficients and retry decoding, instead of requesting a re-transmission immediately which causes high latency. This scheme is considered for both point-to-point single user transmission and compute-forward (CF) relaying with power unconstrained relays, by which a lower word error rate (WER) is achieved than conventional one-shot decoding with optimal coefficients. A lattice/lattice code construction, called CRC-embedded lattice/lattice code, is presented to provide physical layer error detection to enable retry decoding. For CF relaying, a shaping lattice design is given so that the decoder is able to detect errors from CF linear combinations without requiring individual users' messages. The numerical results show gains of up to 1.31 dB and 1.08 dB at error probability $10^{-5}$ for a 2-user CF relay using 128- and 256-dimensional lattice codes with optimized CRC length and 2 decoding trials in total. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2501_04307 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Finite Dimensional Lattice Codes with Self Error-Detection and Retry Decoding Xue, Jiajie Kurkoski, Brian M. Information Theory Lattice codes with optimal decoding coefficient are capacity-achieving when dimension $N \rightarrow \infty$. In communications systems, finite dimensional lattice codes are considered, where the optimal decoding coefficients may still fail decoding even when $R< C$. This paper presents a new retry decoding scheme for finite dimensional lattice-based transmissions. When decoding errors are detected, the receiver is allowed to adjust the value of decoding coefficients and retry decoding, instead of requesting a re-transmission immediately which causes high latency. This scheme is considered for both point-to-point single user transmission and compute-forward (CF) relaying with power unconstrained relays, by which a lower word error rate (WER) is achieved than conventional one-shot decoding with optimal coefficients. A lattice/lattice code construction, called CRC-embedded lattice/lattice code, is presented to provide physical layer error detection to enable retry decoding. For CF relaying, a shaping lattice design is given so that the decoder is able to detect errors from CF linear combinations without requiring individual users' messages. The numerical results show gains of up to 1.31 dB and 1.08 dB at error probability $10^{-5}$ for a 2-user CF relay using 128- and 256-dimensional lattice codes with optimized CRC length and 2 decoding trials in total. |
| title | Finite Dimensional Lattice Codes with Self Error-Detection and Retry Decoding |
| topic | Information Theory |
| url | https://arxiv.org/abs/2501.04307 |