期刊
IEEE TRANSACTIONS ON INFORMATION THEORY
卷 59, 期 10, 页码 6562-6582出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TIT.2013.2272694
关键词
Channel degrading and upgrading; channel polarization; construction algorithms; polar codes
资金
- National Science Foundation
- Division of Computing and Communication Foundations
- Direct For Computer & Info Scie & Enginr [1116820] Funding Source: National Science Foundation
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据