Abstract
Arιkan has laid the foundations of systematic polar codes and has also indicated that the computational complexity order of the systematic polar encoder (SPE) can be the same of a nonsystematic polar encoder (NSPE) i.e., $\Theta{(N\log N)}$ . In this letter, we propose three efficient encoders along with their full pseudocode implementations, all with $\Theta{(N\log N)}$ complexity. These encoders work for any arbitrary choice of frozen bit indices, and they allow a tradeoff between the number of XOR computations and the number of bits of memory required by the encoder. We show that our best encoder requires exactly the same number of XORs as that of NSPE.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
