Complexity-adjustable SC decoding of polar codes for energy consumption reduction

Haotian Zheng, Bin Chen, Luis F. Abanto-Leon, Zizheng Cao (Corresponding author), Ton Koonen

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

Uittreksel

This study proposes an enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity.Also, a logarithmic likelihood ratio-threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding. Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible trade-off between time complexity and computational complexity, while reducing storage space up to 70%. Based on the fact that most mobile devices operate in environments with stringent energy budget to support diverse applications, the proposed scheme is a promising candidate for meeting requirements of different applications while maintaining a low computational complexity and computing resource utilisation.

TaalEngels
Pagina's2088-2096
Aantal pagina's9
TijdschriftIET Communications
Volume13
Nummer van het tijdschrift14
DOI's
StatusGepubliceerd - 27 aug 2019

Vingerafdruk

Decoding
Energy utilization
Computational complexity
Error correction
Mobile devices
Data storage equipment
Computer simulation

Citeer dit

@article{c0dbb7dc73f043898fa811c3f7e360df,
title = "Complexity-adjustable SC decoding of polar codes for energy consumption reduction",
abstract = "This study proposes an enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity.Also, a logarithmic likelihood ratio-threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding. Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible trade-off between time complexity and computational complexity, while reducing storage space up to 70{\%}. Based on the fact that most mobile devices operate in environments with stringent energy budget to support diverse applications, the proposed scheme is a promising candidate for meeting requirements of different applications while maintaining a low computational complexity and computing resource utilisation.",
author = "Haotian Zheng and Bin Chen and Abanto-Leon, {Luis F.} and Zizheng Cao and Ton Koonen",
year = "2019",
month = "8",
day = "27",
doi = "10.1049/iet-com.2018.5643",
language = "English",
volume = "13",
pages = "2088--2096",
journal = "IET Communications",
issn = "1751-8628",
publisher = "Institution of Engineering and Technology (IET)",
number = "14",

}

Complexity-adjustable SC decoding of polar codes for energy consumption reduction. / Zheng, Haotian; Chen, Bin; Abanto-Leon, Luis F.; Cao, Zizheng (Corresponding author); Koonen, Ton.

In: IET Communications, Vol. 13, Nr. 14, 27.08.2019, blz. 2088-2096.

Onderzoeksoutput: Bijdrage aan tijdschriftTijdschriftartikelAcademicpeer review

TY - JOUR

T1 - Complexity-adjustable SC decoding of polar codes for energy consumption reduction

AU - Zheng,Haotian

AU - Chen,Bin

AU - Abanto-Leon,Luis F.

AU - Cao,Zizheng

AU - Koonen,Ton

PY - 2019/8/27

Y1 - 2019/8/27

N2 - This study proposes an enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity.Also, a logarithmic likelihood ratio-threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding. Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible trade-off between time complexity and computational complexity, while reducing storage space up to 70%. Based on the fact that most mobile devices operate in environments with stringent energy budget to support diverse applications, the proposed scheme is a promising candidate for meeting requirements of different applications while maintaining a low computational complexity and computing resource utilisation.

AB - This study proposes an enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity.Also, a logarithmic likelihood ratio-threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding. Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible trade-off between time complexity and computational complexity, while reducing storage space up to 70%. Based on the fact that most mobile devices operate in environments with stringent energy budget to support diverse applications, the proposed scheme is a promising candidate for meeting requirements of different applications while maintaining a low computational complexity and computing resource utilisation.

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

U2 - 10.1049/iet-com.2018.5643

DO - 10.1049/iet-com.2018.5643

M3 - Article

VL - 13

SP - 2088

EP - 2096

JO - IET Communications

T2 - IET Communications

JF - IET Communications

SN - 1751-8628

IS - 14

ER -