Results 231 to 240 of about 85,227 (257)
Some of the next articles are maybe not open access.
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
IEEE Transactions on Information Theory, 2015
An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes ...
openaire +1 more source
An optimization algorithm for finding a shortening pattern and a set of frozen symbols for polar codes is proposed. The structure of polar codes is exploited to eliminate many equivalent shortening patterns, thus reducing the search space. A reduced-complexity suboptimal algorithm is proposed for finding shortening patterns for long polar codes ...
openaire +1 more source
2013 IEEE International Symposium on Information Theory, 2013
We study a family of polar codes whose frozen set is such that it discards the bit channels for which the mutual information falls below a certain (fixed) threshold. We show that if the threshold, which might depend on the code length, is bounded appropriately, a coding theorem can be proved for the underlying polar code.
Jing Guo +2 more
openaire +2 more sources
We study a family of polar codes whose frozen set is such that it discards the bit channels for which the mutual information falls below a certain (fixed) threshold. We show that if the threshold, which might depend on the code length, is bounded appropriately, a coding theorem can be proved for the underlying polar code.
Jing Guo +2 more
openaire +2 more sources
Practical Product Code Construction of Polar Codes
IEEE Transactions on Signal Processing, 2020Valerio Bioglio +2 more
exaly
Polar Code Parameter Recognition Algorithm Based on Dual Space
Electronics (Switzerland), 2022Zhaojun Wu
exaly