Puncturing Scheme for Polar Codes Based on Channel Reliability Estimation

preprint OA: closed
Full text JSON View at publisher

Abstract

Abstract The compiled code algorithms for polar codes, which were proposed by Arikan, are of low complexity, with excellent performance for a given code length. Consequently, it has attracted widespread attention and gained popularity since its inception. The construction of punctured polar codes allows for more flexibility in coding, making them suitable for a greater variety of scenarios. This paper proposes an improved puncturing scheme for polar codes. With the constraints imposed by conventional punctured polar codes, the error probability of each polarized sub-channel is then calculated on the basis of the channel reliability estimation methodology, so as to puncture the less reliable polarized sub-channels. Furthermore, to achieve better decoding performance, this scheme sets the initial log-likelihood rate (LLR) of the punctured bits to infinity (or negative infinity). The simulation outcomes indicate that the improved punctured polar codes as proposed in this paper perform better than the conventional punctured polar codes.
Full text 11,524 characters · extracted from preprint-html · click to expand
Puncturing Scheme for Polar Codes Based on Channel Reliability Estimation | 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 Puncturing Scheme for Polar Codes Based on Channel Reliability Estimation Tianwei Han, Meiyu Fu, Meiling Zhang, Guijun Hu This is a preprint; it has not been peer reviewed by a journal. https://doi.org/ 10.21203/rs.3.rs-1950901/v1 This work is licensed under a CC BY 4.0 License Status: Published Journal Publication published 13 Mar, 2023 Read the published version in Telecommunication Systems → Version 1 posted 4 You are reading this latest preprint version Abstract The compiled code algorithms for polar codes, which were proposed by Arikan, are of low complexity, with excellent performance for a given code length. Consequently, it has attracted widespread attention and gained popularity since its inception. The construction of punctured polar codes allows for more flexibility in coding, making them suitable for a greater variety of scenarios. This paper proposes an improved puncturing scheme for polar codes. With the constraints imposed by conventional punctured polar codes, the error probability of each polarized sub-channel is then calculated on the basis of the channel reliability estimation methodology, so as to puncture the less reliable polarized sub-channels. Furthermore, to achieve better decoding performance, this scheme sets the initial log-likelihood rate (LLR) of the punctured bits to infinity (or negative infinity). The simulation outcomes indicate that the improved punctured polar codes as proposed in this paper perform better than the conventional punctured polar codes. Polar codes polar code construction puncturing channel reliability estimation Full Text Cite Share Download PDF Status: Published Journal Publication published 13 Mar, 2023 Read the published version in Telecommunication Systems → Version 1 posted Reviewers agreed at journal 22 Aug, 2022 Reviewers invited by journal 22 Aug, 2022 Editor assigned by journal 11 Aug, 2022 First submitted to journal 10 Aug, 2022 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-1950901","acceptedTermsAndConditions":true,"allowDirectSubmit":false,"archivedVersions":[],"articleType":"Research Article","associatedPublications":[],"authors":[{"id":130700254,"identity":"cd24745c-6619-445e-b698-b9acebf3c260","order_by":0,"name":"Tianwei Han","email":"","orcid":"","institution":"Jilin University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Tianwei","middleName":"","lastName":"Han","suffix":""},{"id":130700255,"identity":"50338ab9-468d-4a03-af26-3763dbecf166","order_by":1,"name":"Meiyu Fu","email":"","orcid":"","institution":"Jilin University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Meiyu","middleName":"","lastName":"Fu","suffix":""},{"id":130700256,"identity":"36827a82-bfcb-4337-9887-480294172d14","order_by":2,"name":"Meiling Zhang","email":"","orcid":"","institution":"Jilin University","correspondingAuthor":false,"submittingAuthor":false,"prefix":"","firstName":"Meiling","middleName":"","lastName":"Zhang","suffix":""},{"id":130700257,"identity":"86df774e-badf-41e8-a763-459513e8a405","order_by":3,"name":"Guijun Hu","email":"data:image/png;base64,iVBORw0KGgoAAAANSUhEUgAAAZAAAAAyAQMAAABI0h/eAAAABlBMVEX///8AAABVwtN+AAAACXBIWXMAAA7EAAAOxAGVKw4bAAAAsUlEQVRIiWNgGAWjYBACAxD+wGMBYxOpxXAGjwSJWph5GEjRYi6RfqHYRkYisYG9eZsEQ80dwlosZ+QUGOfwALXwHCuTYDj2jAiH3chJgGiRyDGTYGw4TKQWC5AW+TdEa0k/YMwAtoWHWC1n3jAY9vBIGLfxpBVbJBwjRsvx9GcGP3tsZPvZD2+88aGGCC0MDDxmBow9DAxsIHYCMRoYGNgfP2D4QZzSUTAKRsEoGKEAAJIzNI6DeAmuAAAAAElFTkSuQmCC","orcid":"https://orcid.org/0000-0001-6844-8782","institution":"Jilin University","correspondingAuthor":true,"submittingAuthor":false,"prefix":"","firstName":"Guijun","middleName":"","lastName":"Hu","suffix":""}],"badges":[],"createdAt":"2022-08-11 02:51:45","currentVersionCode":1,"declarations":"","doi":"10.21203/rs.3.rs-1950901/v1","doiUrl":"https://doi.org/10.21203/rs.3.rs-1950901/v1","draftVersion":[],"editorialEvents":[{"content":"https://doi.org/10.1007/s11235-023-00996-5","type":"published","date":"2023-03-13T20:02:12+00:00"}],"editorialNote":"","failedWorkflow":false,"files":[{"id":25666214,"identity":"b731ba1a-504b-42d9-a73c-69f81a12b245","added_by":"auto","created_at":"2022-08-25 16:35:10","extension":"pdf","order_by":1,"title":"","display":"","copyAsset":false,"role":"manuscript-pdf","size":924078,"visible":true,"origin":"","legend":"","description":"","filename":"PuncturingSchemeBasedonChannelReliabilityEstimation.pdf","url":"https://assets-eu.researchsquare.com/files/rs-1950901/v1_covered.pdf"}],"financialInterests":"","formattedTitle":"Puncturing Scheme for Polar Codes Based on Channel Reliability Estimation","fulltext":[{"header":"Full Text","content":"This preprint is available for \u003ca href='/article/rs-1950901/latest.pdf' target='_blank'\u003edownload as a PDF\u003c/a\u003e."}],"fulltextSource":"","fullText":"","funders":[],"hasAdminPriorityOnWorkflow":false,"hasManuscriptDocX":false,"hasOptedInToPreprint":true,"hasPassedJournalQc":"","hasAnyPriority":false,"hideJournal":false,"highlight":"","institution":"","isAcceptedByJournal":true,"isAuthorSuppliedPdf":true,"isDeskRejected":"","isHiddenFromSearch":false,"isInQc":false,"isInWorkflow":true,"isPdf":false,"isPdfUpToDate":true,"isWithdrawnOrRetracted":false,"journal":{"display":true,"email":"[email protected]","identity":"telecommunication-systems","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"tels","sideBox":"Learn more about [Telecommunication Systems](https://www.springer.com/journal/11235)","snPcode":"11235","submissionUrl":"https://submission.nature.com/new-submission/11235/3","title":"Telecommunication Systems","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false},"keywords":"Polar codes, polar code construction, puncturing, channel reliability estimation","lastPublishedDoi":"10.21203/rs.3.rs-1950901/v1","lastPublishedDoiUrl":"https://doi.org/10.21203/rs.3.rs-1950901/v1","license":{"name":"CC BY 4.0","url":"https://creativecommons.org/licenses/by/4.0/"},"manuscriptAbstract":"The compiled code algorithms for polar codes, which were proposed by Arikan, are of low complexity, with excellent performance for a given code length. Consequently, it has attracted widespread attention and gained popularity since its inception. The construction of punctured polar codes allows for more flexibility in coding, making them suitable for a greater variety of scenarios. This paper proposes an improved puncturing scheme for polar codes. With the constraints imposed by conventional punctured polar codes, the error probability of each polarized sub-channel is then calculated on the basis of the channel reliability estimation methodology, so as to puncture the less reliable polarized sub-channels. Furthermore, to achieve better decoding performance, this scheme sets the initial log-likelihood rate (LLR) of the punctured bits to infinity (or negative infinity). The simulation outcomes indicate that the improved punctured polar codes as proposed in this paper perform better than the conventional punctured polar codes.","manuscriptTitle":"Puncturing Scheme for Polar Codes Based on Channel Reliability Estimation","msid":"","msnumber":"","nonDraftVersions":[{"code":1,"date":"2022-08-25 16:35:04","doi":"10.21203/rs.3.rs-1950901/v1","editorialEvents":[{"type":"communityComments","content":0},{"type":"reviewerAgreed","content":"","date":"2022-08-23T03:46:04+00:00","index":0,"fulltext":""},{"type":"reviewersInvited","content":"","date":"2022-08-22T11:25:38+00:00","index":"","fulltext":""},{"type":"editorAssigned","content":"","date":"2022-08-11T09:53:40+00:00","index":"","fulltext":""},{"type":"submitted","content":"Telecommunication Systems","date":"2022-08-10T22:50:28+00:00","index":"","fulltext":""}],"status":"published","journal":{"display":true,"email":"[email protected]","identity":"telecommunication-systems","isNatureJournal":false,"hasQc":true,"allowDirectSubmit":false,"externalIdentity":"tels","sideBox":"Learn more about [Telecommunication Systems](https://www.springer.com/journal/11235)","snPcode":"11235","submissionUrl":"https://submission.nature.com/new-submission/11235/3","title":"Telecommunication Systems","twitterHandle":"","acdcEnabled":true,"dfaEnabled":true,"editorialSystem":"em","reportingPortfolio":"Springer Hybrid","inReviewEnabled":true,"inReviewRevisionsEnabled":false}}],"origin":"","ownerIdentity":"de6dbc7b-74d5-4a5b-bb2b-8b368c73c29b","owner":[],"postedDate":"August 25th, 2022","published":true,"recentEditorialEvents":[],"rejectedJournal":[],"revision":"","amendment":"","status":"published-in-journal","subjectAreas":[],"tags":[],"updatedAt":"2023-10-16T20:03:44+00:00","versionOfRecord":{"articleIdentity":"rs-1950901","link":"https://doi.org/10.1007/s11235-023-00996-5","journal":{"identity":"telecommunication-systems","isVorOnly":false,"title":"Telecommunication Systems"},"publishedOn":"2023-03-13 20:02:12","publishedOnDateReadable":"March 13th, 2023"},"versionCreatedAt":"2022-08-25 16:35:04","video":"","vorDoi":"10.1007/s11235-023-00996-5","vorDoiUrl":"https://doi.org/10.1007/s11235-023-00996-5","workflowStages":[]},"version":"v1","identity":"rs-1950901","journalConfig":"researchsquare"},"__N_SSP":true},"page":"/article/[identity]/[[...version]]","query":{"redirect":"/article/rs-1950901","identity":"rs-1950901","version":["v1"]},"buildId":"7rjqhiLT3MXkJMwkYKINL","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. The paper's references may be in our DB but unresolved to ``paper_id`` (resolution happens at ingest when the cited DOI matches a row we already have). Run the cross-source citation reconcile pass to retry.

Source provenance

europepmc
last seen: 2026-05-19T01:45:01.086888+00:00