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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call