Abstract:
A bound is given on the rate of channel polarization. As a corollary, an earlier bound on the probability of error for polar coding is improved. Specifically, it is shown...Show MoreMetadata
Abstract:
A bound is given on the rate of channel polarization. As a corollary, an earlier bound on the probability of error for polar coding is improved. Specifically, it is shown that, for any binary-input discrete memoryless channel W with symmetric capacity I(W) and any rate R ≪ I(W), the polar-coding block-error probability under successive cancellation decoding satisfies Pe(N, R) ≤ 2−Nβ for any β ≪ 1/2 when the block-length N is large enough.
Published in: 2009 IEEE International Symposium on Information Theory
Date of Conference: 28 June 2009 - 03 July 2009
Date Added to IEEE Xplore: 18 August 2009
ISBN Information: