On the performance of short forward error-correcting codes

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

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-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 languageEnglish
Pages (from-to)880-882
JournalIEEE Communications Letters
Volume11
Issue number11
DOIs
Publication statusPublished - Nov 2007

Research Keywords

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

Fingerprint

Dive into the research topics of 'On the performance of short forward error-correcting codes'. Together they form a unique fingerprint.

Cite this