{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T13:41:51Z","timestamp":1761745311480,"version":"3.37.3"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T00:00:00Z","timestamp":1600646400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Wireless Com Network"],"published-print":{"date-parts":[[2020,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We propose a method to substantially reduce the computational complexity of iterative decoders of low-density parity-check (LDPC) codes which are based on the weighted bit-flipping (WBF) algorithm. In this method, the WBF-based decoders are modified so that the flipping function is calculated only over a reduced set of variable nodes. An explicit expression for the achieved complexity gain is provided and it is shown that for a code of block length <jats:italic>N<\/jats:italic>, the decoding complexity is reduced from <jats:italic>O<\/jats:italic>(<jats:italic>N<\/jats:italic><jats:sup>2<\/jats:sup>) to <jats:italic>O<\/jats:italic>(<jats:italic>N<\/jats:italic>). Moreover, we derive an upper bound for the difference in the frame error rate of the reduced-set decoders and the original WBF-based decoders, and it is shown that the error performances of the two decoders are essentially the same.<\/jats:p>","DOI":"10.1186\/s13638-020-01791-5","type":"journal-article","created":{"date-parts":[[2020,9,21]],"date-time":"2020-09-21T12:03:26Z","timestamp":1600689806000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms"],"prefix":"10.1186","volume":"2020","author":[{"given":"Sadjad","family":"Haddadi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9383-8475","authenticated-orcid":false,"given":"Mahmoud","family":"Farhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa","family":"Derakhtian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,9,21]]},"reference":[{"issue":"1","key":"1791_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1109\/TIT.1962.1057683","volume":"8","author":"R. Gallager","year":"1962","unstructured":"R. Gallager, Low-density parity-check codes. IRE Trans. Inf. Theory. 8(1), 21\u201328 (1962).","journal-title":"IRE Trans. Inf. Theory"},{"issue":"7","key":"1791_CR2","doi-asserted-by":"publisher","first-page":"2711","DOI":"10.1109\/18.959255","volume":"47","author":"Y. Kou","year":"2001","unstructured":"Y. Kou, S. Lin, M. P. Fossorier, Low-density parity-check codes based on finite geometries: a rediscovery and new results. IEEE Trans. Inf. Theory. 47(7), 2711\u20132736 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"2","key":"1791_CR3","doi-asserted-by":"publisher","first-page":"619","DOI":"10.1109\/18.910578","volume":"47","author":"T. Richardson","year":"2001","unstructured":"T. Richardson, M. Shokrollahi, R. Urbanke, Design of capacity-approaching irregular low-density parity-check codes. IEEE Trans. Inf. Theory. 47(2), 619\u2013637 (2001).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1791_CR4","volume-title":"Error control coding","author":"S. Lin","year":"2004","unstructured":"S. Lin, D. J. Costello, Error control coding (Pearson Education India, Upper Saddle River, 2004)."},{"key":"1791_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803253","volume-title":"Channel codes: classical and modern","author":"W. Ryan","year":"2009","unstructured":"W. Ryan, S. Lin, Channel codes: classical and modern (Cambridge University Press, Cambridge, 2009)."},{"issue":"23","key":"1791_CR6","doi-asserted-by":"publisher","first-page":"5069","DOI":"10.1109\/JLT.2017.2766978","volume":"35","author":"A. Sheikh","year":"2017","unstructured":"A. Sheikh, A. G. i Amat, G. Liva, Achievable information rates for coded modulation with hard decision decoding for coherent fiber-optic systems. J. Light. Technol.35(23), 5069\u20135078 (2017).","journal-title":"J. Light. Technol."},{"key":"1791_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-5569-2","volume-title":"Coding for optical channels","author":"I. Djordjevic","year":"2010","unstructured":"I. Djordjevic, W. Ryan, B. Vasic, Coding for optical channels (Springer, New York, 2010)."},{"key":"1791_CR8","first-page":"1","volume-title":"2018 IEEE International Symposium on Circuits and Systems (ISCAS)","author":"F. Ghaffari","year":"2018","unstructured":"F. Ghaffari, B. Vasic, in 2018 IEEE International Symposium on Circuits and Systems (ISCAS). Probabilistic gradient descent bit-flipping decoders for flash memory channels (IEEEFlorence, 2018), pp. 1\u20135."},{"key":"1791_CR9","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.1109\/SSD.2018.8570595","volume-title":"2018 15th International Multi-Conference on Systems, Signals & Devices (SSD)","author":"K. Le","year":"2018","unstructured":"K. Le, F. Ghaffari, in 2018 15th International Multi-Conference on Systems, Signals & Devices (SSD). On the use of hard-decision LDPC decoders on MLC NAND flash memory (IEEEHammamet, 2018), pp. 1453\u20131458."},{"key":"1791_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-02556-8","volume-title":"QC-LDPC code-based cryptography","author":"M. Baldi","year":"2014","unstructured":"M. Baldi, QC-LDPC code-based cryptography (Springer, Heidelberg, 2014)."},{"issue":"9","key":"1791_CR11","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1109\/LCOMM.2002.803481","volume":"6","author":"A. Nouh","year":"2002","unstructured":"A. Nouh, A. H. Banihashemi, Bootstrap decoding of low-density parity-check codes. IEEE Commun. Lett.6(9), 391\u2013393 (2002).","journal-title":"IEEE Commun. Lett."},{"issue":"3","key":"1791_CR12","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/LCOMM.2004.825737","volume":"8","author":"J. Zhang","year":"2004","unstructured":"J. Zhang, M. P. Fossorier, A modified weighted bit-flipping decoding of low-density parity-check codes. IEEE Commun. Lett.8(3), 165\u2013167 (2004).","journal-title":"IEEE Commun. Lett."},{"issue":"21","key":"1791_CR13","doi-asserted-by":"publisher","first-page":"1356","DOI":"10.1049\/el:20046400","volume":"40","author":"F. Guo","year":"2004","unstructured":"F. Guo, L. Hanzo, Reliability ratio based weighted bit-flipping decoding for low-density parity-check codes. Electron. Lett.40(21), 1356\u20131358 (2004).","journal-title":"Electron. Lett."},{"issue":"13","key":"1791_CR14","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1049\/el:20051060","volume":"41","author":"C. -H. Lee","year":"2005","unstructured":"C. -H. Lee, W. Wolf, Implementation-efficient reliability ratio based weighted bit-flipping decoding for LDPC codes. Electron. Lett.41(13), 755\u2013757 (2005).","journal-title":"Electron. Lett."},{"issue":"9","key":"1791_CR15","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1109\/LCOMM.2005.1506712","volume":"9","author":"M. Jiang","year":"2005","unstructured":"M. Jiang, C. Zhao, Z. Shi, Y. Chen, An improvement on the modified weighted bit flipping decoding algorithm for LDPC codes. IEEE Commun. Lett.9(9), 814\u2013816 (2005).","journal-title":"IEEE Commun. Lett."},{"key":"1791_CR16","first-page":"2713","volume-title":"Communications, 2003. ICC\u201903. IEEE International Conference On","author":"Z. Liu","year":"2003","unstructured":"Z. Liu, D. A. Pados, in Communications, 2003. ICC\u201903. IEEE International Conference On, 4. Low complexity decoding of finite geometry LDPC codes (IEEEAnchorage, 2003), pp. 2713\u20132717."},{"issue":"6","key":"1791_CR17","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1049\/ip-com:20045118","volume":"152","author":"M. Shan","year":"2005","unstructured":"M. Shan, C. Zhao, M. Jiang, Improved weighted bit-flipping algorithm for decoding LDPC codes. IEE Proc. Commun.152(6), 919\u2013922 (2005).","journal-title":"IEE Proc. Commun."},{"issue":"11","key":"1791_CR18","doi-asserted-by":"publisher","first-page":"3950","DOI":"10.1109\/TCOMM.2015.2469780","volume":"63","author":"T. C. -Y. Chang","year":"2015","unstructured":"T. C. -Y. Chang, Y. T. Su, Dynamic weighted bit-flipping decoding algorithms for LDPC codes. IEEE Trans. Commun.63(11), 3950\u20133963 (2015).","journal-title":"IEEE Trans. Commun."},{"issue":"4","key":"1791_CR19","doi-asserted-by":"publisher","first-page":"1594","DOI":"10.1109\/TIT.2005.844095","volume":"51","author":"N. Miladinovic","year":"2005","unstructured":"N. Miladinovic, M. P. Fossorier, Improved bit-flipping decoding of low-density parity-check codes. IEEE Trans. Inf. Theory. 51(4), 1594\u20131606 (2005).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"9","key":"1791_CR20","doi-asserted-by":"publisher","first-page":"857","DOI":"10.1109\/LCOMM.2010.072310.100599","volume":"14","author":"J. Cho","year":"2010","unstructured":"J. Cho, W. Sung, Adaptive threshold technique for bit-flipping decoding of low-density parity-check codes. IEEE Commun. Lett.14(9), 857\u2013859 (2010).","journal-title":"IEEE Commun. Lett."},{"issue":"8","key":"1791_CR21","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1109\/LCOMM.2007.070269","volume":"11","author":"X. Wu","year":"2007","unstructured":"X. Wu, C. Zhao, X. You, Parallel weighted bit-flipping decoding. IEEE Commun. Lett.11(8), 671\u2013673 (2007).","journal-title":"IEEE Commun. Lett."},{"issue":"5","key":"1791_CR22","doi-asserted-by":"publisher","first-page":"979","DOI":"10.1109\/LCOMM.2017.2656119","volume":"21","author":"J. Jung","year":"2017","unstructured":"J. Jung, I. -C. Park, Multi-bit flipping decoding of LDPC codes for NAND storage systems. IEEE Commun. Lett.21(5), 979\u2013982 (2017).","journal-title":"IEEE Commun. Lett."},{"issue":"14","key":"1791_CR23","doi-asserted-by":"publisher","first-page":"1517","DOI":"10.1049\/iet-com.2013.0052","volume":"7","author":"T. -C. Chen","year":"2013","unstructured":"T. -C. Chen, Adaptive-weighted multibit-flipping decoding of low-density parity-check codes based on ordered statistics. IET Communications. 7(14), 1517\u20131521 (2013).","journal-title":"IET Communications"},{"issue":"5","key":"1791_CR24","doi-asserted-by":"publisher","first-page":"874","DOI":"10.1109\/LCOMM.2018.2809718","volume":"22","author":"J. Oh","year":"2018","unstructured":"J. Oh, J. Ha, A two-bit weighted bit-flipping decoding algorithm for LDPC codes. IEEE Commun. Lett.22(5), 874\u2013877 (2018).","journal-title":"IEEE Commun. Lett."},{"issue":"4","key":"1791_CR25","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.aeue.2008.11.018","volume":"64","author":"M. Esmaeili","year":"2010","unstructured":"M. Esmaeili, M. Tadayon, T. Gulliver, Low-complexity girth-8 high-rate moderate length QC-LDPC codes. AEU-Int. J. Electron. Commun.64(4), 360\u2013365 (2010).","journal-title":"AEU-Int. J. Electron. Commun."},{"key":"1791_CR26","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/j.aeue.2017.02.009","volume":"74","author":"M. Gholami","year":"2017","unstructured":"M. Gholami, M. Alinia, Z. Rahimi, An explicit method for construction of CTBC codes with girth 6. AEU-Int. J. Electron. Commun.74:, 183\u2013191 (2017).","journal-title":"AEU-Int. J. Electron. Commun."},{"key":"1791_CR27","unstructured":"D. MacKay, Encyclopedia of sparse graph codes (2020). http:\/\/www.inference.phy.cam.ac.uk\/mackay\/codes\/data.html. Accessed May 2020."},{"key":"1791_CR28","first-page":"995","volume-title":"Proc. IEEE GLOBECOM Conf.","author":"X. -Y. Hu","year":"2001","unstructured":"X. -Y. Hu, E. Eleftheriou, D. -M. Arnold, in Proc. IEEE GLOBECOM Conf.Progressive edge-growth tanner graphs (IEEESan Antonio, TX, 2001), pp. 995\u20131001."},{"key":"1791_CR29","unstructured":"CCSDS 131.1-O-2, Low Density Parity Check Codes for Use in Near-Earth and Deep Space Applications. The Consultative Committee for Space Data Systems, Orange book, Issue 2, September 2007 (2007)."}],"container-title":["EURASIP Journal on Wireless Communications and Networking"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-020-01791-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13638-020-01791-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13638-020-01791-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,9,20]],"date-time":"2021-09-20T23:47:46Z","timestamp":1632181666000},"score":1,"resource":{"primary":{"URL":"https:\/\/jwcn-eurasipjournals.springeropen.com\/articles\/10.1186\/s13638-020-01791-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,21]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2020,12]]}},"alternative-id":["1791"],"URL":"https:\/\/doi.org\/10.1186\/s13638-020-01791-5","relation":{},"ISSN":["1687-1499"],"issn-type":[{"type":"electronic","value":"1687-1499"}],"subject":[],"published":{"date-parts":[[2020,9,21]]},"assertion":[{"value":"22 December 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"21 September 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"180"}}