Incremental decoding schedules for puncture-based rate-compatible LDPC codes

Huang Chang Lee; Yeong Luh Ueng

doi:10.1109/VTCSpring.2016.7504285

Incremental decoding schedules for puncture-based rate-compatible LDPC codes

Huang Chang Lee
, Yeong Luh Ueng

National Tsing Hua University

研究成果: 圖書/報告稿件的類型 › 會議稿件 › 同行評審

1 引文斯高帕斯（Scopus）

摘要

This paper shows that the decoding convergence of the punctured low-density parity-check (LDPC) codes can be significantly increased using edge wise scheduling belief-propagation. If rate- compatible (RC)-LDPC codes constructed based on puncturing are considered, the maximum mutual information increase (M^2I^2)-based algorithm can be used to arrange fixed schedules for incremental decoding, and further reduce the required number of iterations. With the assistance of the proposed decoding schedules, the puncture-based RC-LDPC codes can be a potential solution for delay- sensitive HARQ (Hybrid-Automatic Repeat reQuest) applications.

原文	英語
主出版物標題	2016 IEEE 83rd Vehicular Technology Conference, VTC Spring 2016 - Proceedings
發行者	Institute of Electrical and Electronics Engineers Inc.
ISBN（電子）	9781509016983
DOIs	https://doi.org/10.1109/VTCSpring.2016.7504285
出版狀態	已出版 - 05 07 2016
對外發佈	是
事件	83rd IEEE Vehicular Technology Conference, VTC Spring 2016 - Nanjing, 中國持續時間: 15 05 2016 → 18 05 2016

出版系列

名字	IEEE Vehicular Technology Conference
卷	2016-July
ISSN（列印）	1550-2252

Conference

Conference	83rd IEEE Vehicular Technology Conference, VTC Spring 2016
國家/地區	中國
城市	Nanjing
期間	15/05/16 → 18/05/16

文獻附註

Publisher Copyright:
© 2016 IEEE.

存取文件

10.1109/VTCSpring.2016.7504285

其它文件與鏈接

Link to publication in Scopus

引用此

@inproceedings{224db1ee6e8845768daf1702ed174a52,

title = "Incremental decoding schedules for puncture-based rate-compatible LDPC codes",

abstract = "This paper shows that the decoding convergence of the punctured low-density parity-check (LDPC) codes can be significantly increased using edge wise scheduling belief-propagation. If rate- compatible (RC)-LDPC codes constructed based on puncturing are considered, the maximum mutual information increase (M\textasciicircum{}2I\textasciicircum{}2)-based algorithm can be used to arrange fixed schedules for incremental decoding, and further reduce the required number of iterations. With the assistance of the proposed decoding schedules, the puncture-based RC-LDPC codes can be a potential solution for delay- sensitive HARQ (Hybrid-Automatic Repeat reQuest) applications.",

keywords = "Belief propagation, Error-control codes, Low-density parity-check (LDPC) codes, Messages-passing schedule",

author = "Lee, \{Huang Chang\} and Ueng, \{Yeong Luh\}",

note = "Publisher Copyright: {\textcopyright} 2016 IEEE.; 83rd IEEE Vehicular Technology Conference, VTC Spring 2016 ; Conference date: 15-05-2016 Through 18-05-2016",

year = "2016",

month = jul,

day = "5",

doi = "10.1109/VTCSpring.2016.7504285",

language = "英语",

series = "IEEE Vehicular Technology Conference",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

booktitle = "2016 IEEE 83rd Vehicular Technology Conference, VTC Spring 2016 - Proceedings",

address = "美国",

}

Lee, HC & Ueng, YL 2016, Incremental decoding schedules for puncture-based rate-compatible LDPC codes. 於 2016 IEEE 83rd Vehicular Technology Conference, VTC Spring 2016 - Proceedings., 7504285, IEEE Vehicular Technology Conference, 卷 2016-July, Institute of Electrical and Electronics Engineers Inc., 83rd IEEE Vehicular Technology Conference, VTC Spring 2016, Nanjing, 中國, 15/05/16. https://doi.org/10.1109/VTCSpring.2016.7504285

Incremental decoding schedules for puncture-based rate-compatible LDPC codes. / Lee, Huang Chang; Ueng, Yeong Luh.
2016 IEEE 83rd Vehicular Technology Conference, VTC Spring 2016 - Proceedings. Institute of Electrical and Electronics Engineers Inc., 2016. 7504285 (IEEE Vehicular Technology Conference; 卷 2016-July).

研究成果: 圖書/報告稿件的類型 › 會議稿件 › 同行評審

TY - GEN

T1 - Incremental decoding schedules for puncture-based rate-compatible LDPC codes

AU - Lee, Huang Chang

AU - Ueng, Yeong Luh

PY - 2016/7/5

Y1 - 2016/7/5

N2 - This paper shows that the decoding convergence of the punctured low-density parity-check (LDPC) codes can be significantly increased using edge wise scheduling belief-propagation. If rate- compatible (RC)-LDPC codes constructed based on puncturing are considered, the maximum mutual information increase (M^2I^2)-based algorithm can be used to arrange fixed schedules for incremental decoding, and further reduce the required number of iterations. With the assistance of the proposed decoding schedules, the puncture-based RC-LDPC codes can be a potential solution for delay- sensitive HARQ (Hybrid-Automatic Repeat reQuest) applications.

AB - This paper shows that the decoding convergence of the punctured low-density parity-check (LDPC) codes can be significantly increased using edge wise scheduling belief-propagation. If rate- compatible (RC)-LDPC codes constructed based on puncturing are considered, the maximum mutual information increase (M^2I^2)-based algorithm can be used to arrange fixed schedules for incremental decoding, and further reduce the required number of iterations. With the assistance of the proposed decoding schedules, the puncture-based RC-LDPC codes can be a potential solution for delay- sensitive HARQ (Hybrid-Automatic Repeat reQuest) applications.

KW - Belief propagation

KW - Error-control codes

KW - Low-density parity-check (LDPC) codes

KW - Messages-passing schedule

UR - https://www.scopus.com/pages/publications/84979734829

U2 - 10.1109/VTCSpring.2016.7504285

DO - 10.1109/VTCSpring.2016.7504285

M3 - 会议稿件

AN - SCOPUS:84979734829

T3 - IEEE Vehicular Technology Conference

BT - 2016 IEEE 83rd Vehicular Technology Conference, VTC Spring 2016 - Proceedings

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 83rd IEEE Vehicular Technology Conference, VTC Spring 2016

Y2 - 15 May 2016 through 18 May 2016

ER -

Incremental decoding schedules for puncture-based rate-compatible LDPC codes

摘要

出版系列

Conference

文獻附註

存取文件

其它文件與鏈接

指紋

引用此