Recursive descriptions of polar codes

DOI10.3934/AMC.2017001MaRDI QIDQ514520zbMATH OpenOpenAlexFDO

Authors Noam Presman, Simon Litsyn

Publication date 9 March 2017

Published in Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1209.4818

zbMATH Keywords

decodingencodingerror correction codingpolar coding

Mathematics Subject Classification ID

Linear codes (general theory) (94B05) Decoding (94B35)

Abstract: Polar codes are recursive general concatenated codes. This property motivates a recursive formalization of the known decoding algorithms: Successive Cancellation, Successive Cancellation with Lists and Belief Propagation. Using such description allows an easy development of these algorithms for arbitrary polarizing kernels. Hardware architectures for these decoding algorithms are also described in a recursive way, both for Arikan's standard polar codes and for arbitrary polarizing kernels.

Recommendations

• Polar codes
• Simplified polar codes decoding algorithm based on pruning
• Polarization and polar codes
• Polar codes with higher-order memory
• Mixed polarized constructions

Cites work

• scientific article; zbMATH DE number 3485627 (Why is no real title available?)
• scientific article; zbMATH DE number 1284436 (Why is no real title available?)
• A Scalable Successive-Cancellation Decoder for Polar Codes
• A Semi-Parallel Successive-Cancellation Decoder for Polar Codes
• An Efficient Partial-Sum Network Architecture for Semi-Parallel Polar Codes Decoder Implementation
• Binary Polarization Kernels From Code Decompositions
• Binary perfect codes of length 15 by the generalized concatenated construction
• Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
• Codes on graphs: normal realizations
• Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders
• Efficient Serial Message-Passing Schedules for LDPC Decoding
• Introduction to algorithms
• LLR-Based Successive Cancellation List Decoding of Polar Codes
• List Decoding of Polar Codes
• Polar Codes: Characterization of Exponent, Bounds, and Constructions
• Soft-decision decoding of Reed-Muller codes: a simplified algorithm
• Soft-decision decoding of Reed-Muller codes: recursive lists

Cited in

(6)

• Investigation of coding and decoding algorithms of polar code subsequence
• The polarization of hybrid multi-kernel polar codes
• Exponents of polar codes using algebraic geometric code kernels
• Series of formulas for Bhattacharyya parameters in the theory of polar codes
• Design and decoding of polar codes with large kernels: a survey
• Simplified polar codes decoding algorithm based on pruning

This page was built for publication: Recursive descriptions of polar codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q514520)