Journal
IEEE TRANSACTIONS ON INFORMATION THEORY
Volume 59, Issue 10, Pages 6562-6582Publisher
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2013.2272694
Keywords
Channel degrading and upgrading; channel polarization; construction algorithms; polar codes
Funding
- National Science Foundation
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1116820] Funding Source: National Science Foundation
Ask authors/readers for more resources
A method for efficiently constructing polar codes is presented and analyzed. Although polar codes are explicitly defined, straightforward construction is intractable since the resulting polar bit-channels have an output alphabet that grows exponentially with the code length. Thus, the core problem that needs to be solved is that of faithfully approximating a bit-channel with an intractably large alphabet by another channel having a manageable alphabet size. We devise two approximation methods which sandwich the original bit-channel between a degraded and an upgraded version thereof. Both approximations can be efficiently computed and turn out to be extremely close in practice. We also provide theoretical analysis of our construction algorithms, proving that for any fixed epsilon > 0 and all sufficiently large code lengths, polar codes whose rate is within of channel capacity can be constructed in time and space that are both linear in n.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available