Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes

A. Balatsoukas-Stimming, G. Karakonstantis, A. Burg

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)


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.
Original languageEnglish
Title of host publicationIEEE International Symposium on Information Theory - Proceedings
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Number of pages5
ISBN (Print)9781479951864
Publication statusPublished - 2014


  • Computer Science - Information Theory

Fingerprint Dive into the research topics of 'Enabling Complexity-Performance Trade-Offs for Successive Cancellation Decoding of Polar Codes'. Together they form a unique fingerprint.

Cite this