Abstract
The blind identification of polar codes is to identify code parameters such as the code length, the number and positions of information bits in a polar code in non-cooperative communications. In this letter, we propose two low-complexity algorithms to identify code length and information bits of polar codes, respectively, by taking the union of both the estimated code parameters and the derived code parameters from the allowable shortest code without the candidate code sets. Simulations show that our proposed scheme is robust to the error and significantly improves the identification performance as compared to the existing purely code parameter estimation approaches.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.