article · 2018

Early termination belief propagation decoder with parity check matrix for polar codes

Hsin−Fu Yu, Huang–Chang Lee, Shih-Kai Lee

Cited by 5Abstract and details only

Abstract

In this paper, a belief propagation (BP) decoding algorithm with early termination is proposed for polar code. The early termination is accomplished using the syndrome generated by the parity-check matrix, which can be transferred from the generator matrix. With the assistance of the early termination, the BP decoder can provide not only a better bit error rate performance but also significantly reduce the decoding complexity. For (1024, 512) polar codes, the average numbers of iterations can be reduced from 80 to 23 when Eb/N0=3 dB. The reduction in the computation complexity is about 70%.

Cite this paper

APA 7

Yu, H., Lee, H., & Lee, S.-K. (2018). Early termination belief propagation decoder with parity check matrix for polar codes. https://doi.org/10.1109/wocc.2018.8372719

MLA 9

Yu, Hsin−Fu, et al. “Early termination belief propagation decoder with parity check matrix for polar codes.” 2018, pp. 1–4, https://doi.org/10.1109/wocc.2018.8372719.

Chicago

Yu, Hsin−Fu, Huang–Chang Lee, and Shih-Kai Lee. 2018. “Early termination belief propagation decoder with parity check matrix for polar codes.” https://doi.org/10.1109/wocc.2018.8372719.

Harvard

Yu, H., Lee, H. and Lee, S.-K. (2018) ‘Early termination belief propagation decoder with parity check matrix for polar codes’. Available at: https://doi.org/10.1109/wocc.2018.8372719.

BibTeX

@article{yu2018early,
  title = {{Early termination belief propagation decoder with parity check matrix for polar codes}},
  author = {Yu, Hsin−Fu and Lee, Huang–Chang and Lee, Shih-Kai},
  pages = {1--4},
  year = {2018},
  doi = {10.1109/wocc.2018.8372719}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.