{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:33:43Z","timestamp":1772120023215,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T00:00:00Z","timestamp":1707868800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T00:00:00Z","timestamp":1707868800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"Key Project of Natural Science Foundation of Zhejiang Province","award":["Z23F010001"],"award-info":[{"award-number":["Z23F010001"]}]},{"name":"Key Project of Natural Science Foundation of Zhejiang Province","award":["Z23F010001"],"award-info":[{"award-number":["Z23F010001"]}]},{"name":"Key Project of Natural Science Foundation of Zhejiang Province","award":["Z23F010001"],"award-info":[{"award-number":["Z23F010001"]}]},{"name":"KTH Royal Institute of Technology Digital Futures Project","award":["KTH-RPROJ-0146472"],"award-info":[{"award-number":["KTH-RPROJ-0146472"]}]},{"name":"Swedish Foundation for Strategic Research (SSF) Project","award":["APR20-0023"],"award-info":[{"award-number":["APR20-0023"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Peer-to-Peer Netw. Appl."],"published-print":{"date-parts":[[2024,5]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>For the hard guessing random additive noise decoding Markov order (GRAND-MO) algorithm, it is crucial to develop an efficient noise error patterns (NEPs) generator to facilitate its application in bursty channels. This paper proposes a practical hardware realization by generating the NEPs in a sequential manner. Based on classification of the four types of NEPs, we propose to iteratively calculate the \u201c1\" and the \u201c0\" permutations in the same time. Then, the novel \u201c0\" permutation regularization and bit flipping techniques are employed, through which the generation of the four types of NEPs is uniformed at the same way. Moreover, the proposed NEPs generator can generate all NEPs by using the \u201c1\" burst parameters, and is suitable for the guessing decoding of any linear block codes. Built on field programmable gate array (FPGA) implementation and comparison with existing benchmark, we show the proposed NEPs generator is a power-efficient architecture for realization. This work presents a new solution for the hardware implementation of the NEPs generator in GRAND-MO.<\/jats:p>","DOI":"10.1007\/s12083-024-01644-8","type":"journal-article","created":{"date-parts":[[2024,2,14]],"date-time":"2024-02-14T04:02:21Z","timestamp":1707883341000},"page":"1225-1236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Energy efficient noise error pattern generator for guessing decoding in bursty channels"],"prefix":"10.1007","volume":"17","author":[{"given":"Qiang","family":"Zhou","sequence":"first","affiliation":[]},{"given":"Ming","family":"Zhan","sequence":"additional","affiliation":[]},{"given":"Jiangwu","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Kan","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Fang","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Zhibo","family":"Pang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,2,14]]},"reference":[{"issue":"4","key":"1644_CR1","doi-asserted-by":"publisher","first-page":"3098","DOI":"10.1109\/COMST.2018.2841349","volume":"20","author":"I Parvez","year":"2018","unstructured":"Parvez I, Rahmati A, Guvenc I, Sarwat AI, Dai H (2018) A survey on low latency towards 5G: RAN, core network and caching solutions. IEEE Commun Surveys Tuts 20(4):3098\u20133130","journal-title":"IEEE Commun Surveys Tuts"},{"issue":"12","key":"1644_CR2","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1109\/MCOM.2018.1701178","volume":"56","author":"H Chen","year":"2018","unstructured":"Chen H, Abbas R, Cheng P, Shirvanimoghaddam M, Hardjawana W, Bao W, Li Y, Vucetic B (2018) Ultra-reliable low latency cellular networks: Use cases, challenges and approaches. IEEE Commun Mag 56(12):119\u2013125","journal-title":"IEEE Commun Mag"},{"key":"1644_CR3","doi-asserted-by":"publisher","first-page":"39037","DOI":"10.1109\/ACCESS.2018.2854794","volume":"6","author":"M Zhan","year":"2018","unstructured":"Zhan M, Wu J, Wen H, Zhang P (2018) A novel error correction mechanism for energy-efficient cyber-physical systems in smart building. IEEE Access 6:39037\u201339045","journal-title":"IEEE Access"},{"issue":"6","key":"1644_CR4","doi-asserted-by":"publisher","first-page":"2688","DOI":"10.1109\/TCSI.2021.3068623","volume":"68","author":"M Zhan","year":"2021","unstructured":"Zhan M, Pang Z, Yu K, Wen H (2021) Reverse calculation-based low memory turbo decoder for power constrained applications. IEEE Trans Circuits Syst Regul Pap 68(6):2688\u20132701","journal-title":"IEEE Trans Circuits Syst Regul Pap"},{"issue":"7","key":"1644_CR5","doi-asserted-by":"publisher","first-page":"4023","DOI":"10.1109\/TIT.2019.2896110","volume":"65","author":"KR Duffy","year":"2019","unstructured":"Duffy KR, Li J, M\u00e9dard M (2019) Capacity-achieving guessing random additive noise decoding. IEEE Trans Inf Theory 65(7):4023\u20134040","journal-title":"IEEE Trans Inf Theory"},{"issue":"6","key":"1644_CR6","doi-asserted-by":"publisher","first-page":"3655","DOI":"10.1109\/TCOMM.2022.3171798","volume":"70","author":"W An","year":"2022","unstructured":"An W, M\u00e9dard M, Duffy KR (2022) Keep the bursts and ditch the interleavers. IEEE Trans Commun 70(6):3655\u20133667","journal-title":"IEEE Trans Commun"},{"key":"1644_CR7","doi-asserted-by":"publisher","first-page":"1047","DOI":"10.1007\/s11265-022-01775-2","volume":"94","author":"SM Abbas","year":"2022","unstructured":"Abbas SM, Jalaleddine M, Gross WJ (2022) Hardware architecture for guessing random additive noise decoding Markov order (GRAND-MO). J Sign Process Syst 94:1047\u20131065","journal-title":"J Sign Process Syst"},{"issue":"4","key":"1644_CR8","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1109\/LCOMM.2022.3148302","volume":"26","author":"M Zhan","year":"2022","unstructured":"Zhan M, Pang Z, Yu K, Xu J, Wu F, Xiao M (2022) Noise error pattern generation based on successive addition-subtraction for GRAND-MO. IEEE Commun Lett 26(4):743\u2013747","journal-title":"IEEE Commun Lett"},{"key":"1644_CR9","doi-asserted-by":"crossref","unstructured":"Duffy KR (2018) Guessing noise, not code-words. Paper presented at the Proc IEEE Int Symp Inf Theory (ISIT), 671\u2013675 June 2018","DOI":"10.1109\/ISIT.2018.8437648"},{"key":"1644_CR10","doi-asserted-by":"crossref","unstructured":"An W, M\u00e9dard M, Duffy KR (2020) Keep the bursts and ditch the interleavers. Paper presented at the Proc. GLOBECOM - IEEE Global Commun Conf, 1\u20136 December 2020","DOI":"10.1109\/GLOBECOM42002.2020.9322303"},{"key":"1644_CR11","doi-asserted-by":"crossref","unstructured":"Abbas SM, Jalaleddine M, Gross WJ (2021) High-throughput VLSI architecture for GRAND Markov order. Paper presented at the IEEE Workshop Signal Process Syst (SiPS), 158\u2013163 October 2021","DOI":"10.1109\/SiPS52927.2021.00036"},{"key":"1644_CR12","doi-asserted-by":"crossref","unstructured":"Solomon A, Duffy KR, M\u00e9dard M (2020) Soft maximum likelihood decoding using GRAND. Paper presented at the IEEE Int Conf Commun (ICC), 1\u20136 June 2020","DOI":"10.1109\/ICC40277.2020.9149208"},{"issue":"5","key":"1644_CR13","doi-asserted-by":"publisher","first-page":"2803","DOI":"10.1109\/TIT.2022.3230782","volume":"69","author":"M Liu","year":"2023","unstructured":"Liu M, Wei Y, Chen Z, Zhang W (2023) ORBGRAND is almost capacity-achieving. IEEE Trans Inf Theory 69(5):2803\u20132840","journal-title":"IEEE Trans Inf Theory"},{"key":"1644_CR14","doi-asserted-by":"crossref","unstructured":"Abbas SM, Tonnellier T, Ercan F, Gross WJ (2020) High-throughput VLSI architecture for GRAND. Paper presented at the IEEE Workshop Signal Process Syst (SiPS), 1\u20136 October 2020","DOI":"10.1109\/SiPS50750.2020.9195254"},{"key":"1644_CR15","doi-asserted-by":"crossref","unstructured":"Rowshan M, Yuan J (2022) Constrained error pattern generation for GRAND. Paper presented at the Proc. IEEE Int Symp Inf Theor (ISIT), 1767\u20131772 June 2022","DOI":"10.1109\/ISIT50566.2022.9834343"},{"key":"1644_CR16","doi-asserted-by":"crossref","unstructured":"Duffy KR, M\u00e9dard M (2019) Guessing random additive noise decoding with soft detection symbol reliability information-SGRAND. Paper presented at the Proc. IEEE Int Symp Inf Theor (ISIT), 480\u2013484 July 2019","DOI":"10.1109\/ISIT.2019.8849297"},{"issue":"1","key":"1644_CR17","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/TCOMM.2021.3114315","volume":"70","author":"KR Duffy","year":"2022","unstructured":"Duffy KR, M\u00e9dard M, An W (2022) Guessing random additive noise decoding with symbol reliability information (SRGRAND). IEEE Trans Commun 70(1):3\u201318","journal-title":"IEEE Trans Commun"},{"key":"1644_CR18","doi-asserted-by":"publisher","first-page":"4528","DOI":"10.1109\/TSP.2022.3203251","volume":"70","author":"KR Duffy","year":"2022","unstructured":"Duffy KR, An W, M\u00e9dard M (2022) Ordered reliability bits guessing random additive noise decoding. IEEE Trans Signal Process 70:4528\u20134542","journal-title":"IEEE Trans Signal Process"},{"key":"1644_CR19","doi-asserted-by":"crossref","unstructured":"Condo C, Bioglio V, Land I (2021) High-performance low-complexity error pattern generation for ORBGRAND decoding. Paper presented at the Proc. IEEE Globecom Workshops (GC Wkshps), 1\u20136 December 2021","DOI":"10.1109\/GCWkshps52748.2021.9682165"},{"issue":"5","key":"1644_CR20","doi-asserted-by":"publisher","first-page":"2203","DOI":"10.1109\/TCSI.2022.3150583","volume":"69","author":"C Condo","year":"2022","unstructured":"Condo C (2022) A fixed latency ORBGRAND decoder architecture with LUT-aided error-pattern scheduling. IEEE Trans Circuits Syst Regul Pap 69(5):2203\u20132211","journal-title":"IEEE Trans Circuits Syst Regul Pap"},{"issue":"1","key":"1644_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/TVLSI.2022.3223692","volume":"33","author":"SM Abbas","year":"2023","unstructured":"Abbas SM, Jalaleddine M, Gross WJ (2023) List-GRAND\u202f: A practical way to achieve mmaximum likelihood decoding. IEEE Trans Very Large Scale Integr VLSI Syst 33(1):43\u201354","journal-title":"IEEE Trans Very Large Scale Integr VLSI Syst"}],"container-title":["Peer-to-Peer Networking and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01644-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12083-024-01644-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12083-024-01644-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,9]],"date-time":"2024-06-09T09:05:37Z","timestamp":1717923937000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12083-024-01644-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,14]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["1644"],"URL":"https:\/\/doi.org\/10.1007\/s12083-024-01644-8","relation":{"has-preprint":[{"id-type":"doi","id":"10.21203\/rs.3.rs-3495519\/v1","asserted-by":"object"}]},"ISSN":["1936-6442","1936-6450"],"issn-type":[{"value":"1936-6442","type":"print"},{"value":"1936-6450","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,2,14]]},"assertion":[{"value":"26 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 February 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval"}},{"value":"Yes.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to participate"}},{"value":"Yes.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}