Capacity-Achieving Rate-Compatible Polar Codes

被引:0
|
作者
Hong, Song-Nam [1 ]
Hui, Dennis [2 ]
Maric, Ivana [2 ]
机构
[1] Ajou Univ, Suwon, South Korea
[2] Ericsson Res, San Jose, CA USA
来源
2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY | 2016年
关键词
Polar codes; channel capacity; capacity-achieving codes; rate-compatibility; retransmissions; HARQ-IR;
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We present a method of constructing rate-compatible polar codes that are capacity-achieving with low-complexity sequential decoders. The proposed code construction allows for incremental retransmissions at different rates in order to adapt to channel conditions. The main idea of the construction exploits certain common characteristics of polar codes that are optimized for a sequence of degraded channels. The proposed approach allows for an optimized polar code to be used at every transmission thereby achieving capacity. Due to the length limitation of conventional polar codes, the proposed construction can only support a restricted set of rates that is characterized by the size of the kernel when conventional polar codes are used. We thus consider punctured polar codes which provide more flexibility on block length by controlling a puncturing fraction. We show the existence of capacity-achieving punctured polar codes for any given puncturing fraction. Using punctured polar codes as constituent codes, we show that the proposed rate-compatible polar code is capacity-achieving for an arbitrary sequence of rates and for any class of degraded channels.
引用
收藏
页码:41 / 45
页数:5
相关论文
共 50 条
  • [21] Design and Performance of Rate-Compatible Non-binary LDPC Convolutional Codes
    Uchikawa, Hironori
    Kasai, Kenta
    Sakaniwa, Kohichi
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2011, E94A (11) : 2135 - 2143
  • [22] Construction of rate-compatible LDPC codes utilizing information shortening and parity puncturing
    Tian T.
    Jones C.R.
    EURASIP Journal on Wireless Communications and Networking, 2005 (5) : 789 - 795
  • [23] Capacity-Achieving Codes for Finite-State Channels with Maximum-Likelihood Decoding
    Bae, Jung Hyun
    Anastasopoulos, Achilleas
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2009, 27 (06) : 974 - 984
  • [24] Rate-compatible LDPC-RS Product Codes Based on Raptor-like LDPC codes
    Li, Yaqi
    Liu, Bo
    Rong, Bo
    Wu, Yiyan
    Gagnon, Gilles
    Gui, Lin
    Zhang, Wenjun
    2013 IEEE INTERNATIONAL SYMPOSIUM ON BROADBAND MULTIMEDIA SYSTEMS AND BROADCASTING (BMSB), 2013,
  • [25] Rate-compatible spatially coupled repeat-accumulate codes via successive extension
    刘洋
    Wang Bin
    Zhang Yuzhi
    Sun Yanjing
    HighTechnologyLetters, 2019, 25 (02) : 224 - 229
  • [26] Syndrome-Coupled Rate-Compatible Error-Correcting Codes: Theory and Application
    Huang, Pengfei
    Liu, Yi
    Zhang, Xiaojie
    Siegel, Paul H.
    Haratsch, Erich F.
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2020, 66 (04) : 2311 - 2330
  • [27] Rate-compatible spatially coupled repeat-accumulate codes via successive extension
    Liu Y.
    Wang B.
    Zhang Y.
    Sun Y.
    High Technology Letters, 2019, 25 (02) : 224 - 229
  • [28] Achieving the Secrecy Capacity of Wiretap Channels Using Polar Codes
    Mahdavifar, Hessam
    Vardy, Alexander
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (10) : 6428 - 6443
  • [29] Rate-compatible low-density parity-check codes for digital subscriber lines
    Dholakia, A
    Ölçer, S
    2004 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS, VOLS 1-7, 2004, : 415 - 419
  • [30] Complexity versus performance of capacity-achieving irregular repeat-accumulate codes on the binary erasure channel
    Sason, I
    Urbanke, R
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (06) : 1247 - 1256