Efficient Decoder for Turbo Product Codes Based on Quadratic Residue Codes

Jie Dong; Yong Li; Rui Liu; Taolin Guo; Francis C.M. Lau

doi:10.3390/electronics11213598

Efficient Decoder for Turbo Product Codes Based on Quadratic Residue Codes

Jie Dong, Yong Li, Rui Liu, Taolin Guo, Francis C.M. Lau

Research output: Journal article publication › Journal article › Academic research › peer-review

Abstract

In this letter, we study turbo product codes with quadratic residue codes (called QR-TPCs) as the component codes. We propose an efficient decoder based on Chase-II algorithm with two convergence conditions for the iterative decoding of QR-TPCs. For each row and column, the Chase-II decoder will stop immediately when one of the conditions is met. The simulation results show that the proposed algorithm has a lower computational complexity compared with existing decoding methods. Moreover, a comparison with 5G low-density parity-check codes shows that the proposed turbo product codes have better performance for short code lengths.

Original language	English
Article number	3598
Pages (from-to)	1-13
Journal	Electronics (Switzerland)
Volume	11
Issue number	21
DOIs	https://doi.org/10.3390/electronics11213598
Publication status	Published - Nov 2022

Keywords

Chase algorithm
efficient decoding
quadratic residue codes
turbo product codes

ASJC Scopus subject areas

Control and Systems Engineering
Signal Processing
Hardware and Architecture
Computer Networks and Communications
Electrical and Electronic Engineering

More information

10.3390/electronics11213598

Cite this

@article{9de9ec82512c4b5ba810a08e08861b50,

title = "Efficient Decoder for Turbo Product Codes Based on Quadratic Residue Codes",

abstract = "In this letter, we study turbo product codes with quadratic residue codes (called QR-TPCs) as the component codes. We propose an efficient decoder based on Chase-II algorithm with two convergence conditions for the iterative decoding of QR-TPCs. For each row and column, the Chase-II decoder will stop immediately when one of the conditions is met. The simulation results show that the proposed algorithm has a lower computational complexity compared with existing decoding methods. Moreover, a comparison with 5G low-density parity-check codes shows that the proposed turbo product codes have better performance for short code lengths.",

keywords = "Chase algorithm, efficient decoding, quadratic residue codes, turbo product codes",

author = "Jie Dong and Yong Li and Rui Liu and Taolin Guo and Lau, {Francis C.M.}",

note = "Funding Information: This work was supported by China Natural Science Foundation (NSF) under Grant 61771081, the Fundamental Research Funds for the Central Universities (China) under Grant cstc2019jcyjmsxmX0110. Publisher Copyright: {\textcopyright} 2022 by the authors.",

year = "2022",

month = nov,

doi = "10.3390/electronics11213598",

language = "English",

volume = "11",

pages = "1--13",

journal = "Electronics (Switzerland)",

issn = "2079-9292",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "21",

}

TY - JOUR

T1 - Efficient Decoder for Turbo Product Codes Based on Quadratic Residue Codes

AU - Dong, Jie

AU - Li, Yong

AU - Liu, Rui

AU - Guo, Taolin

AU - Lau, Francis C.M.

N1 - Funding Information: This work was supported by China Natural Science Foundation (NSF) under Grant 61771081, the Fundamental Research Funds for the Central Universities (China) under Grant cstc2019jcyjmsxmX0110. Publisher Copyright: © 2022 by the authors.

PY - 2022/11

Y1 - 2022/11

N2 - In this letter, we study turbo product codes with quadratic residue codes (called QR-TPCs) as the component codes. We propose an efficient decoder based on Chase-II algorithm with two convergence conditions for the iterative decoding of QR-TPCs. For each row and column, the Chase-II decoder will stop immediately when one of the conditions is met. The simulation results show that the proposed algorithm has a lower computational complexity compared with existing decoding methods. Moreover, a comparison with 5G low-density parity-check codes shows that the proposed turbo product codes have better performance for short code lengths.

AB - In this letter, we study turbo product codes with quadratic residue codes (called QR-TPCs) as the component codes. We propose an efficient decoder based on Chase-II algorithm with two convergence conditions for the iterative decoding of QR-TPCs. For each row and column, the Chase-II decoder will stop immediately when one of the conditions is met. The simulation results show that the proposed algorithm has a lower computational complexity compared with existing decoding methods. Moreover, a comparison with 5G low-density parity-check codes shows that the proposed turbo product codes have better performance for short code lengths.

KW - Chase algorithm

KW - efficient decoding

KW - quadratic residue codes

KW - turbo product codes

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

U2 - 10.3390/electronics11213598

DO - 10.3390/electronics11213598

M3 - Journal article

AN - SCOPUS:85141862351

SN - 2079-9292

VL - 11

SP - 1

EP - 13

JO - Electronics (Switzerland)

JF - Electronics (Switzerland)

IS - 21

M1 - 3598

ER -

Efficient Decoder for Turbo Product Codes Based on Quadratic Residue Codes

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this