Optimization of Finite-Length Protograph-Based SC-LDPC Anytime Codes

Xiaoxi Yu; Li Deng; Yong Liang Guan; Zhaojie Yang

doi:10.1109/LCOMM.2023.3333219

Optimization of Finite-Length Protograph-Based SC-LDPC Anytime Codes

Xiaoxi Yu, Li Deng, Yong Liang Guan^*, Zhaojie Yang

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-review

Abstract

In this letter, we present an optimization method for designing Protograph-based spatially coupled low-density parity-check anytime (P-anytime) codes with outstanding finite-length performance. We first introduce two performance metrics, namely the delay-exponent and anytime mean parameters, to effectively capture the finite-length behavior of P-anytime codes. We then propose a multi-objective optimization algorithm to optimize these performance metrics and design novel P-anytime codes. Simulation results demonstrate that our proposed P-anytime codes achieve one to two orders of magnitude improvement in both bit erasure rate and bit error rate compared with prior-art anytime codes.

Original language	English
Pages (from-to)	14-18
Number of pages	5
Journal	IEEE Communications Letters
Volume	28
Issue number	1
DOIs	https://doi.org/10.1109/LCOMM.2023.3333219
Publication status	Published - Jan 1 2024
Externally published	Yes

Bibliographical note

Publisher Copyright:
© 1997-2012 IEEE.

ASJC Scopus Subject Areas

Modelling and Simulation
Computer Science Applications
Electrical and Electronic Engineering

Keywords

Anytime codes
density evolution
finite-length analysis
multi-objective differential evolution (MODE)
spatially coupled LDPC codes

Access to Document

10.1109/LCOMM.2023.3333219

Cite this

@article{810670c20e90471b9a777bc443ced3fc,

title = "Optimization of Finite-Length Protograph-Based SC-LDPC Anytime Codes",

abstract = "In this letter, we present an optimization method for designing Protograph-based spatially coupled low-density parity-check anytime (P-anytime) codes with outstanding finite-length performance. We first introduce two performance metrics, namely the delay-exponent and anytime mean parameters, to effectively capture the finite-length behavior of P-anytime codes. We then propose a multi-objective optimization algorithm to optimize these performance metrics and design novel P-anytime codes. Simulation results demonstrate that our proposed P-anytime codes achieve one to two orders of magnitude improvement in both bit erasure rate and bit error rate compared with prior-art anytime codes.",

keywords = "Anytime codes, density evolution, finite-length analysis, multi-objective differential evolution (MODE), spatially coupled LDPC codes",

author = "Xiaoxi Yu and Li Deng and Guan, {Yong Liang} and Zhaojie Yang",

note = "Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2024",

month = jan,

day = "1",

doi = "10.1109/LCOMM.2023.3333219",

language = "English",

volume = "28",

pages = "14--18",

journal = "IEEE Communications Letters",

issn = "1089-7798",

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

number = "1",

}

TY - JOUR

T1 - Optimization of Finite-Length Protograph-Based SC-LDPC Anytime Codes

AU - Yu, Xiaoxi

AU - Deng, Li

AU - Guan, Yong Liang

AU - Yang, Zhaojie

PY - 2024/1/1

Y1 - 2024/1/1

N2 - In this letter, we present an optimization method for designing Protograph-based spatially coupled low-density parity-check anytime (P-anytime) codes with outstanding finite-length performance. We first introduce two performance metrics, namely the delay-exponent and anytime mean parameters, to effectively capture the finite-length behavior of P-anytime codes. We then propose a multi-objective optimization algorithm to optimize these performance metrics and design novel P-anytime codes. Simulation results demonstrate that our proposed P-anytime codes achieve one to two orders of magnitude improvement in both bit erasure rate and bit error rate compared with prior-art anytime codes.

AB - In this letter, we present an optimization method for designing Protograph-based spatially coupled low-density parity-check anytime (P-anytime) codes with outstanding finite-length performance. We first introduce two performance metrics, namely the delay-exponent and anytime mean parameters, to effectively capture the finite-length behavior of P-anytime codes. We then propose a multi-objective optimization algorithm to optimize these performance metrics and design novel P-anytime codes. Simulation results demonstrate that our proposed P-anytime codes achieve one to two orders of magnitude improvement in both bit erasure rate and bit error rate compared with prior-art anytime codes.

KW - Anytime codes

KW - density evolution

KW - finite-length analysis

KW - multi-objective differential evolution (MODE)

KW - spatially coupled LDPC codes

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

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

U2 - 10.1109/LCOMM.2023.3333219

DO - 10.1109/LCOMM.2023.3333219

M3 - Article

AN - SCOPUS:85177092035

SN - 1089-7798

VL - 28

SP - 14

EP - 18

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 1

ER -

Optimization of Finite-Length Protograph-Based SC-LDPC Anytime Codes

Abstract

Bibliographical note

ASJC Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this