Low-Density Parity-Check Codes and Spatial Coupling for Quantitative Group Testing
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2024
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866916210383257600 |
|---|---|
| author | Mashauri, Mgeni Makambi Amat, Alexandre Graell i Lentmaier, Michael |
| author_facet | Mashauri, Mgeni Makambi Amat, Alexandre Graell i Lentmaier, Michael |
| contents | A non-adaptive quantitative group testing (GT) scheme based on sparse codes-on-graphs in combination with low-complexity peeling decoding was introduced and analyzed by Karimi et al.. In this work, we propose a variant of this scheme based on low-density parity-check codes where the BCH codes at the constraint nodes are replaced by simple single parity-check codes. Furthermore, we apply spatial coupling to both GT schemes, perform a density evolution analysis, and compare their performance with and without coupling. Our analysis shows that both schemes improve with increasing coupling memory, and for all considered cases, it is observed that the LDPC code-based scheme substantially outperforms the original scheme. Simulation results for finite block length confirm the asymptotic density evolution thresholds. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2404_11463 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Low-Density Parity-Check Codes and Spatial Coupling for Quantitative Group Testing Mashauri, Mgeni Makambi Amat, Alexandre Graell i Lentmaier, Michael Information Theory A non-adaptive quantitative group testing (GT) scheme based on sparse codes-on-graphs in combination with low-complexity peeling decoding was introduced and analyzed by Karimi et al.. In this work, we propose a variant of this scheme based on low-density parity-check codes where the BCH codes at the constraint nodes are replaced by simple single parity-check codes. Furthermore, we apply spatial coupling to both GT schemes, perform a density evolution analysis, and compare their performance with and without coupling. Our analysis shows that both schemes improve with increasing coupling memory, and for all considered cases, it is observed that the LDPC code-based scheme substantially outperforms the original scheme. Simulation results for finite block length confirm the asymptotic density evolution thresholds. |
| title | Low-Density Parity-Check Codes and Spatial Coupling for Quantitative Group Testing |
| topic | Information Theory |
| url | https://arxiv.org/abs/2404.11463 |