Computer Science > Information Theory
[Submitted on 17 Feb 2017 (v1), last revised 27 Dec 2018 (this version, v2)]
Title:A Correlation-Breaking Interleaving of Polar Codes in Concatenated Systems
View PDFAbstract:It is known that the bit errors of polar codes with successive cancellation (SC) decoding are coupled. However, existing concatenation schemes of polar codes with other error correction codes rarely take this coupling effect into consideration. To achieve a better error performance of concatenated systems with polar codes as inner codes, one can divide all bits in an outer block into different polar blocks to completely de-correlate the possible coupled errors in the transmitter side. We call this interleaving a blind interleaving (BI) which serves as a benchmark. Two BI schemes, termed BI-DP and BI-CDP, are proposed in the paper. To better balance performance, memory size, and the decoding delay from the de-interleaving, a novel interleaving scheme, named the correlation-breaking interleaving (CBI), is proposed. The CBI breaks the correlated information bits based on the error correlation pattern proposed and proven in this paper. The proposed CBI scheme is general in the sense that any error correction code can serve as the outer code. In this paper, Low-Density Parity-Check (LDPC) codes and BCH codes are used as two examples of the outer codes of the interleaving scheme. The CBI scheme 1) can keep the simple SC polar decoding while achieving a better error performance than the state-of-the-art (SOA) direct concatenation of polar codes with LDPC codes and BCH codes; 2) achieves a comparable error performance as the BI-DP scheme with a smaller memory size and a shorter decoding delay. Numerical results are provided to verify the performance of the BI schemes and the CBI scheme.
Submission history
From: Ya Meng [view email][v1] Fri, 17 Feb 2017 01:18:25 UTC (3,848 KB)
[v2] Thu, 27 Dec 2018 10:02:48 UTC (2,612 KB)
Current browse context:
cs.IT
References & Citations
Bibliographic and Citation Tools
Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)
Code, Data and Media Associated with this Article
alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)
Demos
Recommenders and Search Tools
Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
arXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.