SC of polar codes based normalized MS algorithm

In this paper, the principle of normalized minimum-sum (NMS) polar decoding process is explored. It is demonstrated that with one properly chosen parameters for NMS algorithm, performances approach to that of the sum-product (SP) algorithm can be achieved. As well, the complexity reduction is realiz...

Full description

Saved in:
Bibliographic Details
Published in2017 8th IEEE Annual Information Technology, Electronics and Mobile Communication Conference (IEMCON) pp. 111 - 116
Main Authors Hasan, Alaa A., Marsland, Ian D.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.10.2017
Subjects
Approximation algorithms
Complexity theory
correction factor
Decoding
Encoding
Hardware
normalized minimum-sum
Polar codes
Probability density function
Simulation
Online AccessGet full text
DOI10.1109/IEMCON.2017.8117164

Cover

More Information
Summary:In this paper, the principle of normalized minimum-sum (NMS) polar decoding process is explored. It is demonstrated that with one properly chosen parameters for NMS algorithm, performances approach to that of the sum-product (SP) algorithm can be achieved. As well, the complexity reduction is realized by calculating a linear function instead of nonlinear function. Simulation results for successive cancellation (SC) polar codes with code length moderately long validate the proposed approximation.
DOI:10.1109/IEMCON.2017.8117164