跳到主要导航 跳到搜索 跳到主要内容

Set min-sum decoding algorithm for non-binary LDPC codes

  • Beihang University
  • Wuhan University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

This paper reduces the complexity of decoding non-binary low-density parity-check (LDPC) codes by set partition. In the check node update, the input vectors are partitioned into several sets such that different elements in the virtual matrix enjoy various computational strategies. As a result, the proposed algorithm achieves high computational efficiency by setting strategies according to the correct probability of these elements. Simulation results indicate that it significantly decreases the complexity of check node update with negligible performance loss.

源语言英语
主期刊名Proceedings - ISIT 2016; 2016 IEEE International Symposium on Information Theory
出版商Institute of Electrical and Electronics Engineers Inc.
3008-3012
页数5
ISBN(电子版)9781509018062
DOI
出版状态已出版 - 10 8月 2016
活动2016 IEEE International Symposium on Information Theory, ISIT 2016 - Barcelona, 西班牙
期限: 10 7月 201615 7月 2016

出版系列

姓名IEEE International Symposium on Information Theory - Proceedings
2016-August
ISSN(印刷版)2157-8095

会议

会议2016 IEEE International Symposium on Information Theory, ISIT 2016
国家/地区西班牙
Barcelona
时期10/07/1615/07/16

指纹

探究 'Set min-sum decoding algorithm for non-binary LDPC codes' 的科研主题。它们共同构成独一无二的指纹。

引用此