Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Computer Communicati...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
Computer Communications
Article . 2018 . Peer-reviewed
License: Elsevier TDM
Data sources: Crossref
DBLP
Article . 2018
Data sources: DBLP
versions View all 2 versions
addClaim

Polar codes with the unequal error protection property

Authors: Chen Cui; Wei Xiang 0001; Zhenyong Wang; Qing Guo 0001;

Polar codes with the unequal error protection property

Abstract

Abstract The Internet of Things (IoT) is expected to support a wide variety of devices with different transmission reliability requirements. Channel codes with the unequal error protection (UEP) property are rather appealing for such applications. As the first provably capacity-achieving codes, polar codes have excellent error-correcting performances over a wide range of block lengths with low encoding and decoding complexities, which makes these codes well-suited for the energy-constrained IoT applications. Polar codes with unequal error protection are desirable. However, the UEP property of polar codes has not been explored explicitly in existing works. In this paper, a construction method for UEP polar codes is proposed based upon a novel selection rule of bit-channels. Refreezing and reselecting operations are employed to enable the UEP property for polar codes. The upper and lower bounds on the block error rate (BLER) of each data block are derived. Simulation results show that the proposed codes can provide a good performance of unequal error protection.

Country
Australia
Keywords

003

  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    14
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Top 10%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
14
Top 10%
Top 10%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!