Comprehensive recognition algorithm of RS code based on fast code root trial
In order to solve the problem of high computation and high missed alarm probability of RS (Reed-Solomon) codes for recognition, comprehensive recognition algorithm of RS codes based on fast code root trial was proposed.Firstly, the check relationship was solved in binary equivalently and fast code r...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2022-11-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2022219/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In order to solve the problem of high computation and high missed alarm probability of RS (Reed-Solomon) codes for recognition, comprehensive recognition algorithm of RS codes based on fast code root trial was proposed.Firstly, the check relationship was solved in binary equivalently and fast code root trial was used to check parameters in sequence.Secondly, according to distribution characteristics of the combined code roots, m-level primitive polynomial field and error correction ability was associatively determined.Finally, the short codes and long codes were given different confidence weights and the determined parameters were comprehensively analyzed.The optimal parameter was selected and the generate polynomial was calculated.The proposed algorithm did not need prior information such as signal-to-noise ratio (SNR), and had good adaptability.The simulation results show that the proposed algorithm can effectively reduce the missed alarm probability under the condition of low complexity.Compared with the conventional hard decision algorithm, the performance of the proposed algorithm is improved, and the parameter recognition of RS codes can be completed quickly. |
|---|---|
| ISSN: | 1000-436X |