1,630 research outputs found
Improved construction of irregular progressive edge-growth Tanner graphs
The progressive edge-growth algorithm is a well-known procedure to construct
regular and irregular low-density parity-check codes. In this paper, we propose
a modification of the original algorithm that improves the performance of these
codes in the waterfall region when constructing codes complying with both,
check and symbol node degree distributions. The proposed algorithm is thus
interesting if a family of irregular codes with a complex check node degree
distribution is used.Comment: 3 pages, 3 figure
Design of Non-Binary Quasi-Cyclic LDPC Codes by ACE Optimization
An algorithm for constructing Tanner graphs of non-binary irregular
quasi-cyclic LDPC codes is introduced. It employs a new method for selection of
edge labels allowing control over the code's non-binary ACE spectrum and
resulting in low error-floor. The efficiency of the algorithm is demonstrated
by generating good codes of short to moderate length over small fields,
outperforming codes generated by the known methods.Comment: Accepted to 2013 IEEE Information Theory Worksho
LDPC Codes Which Can Correct Three Errors Under Iterative Decoding
In this paper, we provide necessary and sufficient conditions for a
column-weight-three LDPC code to correct three errors when decoded using
Gallager A algorithm. We then provide a construction technique which results in
a code satisfying the above conditions. We also provide numerical assessment of
code performance via simulation results.Comment: 5 pages, 3 figures, submitted to IEEE Information Theory Workshop
(ITW), 200
- …