An Efficient Software List Sphere Decoder for Polar Codes

Abstract

Polar codes, first achieving the capacity of symmetric binary-input discrete memoryless channels (B-DMCs), have been standardized for eMBB control channels. Since 5G cellular requires flexible architecture which is realized by the software defined networking paradigm, efficient polar decoder is anticipated. Though successive cancellation list (SCL) decoder achieves satisfactory performance, it requires a large amount of memory. For short control channel codes, sphere decoder (SD) is an alternative, but costs unbearable time complexity at low signal-to-noise ratio. List sphere decoder (LSD) abandons the radius and keeps a list of best paths to gain a fixed complexity. However, LSD needs a large list size L for satisfactory performance. In this paper, an efficient software LSD with path pruning and efficient sorting is proposed. We recall the radius as the bound to delete the paths out of the sphere at very early levels. Since L is dynamic, efficient sorting is proposed to reduce the copy operations. Implemented with C++, the proposed decoder can reduce up to 65.3% latency compared with the original LSD, with the same performance and lower complexity.