Abstract
In this paper, we implement the Successive Cancellation (SC) decoding algorithm for Polar Codes by using Euclidean distance estimates as the metric of the algorithm. This implies conversion of the classic statistical recursive expressions of the SC decoder into a suitable form, adapting them to the proposed metric, and properly expressing the initialization values for this metric. This leads to a simplified version of the logarithmic SC decoder, which offers the advantage that the algorithm can be directly initialised with the values of the received channel samples. Simulations of the BER performance of the SC decoder, using both the classic statistical metrics, and the proposed Euclidean distance metric, show that there is no significant loss in BER performance for the proposed method in comparison with the classic implementation. Calculations are simplified at the initialization step of the algorithm, since neither is there a need to know the noise power variance of the channel, nor to perform complex and costly mathematical operations like exponentiations, quotients and products at that step. This complexity reduction is especially important for practical implementations of the SC decoding algorithm in programmable logic technology like Field Programmable Gate Arrays (FPGAs).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Shannon, C.E.: A mathematical theory of communication. Bell Syst. Tech. 27, 379–423 (1948)
Arikan, E.: Channel polarization: a method for constructing capacity-achieving codes for symetric binary-input memoryless channels. IEEE Trans. Inf. Theor. 55, 3051–3073 (2009)
Sasoglu, E., Telatar, E., Arikan, E.: Polarization for arbitrary discrete memoryless channels. In: Proceedings of IEEE Information Theory Workshop (ITW), pp. 144–148 (2009)
Arikan, E.: A performance comparison of Polar Codes and Reed-Muller codes. IEEE Commun. Lett. 12(6), 447–449 (2008)
Mori, R., Tanaka, T.: Performance and construction of Polar Codes on symmetric binary-input memoryless channels. In: ISIT (2009)
Mori, R., Tanaka, T.: Performance of Polar Codes with the construction using density evolution. IEEE Commun. Lett. 13(7), 519–521 (2009)
Leroux, C., Raymond, A., Sarkis, G., Gross, W.: A semi-parallel successive-cancellation decoder for polar codes. IEEE Trans. Sign. Process. 61(3), 289–299 (2013)
Li, H., Yuan, J.: A practical construction method for Polar Codes in AWGN channels. In: 2013 TENCON Spring Conference, pp. 17–19. IEEE, Sydney, Australia (2013). ISBN: 978-1-4673-6347-1
Alamdar-Yazdi, A., Kschischang, F.R.: A simplified successive-cancellation decoder for polar codes. IEEE Commun. Lett. 15(12), 1378–1380 (2011)
Farrell, P.G., Arnone, L.J., Castiñeira Moreira, J.: Euclidean distance soft-input soft-output decoding algorithm for low-density parity-check codes. IET Commun. 5(16), 2364–2370 (2011)
Shi, P., Zhao, S., Wang, B., Zhou, L.: Performance of Polar Codes on wireless communications Channels (2012). (Submitted to GlobeCom)
Saeedi, H., Banihashemi, A.H.: Performance of belief propagation for decoding LDPC codes in the presence of channel estimation error. IEEE Trans. Commun. 55(1), 83–89 (2007)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Liberatori, M.C., Arnone, L.J., Castiñeira Moreira, J., Farrell, P.G. (2015). Soft Distance Metric Decoding of Polar Codes. In: Groth, J. (eds) Cryptography and Coding. IMACC 2015. Lecture Notes in Computer Science(), vol 9496. Springer, Cham. https://doi.org/10.1007/978-3-319-27239-9_10
Download citation
DOI: https://doi.org/10.1007/978-3-319-27239-9_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-27238-2
Online ISBN: 978-3-319-27239-9
eBook Packages: Computer ScienceComputer Science (R0)