212 research outputs found
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
Large Kernel Polar Codes with efficient Window Decoding
In this paper, we modify polar codes constructed with some 2^t x 2^t
polarization kernels to reduce the time complexity of the window decoding. This
modification is based on the permutation of the columns of the kernels. This
method is applied to some of the kernels constructed in the literature of size
16 and 32, with different error exponents and scaling exponents such as eNBCH
kernel. It is shown that this method reduces the complexity of the window
decoding significantly without affecting the performance
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
Using concatenated algebraic geometry codes in channel polarization
Polar codes were introduced by Arikan in 2008 and are the first family of
error-correcting codes achieving the symmetric capacity of an arbitrary
binary-input discrete memoryless channel under low complexity encoding and
using an efficient successive cancellation decoding strategy. Recently,
non-binary polar codes have been studied, in which one can use different
algebraic geometry codes to achieve better error decoding probability. In this
paper, we study the performance of binary polar codes that are obtained from
non-binary algebraic geometry codes using concatenation. For binary polar codes
(i.e. binary kernels) of a given length , we compare numerically the use of
short algebraic geometry codes over large fields versus long algebraic geometry
codes over small fields. We find that for each there is an optimal choice.
For binary kernels of size up to a concatenated Reed-Solomon
code outperforms other choices. For larger kernel sizes concatenated Hermitian
codes or Suzuki codes will do better.Comment: 8 pages, 6 figure
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 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
Capacity-Achieving Polar Codes for Arbitrarily-Permuted Parallel Channels
Channel coding over arbitrarily-permuted parallel channels was first studied
by Willems et al. (2008). This paper introduces capacity-achieving polar coding
schemes for arbitrarily-permuted parallel channels where the component channels
are memoryless, binary-input and output-symmetric
Multilevel Polar-Coded Modulation
A framework is proposed that allows for a joint description and optimization
of both binary polar coding and the multilevel coding (MLC) approach for
-ary digital pulse-amplitude modulation (PAM). 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 bit labeling in this coded modulation scheme employing
polar codes are developed. Simulation results for the AWGN channel are
included.Comment: submitted to IEEE ISIT 201
On the Polarizing Behavior and Scaling Exponent of Polar Codes with Product Kernels
Polar codes, introduced by Arikan, achieve the capacity of arbitrary
binary-input discrete memoryless channel under successive cancellation
decoding. Any such channel having capacity and for any coding scheme
allowing transmission at rate , scaling exponent is a parameter which
characterizes how fast gap to capacity decreases as a function of code length
for a fixed probability of error. The relation between them is given by
. Scaling exponent for kernels of small size up
to have been exhaustively found. In this paper, we consider product
kernels obtained by taking Kronecker product of component kernels. We
derive the properties of polarizing product kernels relating to number of
product kernels, self duality and partial distances in terms of the respective
properties of the smaller component kernels. Subsequently, polarization
behavior of component kernel is used to calculate scaling exponent of
. Using this method, we show that Further, we employ a heuristic approach to construct good kernel
of from kernel having size having best and find
Comment: 6 pages, accepted in National Conference on Communications (NCC) 202
- …