On the performance of short forward error-correcting codes

Sheng Tong; Dengsheng Lin; Aleksandar Kavčić; Li Ping; Baoming Bai

doi:10.1109/LCOMM.2007.070746

On the performance of short forward error-correcting codes

Sheng Tong, Dengsheng Lin, Aleksandar Kavčić, Li Ping, Baoming Bai

Department of Electrical Engineering

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

2 Citations (Scopus)

Abstract

This letter investigates the performance of short forward error-correcting (FEC) codes. Reed-Solomon (RS) codes and concatenated zigzag codes are chosen as representatives of classical algebraic codes and modern simple iteratively decodable codes, respectively. Additionally, random binary linear codes are used as a baseline reference. Our main results (demonstrated by simulations and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low-density paritycheck (LDPC) codes are almost as good as random binary linear codes; 3) Low complexity belief propagation decoders incur considerable performance loss at short coding lengths. Thus, future work could focus on developing low-complexity (near) optimal decoders for RS codes and/or LDPC codes. © 2007 IEEE.

Original language	English
Pages (from-to)	880-882
Journal	IEEE Communications Letters
Volume	11
Issue number	11
DOIs	https://doi.org/10.1109/LCOMM.2007.070746
Publication status	Published - Nov 2007

Research Keywords

Adaptive belief propagation
Concatenated zigzag CZ) codes
Reed-Solomon (RS) codes

Access Output

10.1109/LCOMM.2007.070746

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{6bff7d7fd9c64f5291d05a32136198c9,

title = "On the performance of short forward error-correcting codes",

abstract = "This letter investigates the performance of short forward error-correcting (FEC) codes. Reed-Solomon (RS) codes and concatenated zigzag codes are chosen as representatives of classical algebraic codes and modern simple iteratively decodable codes, respectively. Additionally, random binary linear codes are used as a baseline reference. Our main results (demonstrated by simulations and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low-density paritycheck (LDPC) codes are almost as good as random binary linear codes; 3) Low complexity belief propagation decoders incur considerable performance loss at short coding lengths. Thus, future work could focus on developing low-complexity (near) optimal decoders for RS codes and/or LDPC codes. {\textcopyright} 2007 IEEE.",

keywords = "Adaptive belief propagation, Concatenated zigzag CZ) codes, Reed-Solomon (RS) codes",

author = "Sheng Tong and Dengsheng Lin and Aleksandar Kav{\v c}i{\'c} and Li Ping and Baoming Bai",

year = "2007",

month = nov,

doi = "10.1109/LCOMM.2007.070746",

language = "English",

volume = "11",

pages = "880--882",

journal = "IEEE Communications Letters",

issn = "1089-7798",

publisher = "IEEE",

number = "11",

}

TY - JOUR

T1 - On the performance of short forward error-correcting codes

AU - Tong, Sheng

AU - Lin, Dengsheng

AU - Kavčić, Aleksandar

AU - Ping, Li

AU - Bai, Baoming

PY - 2007/11

Y1 - 2007/11

N2 - This letter investigates the performance of short forward error-correcting (FEC) codes. Reed-Solomon (RS) codes and concatenated zigzag codes are chosen as representatives of classical algebraic codes and modern simple iteratively decodable codes, respectively. Additionally, random binary linear codes are used as a baseline reference. Our main results (demonstrated by simulations and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low-density paritycheck (LDPC) codes are almost as good as random binary linear codes; 3) Low complexity belief propagation decoders incur considerable performance loss at short coding lengths. Thus, future work could focus on developing low-complexity (near) optimal decoders for RS codes and/or LDPC codes. © 2007 IEEE.

AB - This letter investigates the performance of short forward error-correcting (FEC) codes. Reed-Solomon (RS) codes and concatenated zigzag codes are chosen as representatives of classical algebraic codes and modern simple iteratively decodable codes, respectively. Additionally, random binary linear codes are used as a baseline reference. Our main results (demonstrated by simulations and ensemble distance spectrum analysis) are as follows: 1) Short RS codes are as good as random binary linear codes; 2) Carefully designed short low-density paritycheck (LDPC) codes are almost as good as random binary linear codes; 3) Low complexity belief propagation decoders incur considerable performance loss at short coding lengths. Thus, future work could focus on developing low-complexity (near) optimal decoders for RS codes and/or LDPC codes. © 2007 IEEE.

KW - Adaptive belief propagation

KW - Concatenated zigzag CZ) codes

KW - Reed-Solomon (RS) codes

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

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-36448976600&origin=recordpage

U2 - 10.1109/LCOMM.2007.070746

DO - 10.1109/LCOMM.2007.070746

M3 - RGC 21 - Publication in refereed journal

SN - 1089-7798

VL - 11

SP - 880

EP - 882

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 11

ER -

On the performance of short forward error-correcting codes

Abstract

Research Keywords

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this