On the encoding complexity of systematic polar codes
Authors:
- 1 September 2015
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 415-420
Abstract
Systematic polar codes are proposed by Arikan and are shown to have better BER performance than non-systematic polar codes. From a recursive decomposition of the generator matrix of polar codes, Arikan showed that the encoding complexity of systematic polar codes is also O(N log N) where N is the code block length. But the recursive process involves some additional calculations in transforming the problem instances back and forth. In this paper, by using the sparsity property of the generator matrix, we propose an encoding process which has the same complexity as non-systematic polar codes in the presence of an additional memory array. Without the additional memory elements, the number of additions of the proposed encoding process increases compared with non-systematic polar codes. We also provide an analysis to quantify this additional increase of the complexity.Keywords
This publication has 9 references indexed in Scilit:
- Enhanced belief propagation decoding of polar codes through concatenation2014
- Improved Successive Cancellation Decoding of Polar CodesIEEE Transactions on Communications, 2013
- A practical approach to polar codes2011
- List decoding of polar codes2011
- Systematic Polar CodingIEEE Communications Letters, 2011
- On bit error rate performance of polar codes in finite regime2010
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless ChannelsIEEE Transactions on Information Theory, 2009
- Performance of polar codes for channel and source coding2009
- A performance comparison of polar codes and Reed-Muller codesIEEE Communications Letters, 2008