Abstract
Polar Codes are the first binary linear codes that provably achieve the symmetric capacity of arbitrary binary-input discrete memoryless channels. Their construction is explicit as implied by the transformations that lead to channel polarization, and low-complexity encoding and decoding methods are available. While being explicitly defined, exact construction is intractable as it depends on calculating channel parameters of channels whose output alphabets grow exponentially in the code length. To overcome this problem, heuristics have been proposed. In this work, we show how to accelerate one popular construction method by introducing two modifications to the channel transformation step, leaving quality of the results unaffected.
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.
