Low-Complexity Puncturing and Shortening of Polar Codes

January 23, 2017 Β· Declared Dead Β· πŸ› 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW)

πŸ‘» CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Valerio Bioglio, Frederic Gabry, Ingmar Land arXiv ID 1701.06458 Category cs.IT: Information Theory Citations 76 Venue 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW) Last Checked 5 months ago
Abstract
In this work, we address the low-complexity construction of shortened and punctured polar codes from a unified view. While several independent puncturing and shortening designs were attempted in the literature, our goal is a unique, low-complexity construction encompassing both techniques in order to achieve any code length and rate. We observe that our solution significantly reduces the construction complexity as compared to state-of-the-art solutions while providing a block error rate performance comparable to constructions that are highly optimized for specific lengths and rates. This makes the constructed polar codes highly suitable for practical application in future communication systems requiring a large set of polar codes with different lengths and rates.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

πŸ“œ Similar Papers

In the same crypt β€” Information Theory

Died the same way β€” πŸ‘» Ghosted