Genetic Algorithm-Optimized Adaptive Offset Min-Sum LDPC Decoder for 5G- NR Base Graph 2 Codes

preprint OA: closed CC-BY-4.0
📄 Open PDF Full text JSON View at publisher

Abstract

Abstract This paper proposes a resource-efficient Adaptive Offset Min-Sum (A-OMS) LDPC decoder for 5G-NR Base Graph 2 (BG2) codes. A Genetic Algorithm (GA) is employed to optimize the offset factor within the check-node update, addressing the difficulty of selecting a globally optimal offset for the irregular BG2 structure. The GA operates as a meta-heuristic optimizer that minimizes the bit-error rate (BER) over a wide range of signal-to-noise ratios (SNRs). Simulation results show that the proposed GA-optimized A-OMS decoder achieves performance within 0.2–0.4 dB of belief-propagation decoding, while providing coding gains of 0.3–0.6 dB and up to a 4.6× BER reduction compared with conventional fixed-offset OMS. These improvements are obtained with approximately 35% of the computational complexity of BP decoding. The proposed approach offers a practical balance between performance and implementation efficiency for next-generation 5G-NR receivers.
Full text 10,152 characters · extracted from preprint-html · click to expand
Genetic Algorithm-Optimized Adaptive Offset Min-Sum LDPC Decoder for 5G- NR Base Graph 2 Codes | Research Square window.SnipcartSettings = { analytics: { enabled: false } }; (function() { var accessVector = localStorage.getItem('access_vector') || ''; window.dataLayer = window.dataLayer || []; if (accessVector) { window.dataLayer.push({ user: { profile: { profileInfo: { snid: accessVector } } } }); } })(); (function(w,d,s,l,i){w[l]=w[l]||[];w[l].push({'gtm.start':new Date().getTime(),event:'gtm.js'});var f=d.getElementsByTagName(s)[0],j=d.createElement(s),dl=l!='dataLayer'?'&l='+l:'';j.async=true;j.src='https://www.googletagmanager.com/gtm.js?id='+i+dl;f.parentNode.insertBefore(j,f);})(window,document,'script','dataLayer','GTM-K279D39R'); Browse Preprints In Review Journals COVID-19 Preprints AJE Video Bytes Research Tools Research Promotion AJE Professional Editing AJE Rubriq About Preprint Platform In Review Editorial Policies Our Team Advisory Board Help Center Sign In Submit a Preprint Cite Share Download PDF Research Article Genetic Algorithm-Optimized Adaptive Offset Min-Sum LDPC Decoder for 5G- NR Base Graph 2 Codes Anwer Sabah Ahmed, Yousif Jawad Kadhim Nukhailawi, Heyam A. Marzog, and 1 more This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-8646460/v1 This work is licensed under a CC BY 4.0 License Status: Posted Version 1 posted You are reading this latest preprint version Abstract This paper proposes a resource-efficient Adaptive Offset Min-Sum (A-OMS) LDPC decoder for 5G-NR Base Graph 2 (BG2) codes. A Genetic Algorithm (GA) is employed to optimize the offset factor within the check-node update, addressing the difficulty of selecting a globally optimal offset for the irregular BG2 structure. The GA operates as a meta-heuristic optimizer that minimizes the bit-error rate (BER) over a wide range of signal-to-noise ratios (SNRs). Simulation results show that the proposed GA-optimized A-OMS decoder achieves performance within 0.2–0.4 dB of belief-propagation decoding, while providing coding gains of 0.3–0.6 dB and up to a 4.6× BER reduction compared with conventional fixed-offset OMS. These improvements are obtained with approximately 35% of the computational complexity of BP decoding. The proposed approach offers a practical balance between performance and implementation efficiency for next-generation 5G-NR receivers. Adaptive decoding Base Graph 2 (BG2) 5G-NR LDPC decoding Min-Sum algorithm Offset Min-Sum (OMS) SNR-adaptive offset Full Text Additional Declarations No competing interests reported. Cite Share Download PDF Status: Posted Version 1 posted You are reading this latest preprint version Research Square lets you share your work early, gain feedback from the community, and start making changes to your manuscript prior to peer review in a journal. As a division of Research Square Company, we’re committed to making research communication faster, fairer, and more useful. We do this by developing innovative software and high quality services for the global research community. Our growing team is made up of researchers and industry professionals working together to solve the most critical problems facing scientific publishing. Also discoverable on Platform About Our Team In Review Editorial Policies Advisory Board Help Center Resources Author Services Accessibility API Access RSS feed Manage Cookie Preferences © Research Square 2026 | ISSN 2693-5015 (online) Privacy Policy Terms of Service Do Not Sell My Personal Information {"props":{"pageProps":{"initialData":{"identity":"rs-8646460","acceptedTermsAndConditions":true,"allowDirectSubmit":true,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":578849521,"identity":"98e88818-3216-4812-b50e-6fabe0cb659d","order_by":0,"name":"Anwer Sabah Ahmed","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAx0lEQVRIiWNgGAWjYBACNgaGBBAtB+eyEavFGKKUGC0wkNgA00IQ8Ek3PGD4ueNwev/8HgOGD2WHGfjYEwg4TOZAAmPvmcO5M47xGDDOOHeYgY3nAQEtEgkJDLxtt3MbgFqYedsOg0QIa2H823Y7XR6k5S+xWoCG304wAGlhJFbLYdm2/4Ybj6UVHOw5l85D0C/yM3ISH75tS5OXO3x444MfZdZy8u0EbGFg4Ek4AGOCGDzQuMUH2A+gixDUMgpGwSgYBSMMAAAidD4A8hKtwgAAAABJRU5ErkJggg==","orcid":"","institution":"Technical Institute of Al-Najaf, Al-Furat Al-Awsat Technical University","correspondingAuthor":true,"prefix":"","firstName":"Anwer","middleName":"Sabah","lastName":"Ahmed","suffix":""},{"id":578849522,"identity":"4db06f85-372c-4100-842d-2740abfec7ae","order_by":1,"name":"Yousif Jawad Kadhim Nukhailawi","email":"","orcid":"","institution":"Technical Institute of Al-Najaf, Al-Furat Al-Awsat Technical University","correspondingAuthor":false,"prefix":"","firstName":"Yousif","middleName":"Jawad Kadhim","lastName":"Nukhailawi","suffix":""},{"id":578849523,"identity":"82c4aa79-c45c-4dcd-ac48-08a4ddd1abcf","order_by":2,"name":"Heyam A. Marzog","email":"","orcid":"","institution":"Engineering technical College/Najaf, Al-Furat Al-Awsat Technical University","correspondingAuthor":false,"prefix":"","firstName":"Heyam","middleName":"A.","lastName":"Marzog","suffix":""},{"id":578849526,"identity":"8473f4e4-6aa4-44b5-b7d3-50ded541805c","order_by":3,"name":"Marwa Jaleel Mohsin","email":"","orcid":"","institution":"Engineering technical College/Najaf, Al-Furat Al-Awsat Technical University","correspondingAuthor":false,"prefix":"","firstName":"Marwa","middleName":"Jaleel","lastName":"Mohsin","suffix":""}],"badges":[],"createdAt":"2026-01-20 07:59:00","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-8646460/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-8646460/v1","draftVersion":[],"editorialEvents":[],"editorialNote":"","failedWorkflow":false,"files":[{"id":103517083,"identity":"0c70353a-8f71-46af-b8c5-7680f48472d2","added_by":"auto","created_at":"2026-02-26 14:31:21","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":1158231,"visible":true,"origin":"","legend":"","description":"","filename":"LDPC.pdf","url":"https://assets-eu.researchsquare.com/files/rs-8646460/v1_covered_9f2e2ebf-2eeb-442e-b158-346640336b45.pdf"}],"financialInterests":"No competing interests reported.","formattedTitle":"Genetic Algorithm-Optimized Adaptive Offset Min-Sum LDPC Decoder for 5G- NR Base Graph 2 Codes","fulltext":[],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":true,"hideJournal":true,"highlight":"","institution":"","isAcceptedByJournal":false,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":false,"isPdf":true,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true},"keywords":"Adaptive decoding, Base Graph 2 (BG2), 5G-NR, LDPC decoding, Min-Sum algorithm, Offset Min-Sum (OMS), SNR-adaptive offset","lastPublishedDoi":"10.21203/rs.3.rs-8646460/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-8646460/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"\u003cp\u003eThis paper proposes a resource-efficient Adaptive Offset Min-Sum (A-OMS) LDPC decoder for 5G-NR Base Graph 2 (BG2) codes. A Genetic Algorithm (GA) is employed to optimize the offset factor within the check-node update, addressing the difficulty of selecting a globally optimal offset for the irregular BG2 structure. The GA operates as a meta-heuristic optimizer that minimizes the bit-error rate (BER) over a wide range of signal-to-noise ratios (SNRs). Simulation results show that the proposed GA-optimized A-OMS decoder achieves performance within 0.2\u0026ndash;0.4 dB of belief-propagation decoding, while providing coding gains of 0.3\u0026ndash;0.6 dB and up to a 4.6\u0026times; BER reduction compared with conventional fixed-offset OMS. These improvements are obtained with approximately 35% of the computational complexity of BP decoding. The proposed approach offers a practical balance between performance and implementation efficiency for next-generation 5G-NR receivers.\u003c/p\u003e","manuscriptTitle":"Genetic Algorithm-Optimized Adaptive Offset Min-Sum LDPC Decoder for 5G- NR Base Graph 2 Codes","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2026-01-28 08:57:02","doi":"10.21203/rs.3.rs-8646460/v1","editorialEvents":[{"type":"communityComments","content":0}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"researchsquare","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":true,"externalIdentity":"","sideBox":"","snPcode":"","submissionUrl":"/submission","title":"Research Square","twitterHandle":"researchsquare","acdcEnabled":true,"dfaEnabled":false,"editorialSystem":"","reportingPortfolio":"","inReviewEnabled":false,"inReviewRevisionsEnabled":true}}],"origin":"","ownerIdentity":"fd9d6384-a869-4c14-8304-78f42d7a8705","owner":[],"postedDate":"January 28th, 2026","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"posted","subjectAreas":[],"tags":[],"updatedAt":"2026-02-26T14:17:57+00:00","versionOfRecord":[],"versionCreatedAt":"2026-01-28 08:57:02","video":"","vorDoi":"","vorDoiUrl":"","workflowStages":[]},"version":"v1","identity":"rs-8646460","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-8646460","identity":"rs-8646460","version":["v1"]},"buildId":"XKTyCvWXoU3ODBz1xrDgd","isFallback":false,"isExperimentalCompile":false,"dynamicIds":[84888],"gssp":true,"scriptLoader":[]}

Text is read by the "Ask this paper" AI Q&A widget below. Extraction quality varies by source — PMC NXML preserves structure cleanly, OA-HTML may include some navigation residue, and OA-PDF can have broken hyphenation. The publisher copy (via DOI) is the canonical version.

My notes (saved in your browser only)

Ask this paper AI returns verbatim quotes from the full text · source: preprint-html

Answers must be backed by verbatim quotes from this paper's full text. Hallucinated quotes are dropped automatically; if no verbatim passage answers the question, we say so. How this works

Citation neighborhood (no data yet)

We don't have any in-corpus citations linked to this paper yet. This is a recent paper (2026) — citers typically take a year or two to land, and the OpenAlex reference graph may still be filling in.

Source provenance

europepmc
last seen: 2026-05-20T01:45:00.602351+00:00
unpaywall
last seen: 2026-06-02T02:00:03.124865+00:00
License: CC-BY-4.0