Finite-Level Quantization Procedures for Construction and Decoding of Polar Codes

We consider finite-level, symmetric quantization procedures for construction and decoding of polar codes. Whether polarization occurs in the presence of quantization is not known in general. Hassani and Urbanke have shown that a simple three-level quantization procedure polarizes and they have proposed a calculation method to obtain a lower bound for achievable rates. We find an improved calculation method for achievable rates and also the exact asymptotic behavior of the block error probability under the aforementioned simple case. We then prove that certain D-level quantization schemes polarize and give a lower bound on achievable rates. Furthermore, we show that a broad class of quantization procedures result in a weaker form of the polarization phenomenon.

Jan 12 2020
Submitted to ISIT 2020

 Record created 2020-01-12, last modified 2020-01-15

FiniteQuantization_corrected - Download fulltextPDF
FiniteQuantization_new - Download fulltextPDF
Rate this document:

Rate this document:
(Not yet reviewed)