Successive Cancellation Priority Decoding of Polar Codes
The successive cancellation list (SCL) decoding of polar codes can achieve a performance close to that of maximum-likelihood decoding. Nevertheless, a large list size results in high-computational complexity. In this paper, a successive cancellation priority (SCP) decoding algorithm is proposed to r...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
IEEE
2019-01-01
|
| Series: | IEEE Access |
| Subjects: | |
| Online Access: | https://ieeexplore.ieee.org/document/8600315/ |
| _version_ | 1828929130300702720 |
|---|---|
| author | Di Guan Kai Niu Chao Dong Ping Zhang |
| author_facet | Di Guan Kai Niu Chao Dong Ping Zhang |
| author_sort | Di Guan |
| collection | DOAJ |
| description | The successive cancellation list (SCL) decoding of polar codes can achieve a performance close to that of maximum-likelihood decoding. Nevertheless, a large list size results in high-computational complexity. In this paper, a successive cancellation priority (SCP) decoding algorithm is proposed to reduce the time complexity. The SCP decoder performs a priority-first decoding, which is composed of a priority queue and a trellis. During the SCP decoding, the priority queue interacts with the trellis iteratively. Conceptually, the priority queue stores the priority information and guides the extension of the candidate path. The trellis calculates and stores the intermediate results. Since most of the unnecessary path extensions are avoided by using the priority queue, the time complexity of the SCP decoder is much lower than that of the standard SCL decoder. Then, a quantized priority queue is introduced to avoid the comparison operations in the path selection and to simplify the SCP decoder. Furthermore, we prove that the path extension of the SCP decoder is equivalent to the extension of the most reliable paths of the standard SCL decoder. Thus, the SCP decoder can achieve the same decoding performance as that of the standard SCL decoder. |
| first_indexed | 2024-12-14T00:14:19Z |
| format | Article |
| id | doaj.art-0ce2a2a8989748fb8dbf48d0e3bfeb3c |
| institution | Directory Open Access Journal |
| issn | 2169-3536 |
| language | English |
| last_indexed | 2024-12-14T00:14:19Z |
| publishDate | 2019-01-01 |
| publisher | IEEE |
| record_format | Article |
| series | IEEE Access |
| spelling | doaj.art-0ce2a2a8989748fb8dbf48d0e3bfeb3c2022-12-21T23:25:37ZengIEEEIEEE Access2169-35362019-01-0179575958510.1109/ACCESS.2019.28908388600315Successive Cancellation Priority Decoding of Polar CodesDi Guan0https://orcid.org/0000-0003-0951-4297Kai Niu1https://orcid.org/0000-0002-8076-1867Chao Dong2https://orcid.org/0000-0002-4922-7762Ping Zhang3Key Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, ChinaKey Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, ChinaKey Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, ChinaKey Laboratory of Universal Wireless Communication, Ministry of Education, Beijing University of Posts and Telecommunications, Beijing, ChinaThe successive cancellation list (SCL) decoding of polar codes can achieve a performance close to that of maximum-likelihood decoding. Nevertheless, a large list size results in high-computational complexity. In this paper, a successive cancellation priority (SCP) decoding algorithm is proposed to reduce the time complexity. The SCP decoder performs a priority-first decoding, which is composed of a priority queue and a trellis. During the SCP decoding, the priority queue interacts with the trellis iteratively. Conceptually, the priority queue stores the priority information and guides the extension of the candidate path. The trellis calculates and stores the intermediate results. Since most of the unnecessary path extensions are avoided by using the priority queue, the time complexity of the SCP decoder is much lower than that of the standard SCL decoder. Then, a quantized priority queue is introduced to avoid the comparison operations in the path selection and to simplify the SCP decoder. Furthermore, we prove that the path extension of the SCP decoder is equivalent to the extension of the most reliable paths of the standard SCL decoder. Thus, the SCP decoder can achieve the same decoding performance as that of the standard SCL decoder.https://ieeexplore.ieee.org/document/8600315/Polar codepriority decodingsuccessive cancellation decodingsuccessive cancellation list |
| spellingShingle | Di Guan Kai Niu Chao Dong Ping Zhang Successive Cancellation Priority Decoding of Polar Codes IEEE Access Polar code priority decoding successive cancellation decoding successive cancellation list |
| title | Successive Cancellation Priority Decoding of Polar Codes |
| title_full | Successive Cancellation Priority Decoding of Polar Codes |
| title_fullStr | Successive Cancellation Priority Decoding of Polar Codes |
| title_full_unstemmed | Successive Cancellation Priority Decoding of Polar Codes |
| title_short | Successive Cancellation Priority Decoding of Polar Codes |
| title_sort | successive cancellation priority decoding of polar codes |
| topic | Polar code priority decoding successive cancellation decoding successive cancellation list |
| url | https://ieeexplore.ieee.org/document/8600315/ |
| work_keys_str_mv | AT diguan successivecancellationprioritydecodingofpolarcodes AT kainiu successivecancellationprioritydecodingofpolarcodes AT chaodong successivecancellationprioritydecodingofpolarcodes AT pingzhang successivecancellationprioritydecodingofpolarcodes |