Recursive descriptions of polar codes
From MaRDI portal
Publication:514520
DOI10.3934/AMC.2017001zbMATH Open1357.94084arXiv1209.4818OpenAlexW2963648916MaRDI QIDQ514520FDOQ514520
Authors: Noam Presman, Simon Litsyn 
Publication date: 9 March 2017
Published in: Advances in Mathematics of Communications (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1209.4818
Recommendations
Cites Work
- Introduction to algorithms
- Title not available (Why is that?)
- Codes on graphs: normal realizations
- Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels
- Title not available (Why is that?)
- Polar Codes: Characterization of Exponent, Bounds, and Constructions
- Binary perfect codes of length 15 by the generalized concatenated construction
- List Decoding of Polar Codes
- Binary Polarization Kernels From Code Decompositions
- Soft-decision decoding of Reed-Muller codes: a simplified algorithm
- Soft-decision decoding of Reed-Muller codes: recursive lists
- Efficient Serial Message-Passing Schedules for LDPC Decoding
- A Semi-Parallel Successive-Cancellation Decoder for Polar Codes
- An Efficient Partial-Sum Network Architecture for Semi-Parallel Polar Codes Decoder Implementation
- A Scalable Successive-Cancellation Decoder for Polar Codes
- Early Stopping Criteria for Energy-Efficient Low-Latency Belief-Propagation Polar Code Decoders
- LLR-Based Successive Cancellation List Decoding of Polar Codes
Cited In (6)
- 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
- The polarization of hybrid multi-kernel polar codes
- Investigation of coding and decoding algorithms of polar code subsequence
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)
