Title :
A lower bound on achievable rates by polar codes with mismatch polar decoding
Author_Institution :
Inf. Theor. Lab., Ecole Polytech. Fed. de Lausanne, Lausanne, Switzerland
Abstract :
In this paper we show that mismatched polar codes over symmetric B-DMCs symmetrized under the same permutation can achieve rates of at least I(W, V) bits whenever I(W, V) > 0, where W denotes the communication channel, V the mismatched channel used in the code design including both the encoder and decoder, and I(W, V) × Σy Σx ϵ {0,1} 1/2 W(y|x) log2 (V(y|x))/(1/2V(y|0) + 1/2V(y|1)).
Keywords :
channel coding; decoding; telecommunication channels; B-DMC symmetry; binary discrete memoryless channel; communication channel; encoder; lower bound; mismatch polar decoding; mismatched channel code design; mismatched polar code; Communication channels; Convergence; Decoding; Error probability; Manganese; Random variables; channel polarization; mismatched decoding; polar codes;
Conference_Titel :
Information Theory Workshop (ITW), 2013 IEEE
Conference_Location :
Sevilla
Print_ISBN :
978-1-4799-1321-3
DOI :
10.1109/ITW.2013.6691214
