Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes
Data(s) |
2014
|
---|---|
Resumo |
Polar codes are one of the most recent advancements in coding theory and they have attracted significant interest. While they are provably capacity achieving over various channels, they have seen limited practical applications. Unfortunately, the successive nature of successive cancellation based decoders hinders fine-grained adaptation of the decoding complexity to design constraints and operating conditions. In this paper, we propose a systematic method for enabling complexity-performance trade-offs by constructing polar codes based on an optimization problem which minimizes the complexity under a suitably defined mutual information based performance constraint. Moreover, a low-complexity greedy algorithm is proposed in order to solve the optimization problem efficiently for very large code lengths. |
Identificador | |
Idioma(s) |
eng |
Publicador |
Institute of Electrical and Electronics Engineers (IEEE) |
Direitos |
info:eu-repo/semantics/restrictedAccess |
Fonte |
Balatsoukas-Stimming , A , Karakonstantis , G & Burg , A 2014 , Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes . in IEEE International Symposium on Information Theory - Proceedings . , 6875380 , Institute of Electrical and Electronics Engineers (IEEE) , pp. 2977-2981 . DOI: 10.1109/ISIT.2014.6875380 |
Palavras-Chave | #Computer Science - Information Theory |
Tipo |
contributionToPeriodical |