Loading [MathJax]/extensions/MathMenu.js
Performance of Polar Codes under Successive Cancellation Decoding Employing Approximation Algorithm | IEEE Conference Publication | IEEE Xplore

Performance of Polar Codes under Successive Cancellation Decoding Employing Approximation Algorithm


Abstract:

This paper evaluates the performance degradation incurred by an approximation algorithm (min-sum algorithm) when polar codes under successive cancellation decoding (SCD) ...Show More

Abstract:

This paper evaluates the performance degradation incurred by an approximation algorithm (min-sum algorithm) when polar codes under successive cancellation decoding (SCD) are employed. To understand the behavior of the algorithm under the SCD, the error performances of the synthetic channels were evaluated, since different synthetic channels show different levels of degradation, because the numbers of the approximation algorithm applied to the channels and the operating signal-to-noise power ratios (SNRs) of the channels, which also affect the levels of degradation, are different. After evaluation of the synthetic channels, the block error rate performances under the SCD for different coding rates were obtained. The results show that the performance degradation was not significant, even when a coded bit length of 214=16384 was used.
Date of Conference: 16-18 December 2019
Date Added to IEEE Xplore: 27 February 2020
ISBN Information:
Conference Location: Gold Coast, QLD, Australia

Contact IEEE to Subscribe

References

References is not available for this document.