Blind recognition of primitive BCH code based on average cosine conformity
In order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code length and m-level primitive polynomial fields,the...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2020-01-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020022/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1841539356115861504 |
|---|---|
| author | Zhaojun WU Limin ZHANG Zhaogen ZHONG Yufeng LONG |
| author_facet | Zhaojun WU Limin ZHANG Zhaogen ZHONG Yufeng LONG |
| author_sort | Zhaojun WU |
| collection | DOAJ |
| description | In order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code length and m-level primitive polynomial fields,the code length was identified by matching the initial code roots.Secondly,on the premise of recognizing the code length,the GF(2<sup>m</sup>) domain was traversed under the m-level primitive polynomial and the primitive polynomial with the strongest error-correcting ability was the generator polynomial for the domain.Finally,the minimum common multiple corresponding to the minimum polynomial of code roots was obtained,and the BCH code generator polynomial was recognized.In checking matching,the statistic of average cosine conformity was introduced.The optimal threshold was solved based on the minimum error decision criterion and distribution of the statistic to realize the fast identification of the BCH.The simulation results show that the deduced statistical characteristics are consistent with the actual situation,and the proposed algorithm can achieve reliable recognition under SNR of 5 dB and code length of 511.Comparing with existing algorithms,the performance of the proposed algorithm is better than that of the existing soft-decision algorithm and 1~3.5 dB better than that of the hard-decision algorithms. |
| format | Article |
| id | doaj-art-768b788b49d744acba64a84f8cce76cb |
| institution | Kabale University |
| issn | 1000-436X |
| language | zho |
| publishDate | 2020-01-01 |
| publisher | Editorial Department of Journal on Communications |
| record_format | Article |
| series | Tongxin xuebao |
| spelling | doaj-art-768b788b49d744acba64a84f8cce76cb2025-01-14T07:18:19ZzhoEditorial Department of Journal on CommunicationsTongxin xuebao1000-436X2020-01-0141152459732381Blind recognition of primitive BCH code based on average cosine conformityZhaojun WULimin ZHANGZhaogen ZHONGYufeng LONGIn order to overcome the poor performance of existing algorithms for recognition of BCH code in low signal-to-noise ratio (SNR),a recognition algorithm based on average cosine conformity was proposed.Firstly,by traversing the possible values of code length and m-level primitive polynomial fields,the code length was identified by matching the initial code roots.Secondly,on the premise of recognizing the code length,the GF(2<sup>m</sup>) domain was traversed under the m-level primitive polynomial and the primitive polynomial with the strongest error-correcting ability was the generator polynomial for the domain.Finally,the minimum common multiple corresponding to the minimum polynomial of code roots was obtained,and the BCH code generator polynomial was recognized.In checking matching,the statistic of average cosine conformity was introduced.The optimal threshold was solved based on the minimum error decision criterion and distribution of the statistic to realize the fast identification of the BCH.The simulation results show that the deduced statistical characteristics are consistent with the actual situation,and the proposed algorithm can achieve reliable recognition under SNR of 5 dB and code length of 511.Comparing with existing algorithms,the performance of the proposed algorithm is better than that of the existing soft-decision algorithm and 1~3.5 dB better than that of the hard-decision algorithms.http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020022/primitive BCH codeaverage cosine conformitysoft decisionminimum error decision criterionrecognition |
| spellingShingle | Zhaojun WU Limin ZHANG Zhaogen ZHONG Yufeng LONG Blind recognition of primitive BCH code based on average cosine conformity Tongxin xuebao primitive BCH code average cosine conformity soft decision minimum error decision criterion recognition |
| title | Blind recognition of primitive BCH code based on average cosine conformity |
| title_full | Blind recognition of primitive BCH code based on average cosine conformity |
| title_fullStr | Blind recognition of primitive BCH code based on average cosine conformity |
| title_full_unstemmed | Blind recognition of primitive BCH code based on average cosine conformity |
| title_short | Blind recognition of primitive BCH code based on average cosine conformity |
| title_sort | blind recognition of primitive bch code based on average cosine conformity |
| topic | primitive BCH code average cosine conformity soft decision minimum error decision criterion recognition |
| url | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2020022/ |
| work_keys_str_mv | AT zhaojunwu blindrecognitionofprimitivebchcodebasedonaveragecosineconformity AT liminzhang blindrecognitionofprimitivebchcodebasedonaveragecosineconformity AT zhaogenzhong blindrecognitionofprimitivebchcodebasedonaveragecosineconformity AT yufenglong blindrecognitionofprimitivebchcodebasedonaveragecosineconformity |