Improved segmented CRC assisted puncturing Polar decoding
A segmented cyclic redundancy check (CRC) assisted decoding algorithm was proposed.This method makes use of the high parallelism of BP decoding and the high reliability of CRC verification,and uniformly or proportionally disperses CRC verification bits into the original information bits.Simulation r...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Beijing Xintong Media Co., Ltd
2019-03-01
|
| Series: | Dianxin kexue |
| Subjects: | |
| Online Access: | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2019007/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841530558677516288 |
|---|---|
| author | Yanhong NI Xiangxiong LOU Jianrong BAO |
| author_facet | Yanhong NI Xiangxiong LOU Jianrong BAO |
| author_sort | Yanhong NI |
| collection | DOAJ |
| description | A segmented cyclic redundancy check (CRC) assisted decoding algorithm was proposed.This method makes use of the high parallelism of BP decoding and the high reliability of CRC verification,and uniformly or proportionally disperses CRC verification bits into the original information bits.Simulation results show that when the code length N is 1 024 and the SNR is 3.5 dB,the average iterations of segmented CRC（2,16×2）and CRC (2,24+8) are 2.7 and 2.8 times less than those of G matrix based decoding.When the code length M is 896,the two segmented methods with a bit error rate of 10<sup>-5</sup>obtained about 0.7 dB gain compared with the non-CRC assisted BP puncturing decoding. |
| format | Article |
| id | doaj-art-ecfdf169ebbc4e1fb8b15b34ec08c9b8 |
| institution | Kabale University |
| issn | 1000-0801 |
| language | zho |
| publishDate | 2019-03-01 |
| publisher | Beijing Xintong Media Co., Ltd |
| record_format | Article |
| series | Dianxin kexue |
| spelling | doaj-art-ecfdf169ebbc4e1fb8b15b34ec08c9b82025-01-15T03:03:12ZzhoBeijing Xintong Media Co., LtdDianxin kexue1000-08012019-03-0135919859590693Improved segmented CRC assisted puncturing Polar decodingYanhong NIXiangxiong LOUJianrong BAOA segmented cyclic redundancy check (CRC) assisted decoding algorithm was proposed.This method makes use of the high parallelism of BP decoding and the high reliability of CRC verification,and uniformly or proportionally disperses CRC verification bits into the original information bits.Simulation results show that when the code length N is 1 024 and the SNR is 3.5 dB,the average iterations of segmented CRC（2,16×2）and CRC (2,24+8) are 2.7 and 2.8 times less than those of G matrix based decoding.When the code length M is 896,the two segmented methods with a bit error rate of 10<sup>-5</sup>obtained about 0.7 dB gain compared with the non-CRC assisted BP puncturing decoding.http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2019007/puncturing Polar codebelief-propagation decodingCRCsegmented decoding |
| spellingShingle | Yanhong NI Xiangxiong LOU Jianrong BAO Improved segmented CRC assisted puncturing Polar decoding Dianxin kexue puncturing Polar code belief-propagation decoding CRC segmented decoding |
| title | Improved segmented CRC assisted puncturing Polar decoding |
| title_full | Improved segmented CRC assisted puncturing Polar decoding |
| title_fullStr | Improved segmented CRC assisted puncturing Polar decoding |
| title_full_unstemmed | Improved segmented CRC assisted puncturing Polar decoding |
| title_short | Improved segmented CRC assisted puncturing Polar decoding |
| title_sort | improved segmented crc assisted puncturing polar decoding |
| topic | puncturing Polar code belief-propagation decoding CRC segmented decoding |
| url | http://www.telecomsci.com/zh/article/doi/10.11959/j.issn.1000-0801.2019007/ |
| work_keys_str_mv | AT yanhongni improvedsegmentedcrcassistedpuncturingpolardecoding AT xiangxionglou improvedsegmentedcrcassistedpuncturingpolardecoding AT jianrongbao improvedsegmentedcrcassistedpuncturingpolardecoding |