Increasing Minimum Distance of Polar Codes with Outer Parity-Check Codes

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 24
  • Download : 0
This work proposes a concatenated coding scheme which consists of inner polar codes and outer parity-check nodes aiming at increasing minimum distance. There have been a few studies on the concatenation of polar and parity-check codes, which are however heuristic approaches. This work instead proposes a systematic and deterministic algorithm based on a necessary condition to achieve an increased minimum distance. We demonstrate that the proposed coding scheme has a better error-rate performance as compared to those of competing codes such as polar-CRC codes, turbo codes and low-density parity-check (LDPC) codes at short lengths. In addition, it will be shown that codes with the proposed scheme can be efficiently decoded with a list successive cancellation (SC) decoder. The performance superiority of the proposed coding scheme will be confirmed via Monte-Carlo simulations.
Publisher
Institute of Electrical and Electronics Engineers Inc.
Issue Date
2018-10-17
Language
English
Citation

9th International Conference on Information and Communication Technology Convergence, ICTC 2018, pp.219 - 221

DOI
10.1109/ICTC.2018.8539599
URI
http://hdl.handle.net/10203/273332
Appears in Collection
EE-Conference Papers(학술회의논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0