Low Complexity Polar Code Decoder for HARQ Application

Huang Chang Lee; Guan Chun Liao

doi:10.1109/ICUFN.2018.8436599

Low Complexity Polar Code Decoder for HARQ Application

Huang Chang Lee, Guan Chun Liao

Department of Electrical Engineering

Chang Gung University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

In this work, an incremental decoding algorithm is proposed for the punctured polar codes. The incremental decoding is based on the successive cancellation (SC) decoding algorithm. This paper shows that when the punctured polar code is adopted in the HARQ (Hybrid Automatic Repeat Request) protocol, the incremental decoding algorithm can significantly reduce the complexity of the additional decoding attempt for the re-transmission. In addition, the reduction of complexity is not effected by the punctured patterns, and the proposed incremental decoding is suitable for all punctured polar codes.

Original language	English
Title of host publication	ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks
Publisher	IEEE Computer Society
Pages	512-514
Number of pages	3
ISBN (Print)	9781538646465
DOIs	https://doi.org/10.1109/ICUFN.2018.8436599
State	Published - 14 08 2018
Event	10th International Conference on Ubiquitous and Future Networks, ICUFN 2018 - Prague, Czech Republic Duration: 03 07 2018 → 06 07 2018

Publication series

Name	International Conference on Ubiquitous and Future Networks, ICUFN
Volume	2018-July
ISSN (Print)	2165-8528
ISSN (Electronic)	2165-8536

Conference

Conference	10th International Conference on Ubiquitous and Future Networks, ICUFN 2018
Country/Territory	Czech Republic
City	Prague
Period	03/07/18 → 06/07/18

Bibliographical note

Publisher Copyright:
© 2018 IEEE.

Access to Document

10.1109/ICUFN.2018.8436599

Cite this

@inproceedings{0761b308762d4265aa98112178b4f351,

title = "Low Complexity Polar Code Decoder for HARQ Application",

abstract = "In this work, an incremental decoding algorithm is proposed for the punctured polar codes. The incremental decoding is based on the successive cancellation (SC) decoding algorithm. This paper shows that when the punctured polar code is adopted in the HARQ (Hybrid Automatic Repeat Request) protocol, the incremental decoding algorithm can significantly reduce the complexity of the additional decoding attempt for the re-transmission. In addition, the reduction of complexity is not effected by the punctured patterns, and the proposed incremental decoding is suitable for all punctured polar codes.",

author = "Lee, {Huang Chang} and Liao, {Guan Chun}",

note = "Publisher Copyright: {\textcopyright} 2018 IEEE.; 10th International Conference on Ubiquitous and Future Networks, ICUFN 2018 ; Conference date: 03-07-2018 Through 06-07-2018",

year = "2018",

month = aug,

day = "14",

doi = "10.1109/ICUFN.2018.8436599",

language = "英语",

isbn = "9781538646465",

series = "International Conference on Ubiquitous and Future Networks, ICUFN",

publisher = "IEEE Computer Society",

pages = "512--514",

booktitle = "ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks",

address = "美国",

}

Lee, HC & Liao, GC 2018, Low Complexity Polar Code Decoder for HARQ Application. in ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks., 8436599, International Conference on Ubiquitous and Future Networks, ICUFN, vol. 2018-July, IEEE Computer Society, pp. 512-514, 10th International Conference on Ubiquitous and Future Networks, ICUFN 2018, Prague, Czech Republic, 03/07/18. https://doi.org/10.1109/ICUFN.2018.8436599

Low Complexity Polar Code Decoder for HARQ Application. / Lee, Huang Chang; Liao, Guan Chun.
ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks. IEEE Computer Society, 2018. p. 512-514 8436599 (International Conference on Ubiquitous and Future Networks, ICUFN; Vol. 2018-July).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Low Complexity Polar Code Decoder for HARQ Application

AU - Lee, Huang Chang

AU - Liao, Guan Chun

PY - 2018/8/14

Y1 - 2018/8/14

N2 - In this work, an incremental decoding algorithm is proposed for the punctured polar codes. The incremental decoding is based on the successive cancellation (SC) decoding algorithm. This paper shows that when the punctured polar code is adopted in the HARQ (Hybrid Automatic Repeat Request) protocol, the incremental decoding algorithm can significantly reduce the complexity of the additional decoding attempt for the re-transmission. In addition, the reduction of complexity is not effected by the punctured patterns, and the proposed incremental decoding is suitable for all punctured polar codes.

AB - In this work, an incremental decoding algorithm is proposed for the punctured polar codes. The incremental decoding is based on the successive cancellation (SC) decoding algorithm. This paper shows that when the punctured polar code is adopted in the HARQ (Hybrid Automatic Repeat Request) protocol, the incremental decoding algorithm can significantly reduce the complexity of the additional decoding attempt for the re-transmission. In addition, the reduction of complexity is not effected by the punctured patterns, and the proposed incremental decoding is suitable for all punctured polar codes.

UR - http://www.scopus.com/inward/record.url?scp=85052534689&partnerID=8YFLogxK

U2 - 10.1109/ICUFN.2018.8436599

DO - 10.1109/ICUFN.2018.8436599

M3 - 会议稿件

AN - SCOPUS:85052534689

SN - 9781538646465

T3 - International Conference on Ubiquitous and Future Networks, ICUFN

SP - 512

EP - 514

BT - ICUFN 2018 - 10th International Conference on Ubiquitous and Future Networks

PB - IEEE Computer Society

T2 - 10th International Conference on Ubiquitous and Future Networks, ICUFN 2018

Y2 - 3 July 2018 through 6 July 2018

ER -

Low Complexity Polar Code Decoder for HARQ Application

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this