Abstract
A successive cancellation multi-stack (SCMS) decoding is proposed to improve the performance of polar codes. Unlike the successive cancellation stack (SCS) decoding algorithm which just uses one ordered stack to store the candidate partial paths and attempts to find out the optimal estimation in the stack, the SCMS algorithm uses several stacks to obtain better performance at the same space complexity. Simulation results in binary-input additive white Gaussian noise channel (BI-AWGN) show that the SCMS algorithm can achieve an improvement of about 0.2 dB.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Arikan E (2009) Channel polarization: a method for constructing capacity achieving codes for symmetric binary-input memoryless channels. IEEE Trans Inf Theory 55(7):3051–3057
Arikan E, Telatar E (2009) On the rate of channel polarization. In: Proceeding of 2009 IEEE International Symposiumon Information Theory, pp 1493–1495
Chen K, Niu K, Lin JR (2012) List successive cancellation decoding of polar codes. Electron Lett 48(9):500–501
Niu K, Chen K (2012) Stack decoding of polar codes. Electron Lett 48(12):695–696
Huang J, Li W, Zhang T, Jiang H (2013) An improved stack decoding algorithm. Wirel Commun Technol 4:7–10
Arikan E (2006) Channel combing and splitting for cutoff rate improvement. IEEE Trans Inf Theory 52(2):628–639
Chen K, Niu K, Lin JR (2013) Improved successive cancellation decoding of polar codes. IEEE Trans Commun 61(8):3100–3107
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wu, D., Zhang, Q., Zhang, Y. (2016). Multi-stack Decoding of Polar Codes. In: Liang, Q., Mu, J., Wang, W., Zhang, B. (eds) Proceedings of the 2015 International Conference on Communications, Signal Processing, and Systems. Lecture Notes in Electrical Engineering, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49831-6_38
Download citation
DOI: https://doi.org/10.1007/978-3-662-49831-6_38
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-49829-3
Online ISBN: 978-3-662-49831-6
eBook Packages: EngineeringEngineering (R0)