Results 11 to 20 of about 409,239 (186)
Serially Concatenated Polar Codes
IEEE Access, 2018 Simulation results show that the performance of polar codes is improved vastly by using polar codes as inner codes in serially concatenated coding schemes.
Erdal Arikan
doaj +3 more sources
Concatenated Polar codes [PDF]
2010 IEEE International Symposium on Information Theory, 2010 Polar codes have attracted much recent attention as the first codes with low computational complexity that provably achieve optimal rate-regions for a large class of information-theoretic problems. One significant drawback, however, is that for current constructions the probability of error decays sub-exponentially in the block-length (more detailed ...
Bakshi, Mayank +2 more
openaire +3 more sources
Polar Codes’ Simplicity, Random Codes’ Durability [PDF]
IEEE Transactions on Information Theory, 2021 Over any discrete memoryless channel, we build codes such that: for one, their block error probabilities and code rates scale like random codes'; and for two, their encoding and decoding complexities scale like polar codes'. Quantitatively, for any constants $ , >0$ such that $ +2 <1$, we construct a sequence of error correction codes with ...
Hsin-Po Wang, Iwan M. Duursma
openaire +2 more sources
IEEE Transactions on Communications, 2013 A framework is proposed that allows for a joint description and optimization of both binary polar coding and $2^m$-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.
Seidl, Mathis +3 more
openaire +2 more sources
IEEE Communications Letters, 2011 Polar codes were originally introduced as a class of non-systematic linear block codes. This paper gives encoding and decoding methods for systematic polar coding that preserve the low-complexity nature of non-systematic polar coding while guaranteeing the same frame error rate.
openaire +5 more sources
2013 Information Theory and Applications Workshop (ITA), 2013 A capacity-achieving scheme based on polar codes is proposed for reliable communication over multi-channels which can be directly applied to bit-interleaved coded modulation schemes. We start by reviewing the ground-breaking work of polar codes and then discuss our proposed scheme.
Mahdavifar, Hessam +3 more
openaire +2 more sources
Optics Express, 2006 Two examples are presented to illustrate the advantages of polarization coded apertures, in which the incoming light will rotate its polarization at a portion of an aperture. In the first example the depth of field of a diffraction limited lens is increased without sacrificing the light throughput; in the second example the axial focal intensity of a ...
Wanli, Chi +2 more
openaire +2 more sources
2014 IEEE International Symposium on Information Theory, 2014 Polar codes, invented by Arikan in 2009, are known to achieve the capacity of any binary-input memoryless output-symmetric channel. One of the few drawbacks of the original polar code construction is that it is not universal. This means that the code has to be tailored to the channel if we want to transmit close to capacity. We present two "polar-like"
Hassani, S. Hamed, Urbanke, Rudiger
openaire +2 more sources
Polar codes and polar lattices for the Heegard-Berger problem [PDF]
, 2017 Explicit coding schemes are proposed to achieve the rate-distortion function of the Heegard-Berger problem using polar codes. Specifically, a nested polar code construction is employed to achieve the rate-distortion function for doublysymmetric binary ...
Gunduz, D, Ling, C, Liu, L, Shi, J
core +2 more sources
Polar Code decoder exploration framework [PDF]
Advances in Radio Science, 2018 The increasing demand for fast wireless communications requires sophisticated baseband signal processing. One of the computational intense tasks here is advanced Forward Error Correction (FEC), especially the decoding.
C. Kestel, S. Weithoffer, N. Wehn
doaj +1 more source