965 research outputs found
Polar Subcodes
An extension of polar codes is proposed, which allows some of the frozen
symbols, called dynamic frozen symbols, to be data-dependent. A construction of
polar codes with dynamic frozen symbols, being subcodes of extended BCH codes,
is proposed. The proposed codes have higher minimum distance than classical
polar codes, but still can be efficiently decoded using the successive
cancellation algorithm and its extensions. The codes with Arikan, extended BCH
and Reed-Solomon kernel are considered. The proposed codes are shown to
outperform LDPC and turbo codes, as well as polar codes with CRC.Comment: Accepted to IEEE JSAC special issue on Recent Advances In Capacity
Approaching Code
Algebraic matching techniques for fast decoding of polar codes with Reed-Solomon kernel
We propose to reduce the decoding complexity of polar codes with non-Arikan
kernels by employing a (near) ML decoding algorithm for the codes generated by
kernel rows. A generalization of the order statistics algorithm is presented
for soft decoding of Reed-Solomon codes. Algebraic properties of the
Reed-Solomon code are exploited to increase the reprocessing order. The
obtained algorithm is used as a building block to obtain a decoder for polar
codes with Reed-Solomon kernel.Comment: Accepted to ISIT 201
Recursive Descriptions of Polar Codes
Polar codes are recursive general concatenated codes. This property motivates
a recursive formalization of the known decoding algorithms: Successive
Cancellation, Successive Cancellation with Lists and Belief Propagation. Using
such description allows an easy development of these algorithms for arbitrary
polarizing kernels. Hardware architectures for these decoding algorithms are
also described in a recursive way, both for Arikan's standard polar codes and
for arbitrary polarizing kernels
Polar Codes with Mixed-Kernels
A generalization of the polar coding scheme called mixed-kernels is
introduced. This generalization exploits several homogeneous kernels over
alphabets of different sizes. An asymptotic analysis of the proposed scheme
shows that its polarization properties are strongly related to the ones of the
constituent kernels. Simulation of finite length instances of the scheme
indicate their advantages both in error correction performance and complexity
compared to the known polar coding structures
Polar-Coded Modulaton
A framework is proposed that allows for a joint description and optimization
of both binary polar coding and -ary digital pulse-amplitude modulation
(PAM) schemes such as multilevel coding (MLC) and bit-interleaved coded
modulation (BICM). The conceptual equivalence of polar coding and multilevel
coding is pointed out in detail. Based on a novel characterization of the
channel polarization phenomenon, rules for the optimal choice of the labeling
in coded modulation schemes employing polar codes are developed. Simulation
results regarding the error performance of the proposed schemes on the AWGN
channel are included
Fast Decoding of Multi-Kernel Polar Codes
Polar codes are a class of linear error correction codes which provably
attain channel capacity with infinite codeword lengths. Finite length polar
codes have been adopted into the 5th Generation 3GPP standard for New Radio,
though their native length is limited to powers of 2. Utilizing multiple
polarizing matrices increases the length flexibility of polar codes at the
expense of a more complicated decoding process. Successive cancellation (SC) is
the standard polar decoder and has time complexity due
to its sequential nature. However, some patterns in the frozen set mirror
simple linear codes with low latency decoders, which allows for a significant
reduction in SC latency by pruning the decoding schedule. Such fast decoding
techniques have only previously been used for traditional Arikan polar codes,
causing multi-kernel polar codes to be an impractical length-compatibility
technique with no fast decoders available. We propose fast simplified
successive cancellation decoding node patterns, which are compatible with polar
codes constructed with both the Arikan and ternary kernels, and generalization
techniques. We outline efficient implementations, made possible by imposing
constraints on ternary node parameters. We show that fast decoding of
multi-kernel polar codes has at least 72% reduced latency compared with an SC
decoder in all cases considered where codeword lengths are (96, 432, 768,
2304).Comment: To appear in IEEE WCNC 2019 (Submitted September 25, 2018), 6 page
Decoder-tailored Polar Code Design Using the Genetic Algorithm
We propose a new framework for constructing polar codes (i.e., selecting the
frozen bit positions) for arbitrary channels, and tailored to a given decoding
algorithm, rather than based on the (not necessarily optimal) assumption of
successive cancellation (SC) decoding. The proposed framework is based on the
Genetic Algorithm (GenAlg), where populations (i.e., collections) of
information sets evolve successively via evolutionary transformations based on
their individual error-rate performance. These populations converge towards an
information set that fits both the decoding behavior and the defined channel.
Using our proposed algorithm over the additive white Gaussian noise (AWGN)
channel, we construct a polar code of length 2048 with code rate 0.5, without
the CRC-aid, tailored to plain successive cancellation list (SCL) decoding,
achieving the same error-rate performance as the CRC-aided SCL decoding, and
leading to a coding gain of 1 dB at BER of . Further, a belief
propagation (BP)-tailored construction approaches the SCL error-rate
performance without any modifications in the decoding algorithm itself. The
performance gains can be attributed to the significant reduction in the total
number of low-weight codewords. To demonstrate the flexibility, coding gains
for the Rayleigh channel are shown under SCL and BP decoding. Besides
improvements in error-rate performance, we show that, when required, the GenAlg
can be also set up to reduce the decoding complexity, e.g., the SCL list size
or the number of BP iterations can be reduced, while maintaining the same
error-rate performance.Comment: This work has been submitted to the IEEE for possible publication.
Manuscript submitted September 20, 2018; revised January 28, 2019; date of
current version January 28, 2019. arXiv admin note: substantial text overlap
with arXiv:1901.0644
Efficient decoding of polar codes with some 1616 kernels
A decoding algorithm for polar codes with binary 1616 kernels with
polarization rate 0.51828 and scaling exponents 3.346 and 3.450 is presented.
The proposed approach exploits the relationship of the considered kernels and
the Arikan matrix to significantly reduce the decoding complexity without any
performance loss. Simulation results show that polar (sub)codes with
1616 kernels can outperform polar codes with Arikan kernel, while
having lower decoding complexity.Comment: This is the extended version of the conference paper. Minor typos are
fixed, arithmetical complexity computations are refine
Convolutional Polar Codes
Arikan's Polar codes attracted much attention as the first efficiently
decodable and capacity achieving codes. Furthermore, Polar codes exhibit an
exponentially decreasing block error probability with an asymptotic error
exponent upper bounded by 1/2. Since their discovery, many attempts have been
made to improve the error exponent and the finite block-length performance,
while keeping the bloc-structured kernel. Recently, two of us introduced a new
family of efficiently decodable error-correction codes based on a recently
discovered efficiently-contractible tensor network family in quantum many-body
physics, called branching MERA. These codes, called branching MERA codes,
include Polar codes and also extend them in a non-trivial way by substituting
the bloc-structured kernel by a convolutional structure. Here, we perform an
in-depth study of a particular example that can be thought of as a direct
extension to Arikan's Polar code, which we therefore name Convolutional Polar
codes. We prove that these codes polarize and exponentially suppress the
channel's error probability, with an asymptotic error exponent log_2(3)/2 which
is provably better than for Polar codes under successive cancellation decoding.
We also perform finite block-size numerical simulations which display improved
error-correcting capability with only a minor impact on decoding complexity.Comment: Subsumes arXiv:1312.457
Window Processing of Binary Polarization Kernels
A decoding algorithm for polar (sub)codes with binary
polarization kernels is presented. It is based on the window processing (WP)
method, which exploits the linear relationship of the polarization kernels and
the Arikan matrix. This relationship enables one to compute the kernel input
symbols probabilities by computing the probabilities of several paths in Arikan
successive cancellation (SC) decoder.
In this paper we propose an improved version of WP, which has significantly
lower arithmetic complexity and operates in log-likelihood ratios (LLRs)
domain. The algorithm identifies and reuses common subexpressions arising in
computation of Arikan SC path scores.
The proposed algorithm is applied to kernels of size 16 and 32 with improved
polarization properties. It enables polar (sub)codes with the considered
kernels to simultaneously provide better performance and lower decoding
complexity compared with polar (sub)codes with Arikan kernel.Comment: Final version to appear in IEEE Transactions on Communications. The
source code is available at https://github.com/gtrofimiuk/SCLKernelDecode
- β¦