Results 241 to 250 of about 411,323 (275)
Some of the next articles are maybe not open access.
Polar-Code Construction of Golay Codes
IEEE Communications Letters, 2018This letter proposes a reinterpretation of the classical binary Golay codes as Polar codes with additional inner permutations and puncturing. This establishes a novel relationship between algebraic codes and codes based on Kronecker products, like polar codes.
Valerio Bioglio, Ingmar R Land
exaly +3 more sources
A Multi-Kernel Multi-Code Polar Decoder Architecture [PDF]
IEEE Transactions on Circuits and Systems I: Regular Papers, 2018 Polar codes have received increasing attention in the past decade, and have been selected for the next generation of wireless communication standard.
Gabriele Coppolino +2 more
exaly +4 more sources
Lossless source coding with polar codes
2010 IEEE International Symposium on Information Theory, 2010In this paper lossless compression with polar codes is considered. A polar encoding algorithm is developed and a method to design the code and compute the average compression rate for finite lengths is given. It is shown that the scheme achieves the optimal compression rate asymptotically. Furthermore, the proposed scheme has a very good performance at
HarmS. Cronie, Satish Babu Korada
openaire +1 more source
2013 International Conference on Wireless Communications and Signal Processing, 2013
Polarization, first introduced by Arikan, is a phenomenon that after some processing of a channel, the resulted channels are either almost clean channels or useless channels. In this paper we propose three schemes to polarize a MIMO channel and design the corresponding polar codes. In the first two schemes, the MIMO channel is decomposed into different
Xianbin Wang 0002 +2 more
openaire +1 more source
Polarization, first introduced by Arikan, is a phenomenon that after some processing of a channel, the resulted channels are either almost clean channels or useless channels. In this paper we propose three schemes to polarize a MIMO channel and design the corresponding polar codes. In the first two schemes, the MIMO channel is decomposed into different
Xianbin Wang 0002 +2 more
openaire +1 more source
2013 Information Theory and Applications Workshop (ITA), 2013
Balanced bipolar codes consist of sequences in which the symbols ‘−1’ and ‘+1’ appear equally often. Several generalizations to larger alphabets have been considered in literature. For example, for the q-ary alphabet {−q + 1, −q + 3, …, q − 1}, known concepts are symbol balancing, i.e., all alphabet symbols appear equally often in each codeword, and ...
Jos H. Weber +3 more
openaire +1 more source
Balanced bipolar codes consist of sequences in which the symbols ‘−1’ and ‘+1’ appear equally often. Several generalizations to larger alphabets have been considered in literature. For example, for the q-ary alphabet {−q + 1, −q + 3, …, q − 1}, known concepts are symbol balancing, i.e., all alphabet symbols appear equally often in each codeword, and ...
Jos H. Weber +3 more
openaire +1 more source
2015 IEEE International Symposium on Information Theory (ISIT), 2015
Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2-by-2 matrices and it was extended to larger matrices by Sasoglu et al. in 2010.
Narayanan Rengaswamy, Henry D. Pfister
openaire +1 more source
Arikan introduced polar codes in 2009 and proved that they achieve the symmetric capacity, under low-complexity successive cancellation decoding, of any binary-input discrete memoryless channel. Arikan's construction is based on the Kronecker product of 2-by-2 matrices and it was extended to larger matrices by Sasoglu et al. in 2010.
Narayanan Rengaswamy, Henry D. Pfister
openaire +1 more source
2016 IEEE Asia Pacific Conference on Circuits and Systems (APCCAS), 2016
A variation on channel polarization coding is presented. In standard channel polarization coding the code length is an integral power of two. Our scheme allows modifying the code at the graph definition level to an arbitrary blocklength. Working at the graph definition level of the code enables the utilization of the newly produced codes for every ...
openaire +1 more source
A variation on channel polarization coding is presented. In standard channel polarization coding the code length is an integral power of two. Our scheme allows modifying the code at the graph definition level to an arbitrary blocklength. Working at the graph definition level of the code enables the utilization of the newly produced codes for every ...
openaire +1 more source
A study on channel polarization and polar coding
2011 9th IEEE International Conference on ASIC, 2011In 2006, Arikan introduced the method of channel polarization on which one can construct efficient capacity-achieving codes, called polar codes, for any binary discrete memoryless channel (B-DMC). In this letter, we will give a description of the main ideas and mechanisms of this kind of codes.
Yichao Lu, Satoshi Goto
openaire +1 more source
Nature Reviews Molecular Cell Biology, 2004
Cell polarization is used both to mediate physical fates, as, for example, in orientated cell migration, and to specify differential phenotypic fates, as in the asymmetric division of stem cells. Strikingly, the same sets of conserved proteins are used throughout the Metazoa for these purposes.
openaire +2 more sources
Cell polarization is used both to mediate physical fates, as, for example, in orientated cell migration, and to specify differential phenotypic fates, as in the asymmetric division of stem cells. Strikingly, the same sets of conserved proteins are used throughout the Metazoa for these purposes.
openaire +2 more sources