Sammanfattning
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.
Originalspråk | engelska |
---|---|
Titel på värdpublikation | IEEE International Symposium on Information Theory (ISIT |
Förlag | IEEE - Institute of Electrical and Electronics Engineers Inc. |
ISBN (elektroniskt) | 978-1-6654-7554-9 |
ISBN (tryckt) | 978-1-6654-7555-6 |
DOI | |
Status | Published - 2023 |
Evenemang | 2023 International Symposium on Information Theory - Taipei, Taiwan Varaktighet: 2023 juni 25 → 2023 juni 30 |
Konferens
Konferens | 2023 International Symposium on Information Theory |
---|---|
Förkortad titel | ISIT 2023 |
Land/Territorium | Taiwan |
Ort | Taipei |
Period | 2023/06/25 → 2023/06/30 |
Ämnesklassifikation (UKÄ)
- Telekommunikation