Error Bounds of Polar Codes Under Varying Channel Conditions

Conference: SCC 2015 - 10th International ITG Conference on Systems, Communications and Coding
02/02/2015 - 02/05/2015 at Hamburg, Germany

Proceedings: ITG-Fb 254: 10th International ITG Conference on Systems, Communications and Coding (SCC 2015)

Pages: 6Language: englishTyp: PDF

Personal VDE Members are entitled to a 10% discount on this title

Authors:
Schnelling, Christopher; Goertzen, Simon; Schmeink, Anke (Information Theory and Systematic Design of Communication Systems, UMIC Research Centre, RWTH Aachen University, 52062 Aachen, Germany)

Abstract:
Polar codes are the first linear block codes provably achieving the capacity of any binary-input discrete memoryless channel. Construction is explicit and both low-complexity encoding and decoding methods are available. As polar codes are constructed in a channel-specific manner, we investigate their performance under varying channel conditions. Focussing on the setting established in Arikan’s seminal work, we present a survey on the performance guarantees as implied by the successive cancellation decoder. Having established the theoretical setting, we present results for both binary erasure channels as well as binary symmetric channels.