© The Institution of Engineering and Technology
This reported work concerns the design and evaluation of low-density parity-check codes over a binary symmetric channel in the presence of a fixed-point min-sum decoder. In this case, using a discretised density evolution method together with an elegant linear programming approach, the constraint on the number of quantisation levels is incorporated in the optimisation process to derive a proper LDPC code. Simulation results demonstrate that the proposed method outperforms existing codes addressed in the literature.
References
-
-
1)
-
M. Ardakani ,
F.R. Kschischang
.
A more accurate one-dimensional analysis and design of irregular LDPC codes.
IEEE Trans. Commun.
,
12 ,
2106 -
2114
-
2)
-
Smith, B., Kschischang, F.R., Yu, W.: `Low-density parity-check codes for discretised min-sum decoding', 23rdBiennial Symp. on Communications, 2006, Kingston, Canada, p. 14–17.
-
3)
-
Anastasopoulos, A.: `A comparison between the sum-product and the min-sum iterative detection algorithms based on density evolution', IEEE Proc. GLOBECOM, 2001, San Antonio, TX, USA, 2, p. 1021–1025.
-
4)
-
L. Bazzi ,
T.J. Richardson ,
R.L. Urbanke
.
Exact thresholds and optimal codes for the binary-symmetric channel and Gallager's decoding algorithm A.
IEEE Trans. Inf. Theory
,
2 ,
2010 -
2021
-
5)
-
T.J. Richardson ,
M.A. Shokrollahi ,
R.L. Urbanke
.
Design of capacity-approaching irregular low-density parity-check codes.
IEEE Trans. Inf. Theory
,
619 -
637
-
6)
-
S.-Y. Chung ,
G.D. Forney ,
T.J. Richardson ,
R.L. Urbanke
.
On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit.
IEEE Commun. Lett.
,
2 ,
58 -
60
http://iet.metastore.ingenta.com/content/journals/10.1049/el.2011.3662
Related content
content/journals/10.1049/el.2011.3662
pub_keyword,iet_inspecKeyword,pub_concept
6
6