The Journal of Supercomputing

, Volume 75, Issue 11, pp 7037–7052 | Cite as

A novel semi-folded parallel successive cancellation-based polar decoder for optimal-register allocation

  • G. Indumathi
  • V. P. M. B. AarthiEmail author
  • M. Ramesh


Efficient compression and reliable data transmission are the major areas in the information theory that governs various applications in mobile communication, Internets and modern digital technology. The exploitation of data patterns and redundancies offers better compression without loss of user information. The trade-off between the storage and the quality is the major requirement to apply the coding scheme in very large-scale integration. Alternatively, the reliable transmission in the presence of noise requires the prior addition of redundancy to the data. Polar codes are the practical codes suitable for channel coding and optimal performance achievement under lossy compression and complexity-based communication environment. This paper focuses on the novel architecture of successive cancellation (SC)-based polar decoding for an effective communication. The coefficient weight computation during the register update consumes a number of components in traditional SC decoding architectures. This paper proposes the semi-folded parallel successive cancellation (SFPSC) algorithm that modifies the coefficient weight computation process for register update resulting in a 4-folded polar decoding architecture to retrieve the information from the transmitted symbols with reduced resource utilization. The performance characteristics of SFPSC algorithm based on FPGA implementation are presented. The decoder architecture based on SFPSC algorithm achieves an efficient resource utilization. The reduction in a number of components efficiently reduces the time consumption. The comparative analysis between the SFPSC-based decoder with the existing SC schemes regarding the number of look up tables, FFs and memory assures the effectiveness of SFPSC in resource utilization.


Successive cancellation Semi-folded Polar coder Resource utilization Very large-scale integration 


  1. 1.
    Bonik G, Goreinov S, Zamarashkin N (2012) Construction and analysis of polar and concatenated polar codes: practical approach. arXiv preprint arXiv:1207.4343
  2. 2.
    Lin J, Yan Z (2015) A efficient list decoder architecture for polar codes. IEEE Trans VLSI 23:2508–2518CrossRefGoogle Scholar
  3. 3.
    Ganesan I, Balasubramanian AAA, Muthusamy R (2018) An efficient implementation of novel paillier encryption with polar encoder for 5G systems in VLSI. Comput Electr Eng 65:153–164CrossRefGoogle Scholar
  4. 4.
    Fan Y, Xia C, Chen J, Tsui C-Y, Jin J, Shen H, Li B (2016) A low-latency list successive-cancellation decoding implementation for polar codes. IEEE J Sel Areas Commun 34:303–317CrossRefGoogle Scholar
  5. 5.
    Yuan B, Parhi K (2014) Low latency successive cancellation list decoders for polar codes architecture with 2 bit decoding. IEEE Trans Circuits Syst 23:1241–1254CrossRefGoogle Scholar
  6. 6.
    Yun H, Lee H (2016) Simplified merged processing element for successive cancellation polar decoder. IET Commun 52:270–272Google Scholar
  7. 7.
    Sarkis G, Giard P, Vardy A, Thibeault C, Gross WJ (2014) Fast polar decoders: algorithm and implementation. IEEE J Sel Areas Commun 32:946–957CrossRefGoogle Scholar
  8. 8.
    Zhang Z, Zhang L, Wang X, Zhong C, Poor HV (2016) A split-reduced successive cancellation list decoder for polar codes. IEEE J Sel Areas Commun 34:292–302CrossRefGoogle Scholar
  9. 9.
    Hassani SH, Mori R, Tanaka T, Urbanke RL (2013) Rate-dependent analysis of the asymptotic behavior of channel polarization. IEEE Trans Inf Theory 59:2267–2276MathSciNetCrossRefGoogle Scholar
  10. 10.
    Eslami A, Pishro-Nik H (2013) On finite-length performance of polar codes: stopping sets, error floor, and concatenated design. IEEE Trans Commun 61:919–929CrossRefGoogle Scholar
  11. 11.
    Seidl M, Schenk A, Stierstorfer C, Huber JB (2013) Polar-coded modulation. IEEE Trans Commun 61:4108–4119CrossRefGoogle Scholar
  12. 12.
    Hassani SH, Alishahi K, Urbanke R (2014) Finite length scaling of polar codes. IEEE Trans Inf Theory 60:5875–5898MathSciNetCrossRefGoogle Scholar
  13. 13.
    Mondelli M, Hassani SH, Urbanke RL (2014) From polar to Reed–Muller codes: a technique to improve the finite-length performance. IEEE Trans Commun 62:3084–3091CrossRefGoogle Scholar
  14. 14.
    Zhang C, Yuan B, Parhi KK (2012) Reduced-latency SC polar decoder architectures. In: IEEE International Conference on Communications (ICC), pp 3471–3475Google Scholar
  15. 15.
    Sarkis G, Gross WJ (2013) Increasing the throughput of polar decoders. IEEE Commun Lett 17:725–728CrossRefGoogle Scholar
  16. 16.
    Leroux C, Raymond AJ, Sarkis G, Gross WJ (2013) A semi-parallel successive-cancellation decoder for polar codes. IEEE Trans Signal Proces 61:289–299MathSciNetCrossRefGoogle Scholar
  17. 17.
    Raymond A, Gross W (2014) A scalable successive cancellation decoder for polar codes. IEEE Trans Signal Proces 62:5339–5347MathSciNetCrossRefGoogle Scholar
  18. 18.
    Fayyaz UU, Barry JR (2014) Low-complexity soft-output decoding of polar codes. IEEE J Sel Areas Commun 32:958–966CrossRefGoogle Scholar
  19. 19.
    Niu K, Chen K, Lin J (2014) Low-complexity sphere decoding of polar codes based on optimum path metric. IEEE Commun Lett 18:332–335CrossRefGoogle Scholar
  20. 20.
    Balatsoukas-Stimming A, Raymond AJ, Gross WJ, Burg A (2013) Hard- ware architecture for list SC decoding of polar codes. arXiv preprint arXiv:1303.7127
  21. 21.
    Xiong C, Lin J, Yan Z (2014) Symbol-based successive cancellation list decoder for polar codes. IEEE Workshop. In: Signal Processing Systems (SiPS), pp 1–6 (2014)Google Scholar
  22. 22.
    Yuan B, Parhi KK (2015) Low-latency successive-cancellation list decoders for polar codes with multibit decision. IEEE Tran Very Large Scale Integr (VLSI) Syst 23:2268–2280CrossRefGoogle Scholar
  23. 23.
    Zhang C, Parhi K (2014) Latency analysis and architecture design of simplified SC polar decoders. IEEE Trans Circuits Syst II Express Briefs 61:115–119CrossRefGoogle Scholar
  24. 24.
    Tian K, Liu R, Wang R (2013) Joint successive cancellation decoding for bit-interleaved polar coded modulation. IEEE Commun Lett 20:224CrossRefGoogle Scholar
  25. 25.
    Zhong C, Ping L, Zhang Z, Wang X, Zhang L (2015) Simplified successive-cancellation decoding using information set reselection for polar codes with arbitrary block length. IET Commun 9:1380–1387CrossRefGoogle Scholar
  26. 26.
    Xiong C, Lin J, Yan Z (2016) Symbol-decision successive cancellation list decoder for polar codes. IEEE Trans Signal Proces 64:675–687MathSciNetCrossRefGoogle Scholar
  27. 27.
    Dizdar O, Arikan E (2016) A high-throughput energy-efficient implementation of successive cancellation decoder for polar codes using combinational logic. IEEE Trans Circuits Syst I Regul Pap 63:436–447MathSciNetCrossRefGoogle Scholar
  28. 28.
    Yuan B (2015) Algorithm and VLSI Architecture for Polar Codes Decoder, Ph.D. thesis, University of MinnesotaGoogle Scholar
  29. 29.
    Arikan E (2009) Channel polarization: a method for constructing capacity- achieving codes for symmetric binary-input memoryless channels. IEEE Trans Inf Theory 55:3051–3073MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2018

Authors and Affiliations

  • G. Indumathi
    • 1
  • V. P. M. B. Aarthi
    • 1
    Email author
  • M. Ramesh
    • 2
  1. 1.Department of Electronics and Communication EngineeringMepco Schlenk Engineering CollegeSivakasiIndia
  2. 2.Department of Electronics and Communication EngineeringKamaraj College of Engineering and TechnologyVirudhunagarIndia

Personalised recommendations