Open AccessPerformance Analysis of Belief Propagation Polar Code Decoder
Author(s) -
C. Karthick,
T. Vino,
T. Babji,
P. Naveen
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/590/1/012053
Subject(s) - decoding methods , computer science , polar , encoding (memory) , algorithm , code (set theory) , class (philosophy) , parallel computing , arithmetic , programming language , mathematics , set (abstract data type) , artificial intelligence , physics , astronomy
Attributable to their ability accomplishing execution and low encoding and interpreting intricacy, polar codes have gotten noteworthy consideration as of late. Successive cancellation decoding (SCD) and belief propagation decoding (BPD) are two mainstream approaches for disentangling polar codes. SCD, in spite of having less computational intricacy when contrasted and BPD, experiences long inertness because of the serial idea of the SC calculation. BPD, then again, is parallel in nature and is more alluring for low-dormancy applications. Nonetheless, because of the iterative idea of BPD, the required inertness and vitality dispersal increment straightly with the quantity of emphasis. In this paper, we propose a novel plan in light of sub-factor diagram solidifying to lessen the normal number addition the normal number of cycles required by BPD, which specifically converts into bring down inactivity and vitality dissemination. Besides, the equipment design for the proposed plot is created and contrasted and the best in class BPD executions for (1024,512) polar codes.