Browsing by Subject "Symmetric capacity"

Now showing 1 - 2 of 2

Open Access
Channel polarization: A method for constructing capacity-achieving codes
(IEEE, 2008-07) Arıkan, Erdal
A method is proposed, called channel polarization, to construct code sequences that achieve the symmetric capacity I(W) of any given binary-input discrete memoryless channel (B-DMC) W. The symmetric capacity I(W) is the highest rate achievable subject to using the input letters of the channel equiprobably and equals the capacity C(W) if the channel has certain symmetry properties. Channel polarization refers to the fact that it is possible to synthesize, out of N independent copies of a given B-DMC W, a different set of N binary-input channels such that the capacities of the latter set, except for a negligible fraction of them, are either near 1 or near 0. This second set of N channels are well-conditioned for channel coding: one need only send data at full rate through channels with capacity near 1 and at 0 rate through the others. The main coding theorem about polar coding states that, given any B-DMC W with I(W) > 0 and any fixed 0 < δ < I(W), there exist finite constants n1 (W, δ) and c(W, δ) such that for all n ≥ n1, there exist polar codes with block length N = 2n, rate R > I(W)-δ, and probability of block decoding error Pe ≤ cN-1/4. The codes with this performance can be encoded and decoded within complexity O(N log N). © 2008 IEEE.
Open Access
On the rate of channel polarization
(IEEE, 2009-06-07) Arıkan, Erdal; Telatar, E.
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 blockerror probability under successive cancellation decoding satisfies Pe(N;R) ≥ 2-Nβ for any β > 1/2 when the block-length N is large enough. © 2009 IEEE.