Polar Code Construction for List Decoding
Authors:
- Tobias PrinzTPTobias Prinz
- Georg BöchererGBGeorg Böcherer
- Onurcan İşcanOIOnurcan İşcan
- Ronald BöhnkeRBRonald Böhnke
Preprint
Abstract
A heuristic construction of polar codes for successive cancellation list (SCL) decoding with a given list size is proposed to balance the trade-off between performance measured in frame error rate (FER) and decoding complexity. Furthermore, a construction based on dynamically frozen bits with constraints among the "low weight bits" (LWB) is presented. Simulation results show that the LWB-polar codes outperform the CRC-polar codes and the eBCH-polar codes under SCL decoding.Keywords
All Related Versions
This publication has 9 references indexed in Scilit:
- Minimum-Distance Based Construction of Multi-Kernel Polar Codes2017
- On the error probability of short concatenated polar and cyclic codes with interleaving2017
- Polar SubcodesIEEE Journal on Selected Areas in Communications, 2015
- An Adaptive Successive Cancellation List Decoder for Polar Codes with Cyclic Redundancy CheckIEEE Communications Letters, 2012
- Performance of Polar Codes with the Construction using Density EvolutionIEEE Communications Letters, 2009
- 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
- Convergence Analysis and Optimal Scheduling for Multiple Concatenated CodesIEEE Transactions on Information Theory, 2005
- Design of Low-Density Parity-Check Codes for Modulation and DetectionIEEE Transactions on Communications, 2004