Abstract
Polar codes are capacity achieving codes for binary-input symmetric memoryless channels (B-SMCs) if the code word length tends to infinity. Its encoding and decoding complexity is low. However, low complexity in code construction holds only for some special B-SMCs like the binary erasure channel (BEC). For all other B-SMCs, the code construction becomes a trade off between low complexity and construction accuracy. This paper gives an overview on the most popular code construction methods including a new approach yielding to near optimum code construction while reducing the complexity and increasing robustness against numerical problems. In addition, we compare the performance of the presented methods in terms of frame error rates (FERs) for codes of length 2048.
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.
