Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

An Efficient Software List Sphere Decoder for Polar Codes

  • Published:
Journal of Signal Processing Systems Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Figure 1
Figure 2
Figure 3
Figure 4
Figure 5

References

  1. Arıkan, E., & Telatar, E. (2009). On the rate of channel polarization. In Proceedings of the IEEE International Symposium on Information Theory (ISIT) (pp. 1493–1495).

  2. Arıkan, E. (2009). Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels. IEEE Transactions on Information Theory, 55(7), 3051–3073.

    Article  MathSciNet  Google Scholar 

  3. Zhang, C., & Parhi, K.K. (2013). Low-latency sequential and overlapped architectures for successive cancellation polar decoder. IEEE Transactions on Signal Processing, 61(10), 2429–2441.

    Article  MathSciNet  Google Scholar 

  4. Tal, I., & Vardy, A. (2015). List decoding of polar codes. IEEE Transactions on Information Theory, 61(5), 2213–2226.

    Article  MathSciNet  Google Scholar 

  5. Shen, Y., Zhang, C., Yang, J., Zhang, S., You, X. (2016). Low-latency software successive cancellation list polar decoder using stage-located copy. In Proceedings of the IEEE International Conference on Digital Signal Processing (DSP) (pp. 84–88).

  6. Zhou, H., Zhang, C., Song, W., Xu, S., You, X. (2016). Segmented CRC-aided SC list polar decoding. In Proceedings of the IEEE 83rd Vehicular Technology Conference (VTC Spring) (pp. 1–5).

  7. Pohst, M. (1981). On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications. ACM Sigsam Bulletin, 15(1), 37–44.

    Article  MathSciNet  Google Scholar 

  8. Fincke, U., & Pohst, M. (1985). Improved methods for calculating vectors of short length in a lattice, including a complexity analysis. Mathematics of Computation, 44(170), 463–471.

    Article  MathSciNet  Google Scholar 

  9. Kahraman, S., & Çelebi, M.E. (2012). Code based efficient maximum-likelihood decoding of short polar codes. In Proceedings of the IEEE International Symposium on Information Theory Proceedings (ISIT) (pp. 1967–1971).

  10. Niu, K., Chen, K., Lin, J. (Jan. 2014). Low-complexity sphere decoding of polar codes based on optimum path metric. IEEE Communications Letters, 18(2), 332–335.

    Article  Google Scholar 

  11. Guo, J., & Fàbregas, A.G.I. (2015). Efficient sphere decoding of polar codes. In Proceedings of the IEEE International Symposium on Information Theory (ISIT) (pp. 236–240).

  12. Husmann, C., Nikolaou, P.C., Nikitopoulos, K. (2018). Reduced latency ML polar decoding via multiple sphere-decoding tree searches. IEEE Transactions on Vehicular Technology, 67(2), 1835–1839.

    Article  Google Scholar 

  13. Hashemi, S.A., Condo, C., Gross, W.J. (2015). List sphere decoding of polar codes. In Proceedings of the Asilomar Conference on Signals, Systems and Computers (Asilomar) (pp. 1346–1350).

  14. Zhou, H., Tan, X., Gross, W.J., Zhang, Z., You, X., Zhang, C. (2019). An improved software list sphere polar decoder with synchronous determination. IEEE Transactions on Vehicular Technology, 68(6), 5236–5245.

    Article  Google Scholar 

  15. Liang, X., Zhou, H., Zhang, Z., You, X., Zhang, C. (2018). Joint list polar decoder with successive cancellation and sphere decoding. In Proceedings of the IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) (pp. 1164–1168).

  16. Hashemi, S.A., Condo, C., Gross, W.J. (2016). A fast polar code list decoder architecture based on sphere decoding. IEEE Transactions on Circuits and Systems I, 63(12), 2368–2380.

    Article  Google Scholar 

  17. Tal, I., & Vardy, A. (2013). How to construct polar codes. IEEE Transactions on Information Theory, 59 (10), 6562–6582.

    Article  MathSciNet  Google Scholar 

  18. Trifonov, P. (2012). Efficient design and decoding of polar codes. IEEE Transactions on Communications, 60 (11), 3221–3227.

    Article  Google Scholar 

  19. Hassibi, B., & Vikalo, H. (2005). On the sphere-decoding algorithm I. Expected complexity. IEEE Transactions Signal Processing, 53(8), 2806–2818.

    Article  MathSciNet  Google Scholar 

  20. Hashemi, S.A., Condo, C., Gross, W.J. (2016). Matrix reordering for efficient list sphere decoding of polar codes. In Proceedings of the IEEE International Symposium on Circuits and Systems (ISCAS) (pp. 1730–1733).

  21. Hashemi, S.A., Condo, C., Gross, W.J. (2017). Fast and flexible successive-cancellation list decoders for polar codes. IEEE Transactions Signal Processing, 65(21), 5756–5769.

    Article  MathSciNet  Google Scholar 

  22. Leroux, C., Raymond, A.J., Sarkis, G., Gross, W.J. (2013). A semi-parallel successive-cancellation decoder for polar codes. IEEE Transactions Signal Processing, 61(2), 289–299.

    Article  MathSciNet  Google Scholar 

Download references

Acknowledgements

This work was supported in part by NSFC under Grants 61871115 and 61501116, in part by the Jiangsu Provincial NSF for Excellent Young Scholars under Grant BK20180059, in part by the Six Talent Peak Program of Jiangsu Province under Grant 2018-DZXX-001, in part by the Distinguished Perfection Professorship of Southeast University, in part by the Fundamental Research Funds for the Central Universities, in part by the SRTP of Southeast University, and in part by the Project Sponsored by the SRF for the Returned Overseas Chinese Scholars of MoE.

Author information

Authors and Affiliations

  1. Laboratory of Efficient Architectures for Digital-communication and Signal-processing (LEADS) of Southeast University, the National Mobile Communications Research Laboratory of Southeast University, Quantum Information Center of Southeast University, and the Purple Mountain Laboratories, Nanjing, 210096, China

    Huayi Zhou, Zaichen Zhang, Xiaohu You & Chuan Zhang

  2. School of Electronic Science and Engineering, Nanjing University, Nanjing, China

    Yuxiang Fu

  3. Department of Electrical and Computer Engineering, McGill University, Montréal, Canada

    Warren J. Gross

Authors
  1. Huayi Zhou
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuxiang Fu
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Zaichen Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Warren J. Gross
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Xiaohu You
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Chuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chuan Zhang.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhou, H., Fu, Y., Zhang, Z. et al. An Efficient Software List Sphere Decoder for Polar Codes. J Sign Process Syst 92, 517–528 (2020). https://doi.org/10.1007/s11265-019-01506-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11265-019-01506-0

Keywords

Search

Navigation