CUED Publications database

Efficient sphere decoding of polar codes

Guo, J and GuillenFabregas, A (2015) Efficient sphere decoding of polar codes. In: UNSPECIFIED pp. 236-240..

Full text not available from this repository.


© 2015 IEEE. The performance of the original successive cancellation decoder of short-length polar codes is inferior to that of the maximum-likelihood decoder. Existing sphere decoding algorithms of polar codes have a high computational complexity even for short lengths. This is because, when exploring the tree defined by the generator matrix of the code, existing algorithms employ loose branching conditions and end up visiting many more nodes than needed. We propose improved branching conditions that significantly reduce the search complexity. A simple example reports an improvement of two orders of magnitude at Eb over N0 = 4 dB compared to the standard sphere decoders.

Item Type: Conference or Workshop Item (UNSPECIFIED)
Uncontrolled Keywords: Polar codes Polar codes decoding Sphere decoding
Divisions: Div F > Signal Processing and Communications
Depositing User: Cron Job
Date Deposited: 05 Mar 2018 20:10
Last Modified: 21 Mar 2019 02:00
DOI: 10.1109/ISIT.2015.7282452