Efficient Design and Decoding of Polar Codes
By Peter Vladimirovich Trifonov. IEEE Transactions on Communications, 2012
645 citations recorded by the source corpus.
Polar codes are shown to be instances of both generalized concatenated codes and multilevel codes. It is shown that the performance of a polar code can be improved by representing it as a multilevel code and applying the multistage decoding algorithm with maximum likelihood decoding of outer codes. Additional performance improvement is obtained by replacing polar outer codes with other ones with better error correction performance. In some cases this also results in complexity reduction. It is shown that Gaussian approximation for density evolution enables one to accurately predict the performance of polar codes and concatenated codes based on them.
Subfields: Computer Networks and Communications, Electrical and Electronic Engineering, Molecular Biology
View Paper: https://www.semanticscholar.org/paper/e965bfd94c472edfb7cc67c2c6c3c68a2b9cdc83
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computer Networks and Communications
In Electrical and Electronic Engineering
In Molecular Biology
Citations in the corpus
- Distortion Agnostic Deep Watermarking (2020, methodology): “In implementation, various classical methods such as the Reed-Solomon (RS) codes [41], low-density parity-check (LDPC) codes [26], turbo codes [32], and polar codes [37], have been widely applied in the field of telecommunication.”