Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2605.13331 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866911680272793600 |
|---|---|
| author | Tu, Changwei Liu, Yang Feng, Xianzhao Niu, Kai |
| author_facet | Tu, Changwei Liu, Yang Feng, Xianzhao Niu, Kai |
| contents | Blind recognition of polar codes remains challenging in non-cooperative scenarios, particularly for information-set recognition with known code length. Existing methods mainly rely on threshold decisions determined by the generator-matrix structure and channel bit error probability, without fully exploiting the soft information in received signals. In this letter, we propose a blind recognition method using successive cancellation list (SCL) decoding for polar codes with known code length. The proposed method exploits the distinct statistical behaviors of frozen and information bits in source-side decision log-likelihood ratios (LLRs) over multiple received vectors: frozen bits tend to favor zero decisions, whereas information bits exhibit nearly equiprobable $0/1$ decisions. Based on this property, the decoder expands candidate paths under the frozen-bit and information-bit hypotheses at each bit position, evaluates their reliabilities using the corresponding average path metrics, and retains only the $L_{\mathrm{list}}$ most reliable paths for subsequent recognition. Finally, the information-set pattern corresponding to the most reliable surviving path is selected as the recognition result. Simulation results show that the proposed scheme improves the recognition success rate as the list size increases. For the $(32,16)$, $(64,32)$, and $(128,64)$ polar codes, it achieves at least $2.5$ dB gain over the previous method when $L_{\mathrm{list}}=64$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2605_13331 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Blind Recognition of Polar Codes Using Successive Cancellation List Decoding Tu, Changwei Liu, Yang Feng, Xianzhao Niu, Kai Information Theory Blind recognition of polar codes remains challenging in non-cooperative scenarios, particularly for information-set recognition with known code length. Existing methods mainly rely on threshold decisions determined by the generator-matrix structure and channel bit error probability, without fully exploiting the soft information in received signals. In this letter, we propose a blind recognition method using successive cancellation list (SCL) decoding for polar codes with known code length. The proposed method exploits the distinct statistical behaviors of frozen and information bits in source-side decision log-likelihood ratios (LLRs) over multiple received vectors: frozen bits tend to favor zero decisions, whereas information bits exhibit nearly equiprobable $0/1$ decisions. Based on this property, the decoder expands candidate paths under the frozen-bit and information-bit hypotheses at each bit position, evaluates their reliabilities using the corresponding average path metrics, and retains only the $L_{\mathrm{list}}$ most reliable paths for subsequent recognition. Finally, the information-set pattern corresponding to the most reliable surviving path is selected as the recognition result. Simulation results show that the proposed scheme improves the recognition success rate as the list size increases. For the $(32,16)$, $(64,32)$, and $(128,64)$ polar codes, it achieves at least $2.5$ dB gain over the previous method when $L_{\mathrm{list}}=64$. |
| title | Blind Recognition of Polar Codes Using Successive Cancellation List Decoding |
| topic | Information Theory |
| url | https://arxiv.org/abs/2605.13331 |