{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T16:34:50Z","timestamp":1772642090707,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T00:00:00Z","timestamp":1658448000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"EPFL Lausanne"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sign Process Syst"],"published-print":{"date-parts":[[2022,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents an ultra-high-throughput decoder architecture for NB-LDPC codes based on the Hybrid Extended Min-Sum algorithm. We introduce a new processing block that updates a check node and its associated variable nodes in a fully pipelined way, thus allowing the decoder to process one row of the parity check matrix per clock cycle. The work specifically focuses on a rate 5\/6 code of size (<jats:italic>N<\/jats:italic>, <jats:italic>K<\/jats:italic>) = (144, 120) symbols over GF(64). The synthesis results on a 28-nm technology show that for a 0.789 M NAND-gates complexity complexity, the architecture reaches a decoding throughput of 0.9 Gbps with 30 decoding iterations. Compared to the 5G binary LDPC code of the same size and code rate, the proposed architecture offers a gain of 0.3 dB at a Frame Error Rate of <jats:inline-formula><jats:alternatives><jats:tex-math>$$10^{-3}$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:msup>\n                    <mml:mn>10<\/mml:mn>\n                    <mml:mrow>\n                      <mml:mo>-<\/mml:mo>\n                      <mml:mn>3<\/mml:mn>\n                    <\/mml:mrow>\n                  <\/mml:msup>\n                <\/mml:math><\/jats:alternatives><\/jats:inline-formula>.<\/jats:p>","DOI":"10.1007\/s11265-022-01795-y","type":"journal-article","created":{"date-parts":[[2022,7,22]],"date-time":"2022-07-22T15:02:54Z","timestamp":1658502174000},"page":"1031-1045","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Ultra-High-Throughput EMS NB-LDPC Decoder with Full-Parallel Node Processing"],"prefix":"10.1007","volume":"94","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0601-8901","authenticated-orcid":false,"given":"Hassan","family":"Harb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali Chamas Al","family":"Ghouwayel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laura","family":"Conde-Canencia","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Marchand","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Emmanuel","family":"Boutillon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,7,22]]},"reference":[{"key":"1795_CR1","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1109\/4234.681360","volume":"2","author":"MC Davey","year":"1998","unstructured":"Davey, M. C., & MacKay, D. J. C. (1998). Low density parity check codes over GF(q). IEEE Communications Letters, 2, 159\u2013166.","journal-title":"IEEE Communications Letters"},{"key":"1795_CR2","unstructured":"Pfletschinger, S., Mourad, A., Lopez, E., Declercq, D., & Bacci, G. (2009). Performance evaluation of non-binary LDPC codes on wireless channels. In Proceedings of ICT Mobile Summit. Santander, Spain."},{"key":"1795_CR3","unstructured":"Declercq, D., Colas, M., spsampsps Gelle, G. (2004). Regular GF$$(2^q)$$-LDPC coded modulations for higher order QAM-AWGN channel. Parma, Italy: In Proceeding International Symposium on Information Theory and its Applications."},{"key":"1795_CR4","doi-asserted-by":"publisher","first-page":"2644","DOI":"10.1109\/TCSI.2013.2279186","volume":"60","author":"E Boutillon","year":"2013","unstructured":"Boutillon, E., Conde-Canencia, L., & Ghouwayel, A. A. (2013). Design of a GF(64)-LDPC decoder based on the EMS algorithm. IEEE Transactions on Circuits and Systems I: Regular Papers, 60, 2644\u20132656.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"1795_CR5","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1109\/4234.681360","volume":"2","author":"M Davey","year":"1998","unstructured":"Davey, M., & MacKay, D. (1998). Low-density parity check codes over GF(q). Communications Letters, IEEE, 2, 165\u2013167.","journal-title":"Communications Letters, IEEE"},{"key":"1795_CR6","volume-title":"Evaluation of Gallager codes for short block length and high rate applications","author":"DJC MacKay","year":"1999","unstructured":"MacKay, D. J. C., & Davey, M. (1999). Evaluation of Gallager codes for short block length and high rate applications. In Proc: IMA Workshop Codes, Syst., Graphical Models."},{"key":"1795_CR7","doi-asserted-by":"publisher","first-page":"464","DOI":"10.1109\/JSSC.2014.2362854","volume":"50","author":"YS Park","year":"2015","unstructured":"Park, Y. S., Tao, Y., & Zhang, Z. (2015). A fully parallel nonbinary LDPC decoder with fine-grained dynamic clock gating. IEEE Journal of Solid-State Circuits, 50, 464\u2013475.","journal-title":"IEEE Journal of Solid-State Circuits"},{"key":"1795_CR8","doi-asserted-by":"crossref","unstructured":"Cai, F., & Zhang, X. (2013). Relaxed min-max decoder architectures for nonbinary low-density parity-check codes. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 21, 2010\u20132023.","DOI":"10.1109\/TVLSI.2012.2226920"},{"key":"1795_CR9","doi-asserted-by":"publisher","first-page":"161520","DOI":"10.1109\/ACCESS.2021.3131729","volume":"9","author":"W-X Chu","year":"2021","unstructured":"Chu, W.-X., Hu, T.-A., Lee, H.-C., Li, M.-R., & Ueng, Y.-L. (2021). An efficient short high-order non-binary ldpc decoder architecture using a message-adaptation ems algorithm. IEEE Access, 9, 161520\u2013161532.","journal-title":"IEEE Access"},{"key":"1795_CR10","doi-asserted-by":"publisher","first-page":"20302","DOI":"10.1109\/ACCESS.2019.2896012","volume":"7","author":"M-R Li","year":"2019","unstructured":"Li, M.-R., Chu, W.-X., Lee, H.-C., & Ueng, Y.-L. (2019). An efficient high-rate non-binary ldpc decoder architecture with early termination. IEEE Access, 7, 20302\u201320315.","journal-title":"IEEE Access"},{"key":"1795_CR11","doi-asserted-by":"publisher","first-page":"2940","DOI":"10.1109\/TSP.2013.2256905","volume":"61","author":"Y-L Ueng","year":"2013","unstructured":"Ueng, Y.-L., Liao, K.-H., Chou, H.-C., & Yang, C.-J. (2013). A high-throughput trellis-based layered decoding architecture for non-binary ldpc codes using max-log-qspa. IEEE Transactions on Signal Processing, 61, 2940\u20132951.","journal-title":"IEEE Transactions on Signal Processing"},{"key":"1795_CR12","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TCOMM.2007.894088","volume":"55","author":"D Declercq","year":"2007","unstructured":"Declercq, D., & Fossorier, M. (2007a). Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Trans. Comm., 55, 633\u2013643.","journal-title":"IEEE Trans. Comm."},{"key":"1795_CR13","doi-asserted-by":"crossref","unstructured":"Voicila, A., Declercq, D., Verdier, F., Fossorier, M., & Urard, P. (2007). Low complexity, low memory EMS algorithm for non-binary LDPC codes. In IEEE Intern. Conf. on Commun., ICC\u20192007. Glasgow, England.","DOI":"10.1109\/ICC.2007.115"},{"key":"1795_CR14","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1109\/TCOMM.2007.894088","volume":"55","author":"D Declercq","year":"2007","unstructured":"Declercq, D., & Fossorier, M. (2007b). Decoding algorithms for nonbinary LDPC codes over GF(q). IEEE Transactions on Communications, 55, 633\u2013643.","journal-title":"IEEE Transactions on Communications"},{"key":"1795_CR15","doi-asserted-by":"publisher","first-page":"1365","DOI":"10.1109\/TCOMM.2010.05.070096","volume":"58","author":"A Voicila","year":"2010","unstructured":"Voicila, A., Declercq, D., Verdier, F., Fossorier, M., & Urard, P. (2010). Low-complexity decoding for non-binary LDPC codes in high order fields. IEEE Transactions on Communications, 58, 1365\u20131375.","journal-title":"IEEE Transactions on Communications"},{"key":"1795_CR16","doi-asserted-by":"publisher","first-page":"2600","DOI":"10.1109\/TCOMM.2013.050813.120489","volume":"61","author":"E Li","year":"2013","unstructured":"Li, E., Declercq, D., & Gunnam, K. (2013). Trellis-based extended Min-Sum algorithm for non-binary LDPC codes and its hardware structure. IEEE Transactions on Communications, 61, 2600\u20132611.","journal-title":"IEEE Transactions on Communications"},{"key":"1795_CR17","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1109\/TCSI.2014.2354753","volume":"62","author":"JO Lacruz","year":"2015","unstructured":"Lacruz, J. O., Garc\u00eda-Herrero, F., Valls, J., & Declercq, D. (2015). One minimum only trellis decoder for non-binary low-density parity-check codes. IEEE Transactions on Circuits and Systems I: Regular Papers, 62, 177\u2013184.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"1795_CR18","doi-asserted-by":"crossref","unstructured":"Lacruz, J.\u00a0O., Garc\u00eda-Herrero, F., Canet, M.\u00a0J., & Valls, J. (2016). Reduced-complexity nonbinary LDPC decoder for high-order Galois fields based on trellis Min-Max algorithm. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 24, 2643\u20132653.","DOI":"10.1109\/TVLSI.2016.2514484"},{"key":"1795_CR19","doi-asserted-by":"crossref","unstructured":"Thi, H.\u00a0P., & Lee, H. (2018). Basic-set trellis Min-Max decoder architecture for nonbinary LDPC codes with high-order Galois fields. IEEE Transactions on Very Large Scale Integration (VLSI) Systems, 26, 496\u2013507.","DOI":"10.1109\/TVLSI.2017.2775646"},{"key":"1795_CR20","doi-asserted-by":"publisher","first-page":"869","DOI":"10.1109\/TCSI.2018.2866882","volume":"66","author":"C Marchand","year":"2019","unstructured":"Marchand, C., Boutillon, E., Harb, H., Conde-Canencia, L., & Al Ghouwayel, A. (2019). Hybrid check node architectures for NB-LDPC decoders. IEEE Transactions on Circuits and Systems I: Regular Papers, 66, 869\u2013880.","journal-title":"IEEE Transactions on Circuits and Systems I: Regular Papers"},{"key":"1795_CR21","doi-asserted-by":"crossref","unstructured":"Schlafer, P., Wehn, N., Alles, M., Lehnigk-Emden, T., & Boutillon, E. (2015). Syndrome based check node processing of high order NB-LDPC decoders. In Telecommunications (ICT), 2015 22nd International Conference on (pp. 156\u2013162).","DOI":"10.1109\/ICT.2015.7124675"},{"key":"1795_CR22","doi-asserted-by":"crossref","unstructured":"Rybalkin, V., Schl\u00e4fer, P., & Wehn, N. (2016). A new architecture for high speed, low latency NB-LDPC check node processing for GF(256). In 2016 IEEE 83rd Vehicular Technology Conference (VTC Spring) (pp. 1\u20135).","DOI":"10.1109\/VTCSpring.2016.7504085"},{"key":"1795_CR23","doi-asserted-by":"crossref","unstructured":"Marchand, C., & Boutillon, E. (2016). NB-LDPC check node with pre-sorted input. In 2016 9th International Symposium on Turbo Codes and Iterative Information Processing (ISTC) (pp. 196\u2013200).","DOI":"10.1109\/ISTC.2016.7593104"},{"key":"1795_CR24","doi-asserted-by":"crossref","unstructured":"Harb, H., Marchand, C., Al-Ghouwayel, A.\u00a0C., Conde-Canencia, L., & Boutillon, E. (2016). Pre-sorted forward-backward NB-LDPC check node architecture. In IEEE Workshop on Signal Processing Systems.","DOI":"10.1109\/SiPS.2016.33"},{"key":"1795_CR25","doi-asserted-by":"crossref","unstructured":"Harb, H., Marchand, C., Conde-Canencia, L., Boutillon, E., & Al\u00a0Ghouwayel, A.\u00a0C. (2021). Parallel cn-vn processing for nb-ldpc decoders. In 2021 IEEE Workshop on Signal Processing Systems (SiPS) (pp. 88\u201393).","DOI":"10.1109\/SiPS52927.2021.00024"},{"key":"1795_CR26","doi-asserted-by":"publisher","first-page":"1761","DOI":"10.1109\/LCOMM.2019.2927702","volume":"23","author":"H Harb","year":"2019","unstructured":"Harb, H., Al Ghouwayel, A. C., & Boutillon, E. (2019). Parallel generation of most reliable LLRs of a non-binary symbol. IEEE Communications Letters, 23, 1761\u20131764.","journal-title":"IEEE Communications Letters"},{"key":"1795_CR27","doi-asserted-by":"crossref","unstructured":"Barnault, L., & Declercq, D. (2003). Fast decoding algorithm for ldpc over gf$$(2^q)$$, . (pp. 70\u201373).","DOI":"10.1109\/ITW.2003.1216697"},{"key":"1795_CR28","doi-asserted-by":"crossref","unstructured":"Hu, X.-Y., & Eleftheriou, E. (2004). Binary representation of cycle tanner-graph gf$$(2^b)$$ codes, . 1, 528\u2013532 Vol.1.","DOI":"10.1109\/ICC.2004.1312545"},{"key":"1795_CR29","first-page":"63","volume-title":"An efficient decoder architecture for nonbinary LDPC codes with extended min-sum algorithm","author":"C Lin","year":"2016","unstructured":"Lin, C., Tu, S., Chen, C., Chang, H., & Lee, C. (2016). An efficient decoder architecture for nonbinary LDPC codes with extended min-sum algorithm (p. 63). IEEE Transactions on Circuits and Systems II: Express Briefs."},{"key":"1795_CR30","doi-asserted-by":"publisher","first-page":"1389","DOI":"10.1109\/TC.2012.108","volume":"62","author":"A Farmahini-Farahani","year":"2013","unstructured":"Farmahini-Farahani, A., Duwe-III, H. J., Schulte, M. J., & Compton, K. (2013). Modular design of high-throughput, low-latency sorting units. IEEE Transactions on Computers, 62, 1389\u20131402.","journal-title":"IEEE Transactions on Computers"},{"key":"1795_CR31","doi-asserted-by":"crossref","unstructured":"Rovini, M., Rossi, F., Ciao, P., L\u2019Insalata, N., & Fanucci, L. (2006). Layered decoding of non-layered LDPC codes. In 9th EUROMICRO Conference on Digital System Design (DSD\u201906) (pp. 537\u2013544).","DOI":"10.1109\/DSD.2006.63"},{"key":"1795_CR32","doi-asserted-by":"crossref","unstructured":"Wymeersch, H., Steendam, H., & Moeneclaey, M. (2004). Log-domain decoding of LDPC codes over GF(q). In IEEE International Conference on Communications (pp. 772\u2013776). volume\u00a02.","DOI":"10.1109\/ICC.2004.1312606"},{"key":"1795_CR33","doi-asserted-by":"crossref","unstructured":"Savin, V. (2008). Min-max decoding for non binary LDPC codes. In IEEE International Symposium on Information Theory (pp. 960\u2013964).","DOI":"10.1109\/ISIT.2008.4595129"},{"key":"1795_CR34","unstructured":"Enabling Practical Wireless Tb\/s Communications with Next Generation Channel Coding, H2020 Eureopean grant n$$^\\circ$$ 760150, (2017-2020) https:\/\/epic-h2020.eu\/"}],"container-title":["Journal of Signal Processing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-022-01795-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11265-022-01795-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11265-022-01795-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,9,9]],"date-time":"2022-09-09T19:42:54Z","timestamp":1662752574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11265-022-01795-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,22]]},"references-count":34,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2022,10]]}},"alternative-id":["1795"],"URL":"https:\/\/doi.org\/10.1007\/s11265-022-01795-y","relation":{},"ISSN":["1939-8018","1939-8115"],"issn-type":[{"value":"1939-8018","type":"print"},{"value":"1939-8115","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,7,22]]},"assertion":[{"value":"16 December 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 July 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 July 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 July 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}