On the performance of short forward error-correcting codes
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 880-882 |
Journal / Publication | IEEE Communications Letters |
Volume | 11 |
Issue number | 11 |
Publication status | Published - Nov 2007 |
Link(s)
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.
Research Area(s)
- Adaptive belief propagation, Concatenated zigzag CZ) codes, Reed-Solomon (RS) codes
Citation Format(s)
On the performance of short forward error-correcting codes. / Tong, Sheng; Lin, Dengsheng; Kavčić, Aleksandar; Ping, Li; Bai, Baoming.
In: IEEE Communications Letters, Vol. 11, No. 11, 11.2007, p. 880-882.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review