Low-Density Parity-Check Codes and Spatial Coupling for Quantitative Group Testing
Abstract: 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.
- R. Dorfman, “The detection of defective members of large populations,” The Annals of Mathematical Statistics, vol. 14, no. 4, pp. 436–440, 1943.
- O. Gebhard, M. Hahn-Klimroth, D. Kaaser, and P. Loick, “Quantitative group testing in the sublinear regime,” CoRR, vol. abs/1905.01458, 2019. [Online]. Available: http://arxiv.org/abs/1905.01458
- T. Wadayama, “An analysis on non-adaptive group testing based on sparse pooling graphs,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Istanbul, Turkey, July 2013.
- K. Lee, R. Pedarsani, and K. Ramchandran, “SAFFRON: A fast, efficient, and robust framework for group testing based on sparse-graph codes,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), Barcelona, Spain, July 2016.
- A. Vem, N. T. Janakiraman, and K. R. Narayanan, “Group testing using left-and-right-regular sparse-graph codes,” CoRR, vol. abs/1701.07477, 2017. [Online]. Available: http://arxiv.org/abs/1701.07477
- E. Karimi, F. Kazemi, A. Heidarzadeh, K. R. Narayanan, and A. Sprintson, “Sparse graph codes for non-adaptive quantitative group testing,” in 2019 IEEE Inf. Theory Workshop (ITW), 2019.
- ——, “Non-adaptive quantitative group testing using irregular sparse graph codes,” in Proc. 52nd Annu. Allerton Conf. Commun., Control, Comput. (Allerton), Sep. 2019.
- M. Lentmaier, A. Sridharan, D. J. Costello, Jr., and K. S. Zigangirov, “Iterative decoding threshold analysis for LDPC convolutional codes,” IEEE Trans. Inf. Theory, vol. 56, no. 10, pp. 5274–5289, Oct. 2010.
- S. Kudekar, T. J. Richardson, and R. L. Urbanke, “Threshold saturation via spatial coupling: Why convolutional LDPC ensembles perform so well over the BEC,” IEEE Trans. Inf. Theory, vol. 57, no. 2, pp. 803–834, Feb. 2011.
- D. G. M. Mitchell, P. M. Olmos, M. Lentmaier, and D. J. Costello, “Spatially coupled generalized LDPC codes: Asymptotic analysis and finite length scaling,” IEEE Trans. Inf. Theory, vol. 67, no. 6, pp. 3708–3723, 2021.
- P. S. Nguyen, A. Yedla, H. D. Pfister, and K. R. Narayanan, “Threshold saturation of spatially-coupled codes on intersymbol-interference channels,” in Proc. IEEE Intl. Conf. Commun. (ICC), Ottawa, Canada, June 2012.
- M. M. Mashauri, A. Graell i Amat, and M. Lentmaier, “On the universality of spatially coupled LDPC codes over intersymbol interference channels,” in Proc. IEEE Information Theory Workshop (ITW), Kanazawa, Japan, Oct. 2021.
- A. R. Iyengar, M. Papaleo, P. H. Siegel, J. K. Wolf, A. Vanelli-Coralli, and G. E. Corazza, “Windowed decoding of protograph-based LDPC convolutional codes over erasure channels,” IEEE Trans. Inf. Theory, vol. 58, no. 4, pp. 2303–2320, Apr. 2012.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.