Polar code constructions based on mutual information or Bhattacharyya parameters of bit-channels are intended for hard-output successive cancellation (SC) decoders, and thus might not be well designed for use with other decoders, such as soft-output belief propagation (BP) decoders or successive cancellation list (SCL) decoders. In this letter, we use the evolution of messages, i.e., log-likelihood ratios, of unfrozen bits during iterative BP decoding of polar codes to identify weak bit-channels, and then modify the conventional polar code construction by swapping these bit-channels with strong frozen bit-channels. The modified codes show improved performance not only under BP decoding, but also under SCL decoding. The code modification is ...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...
Polar codes are the first family of error-correcting codes that was proved to achieve the capacity o...
Soft-output (SO) decoding is proposed for the Logarithmic Successive Cancellation List (Log-SCL) pol...
Soft-output (SO) decoding is proposed for the Logarithmic Successive Cancellation List (Log-SCL) pol...
Soft-output (SO) decoding is proposed for the Logarithmic Successive Cancellation List (Log-SCL) pol...
Polar coding is a recent technique in communications over Binary Discrete Memoryless Channels (BDMC)...
Belief Propagation (BP) algorithm is suitable for high-throughput decoding of polar codes due to its...
Belief propagation (BP) decoding for polar codes has been extensively studied because of its inheren...
Due to the design principle of parallel processing, belief propagation (BP) decoding is attractive, ...
Key Words: polar codes, Reed-Muller codes, minimum distance, channel polarization, SCL decoder Polar...
Polar codes are provably symmetric capacity achieving codes for any given binary input discrete memo...
Abstract In this letter, a modified message passing algorithm to prevent short cycles in the factor ...
The construction of polar codes with code length $n=2^m$ involves $m$ layers of polar transforms. In...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...
Polar codes are the first family of error-correcting codes that was proved to achieve the capacity o...
Soft-output (SO) decoding is proposed for the Logarithmic Successive Cancellation List (Log-SCL) pol...
Soft-output (SO) decoding is proposed for the Logarithmic Successive Cancellation List (Log-SCL) pol...
Soft-output (SO) decoding is proposed for the Logarithmic Successive Cancellation List (Log-SCL) pol...
Polar coding is a recent technique in communications over Binary Discrete Memoryless Channels (BDMC)...
Belief Propagation (BP) algorithm is suitable for high-throughput decoding of polar codes due to its...
Belief propagation (BP) decoding for polar codes has been extensively studied because of its inheren...
Due to the design principle of parallel processing, belief propagation (BP) decoding is attractive, ...
Key Words: polar codes, Reed-Muller codes, minimum distance, channel polarization, SCL decoder Polar...
Polar codes are provably symmetric capacity achieving codes for any given binary input discrete memo...
Abstract In this letter, a modified message passing algorithm to prevent short cycles in the factor ...
The construction of polar codes with code length $n=2^m$ involves $m$ layers of polar transforms. In...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...
International audienceFor finite blocklength polar codes, the minimum distance and the number of low...