Construction of regular and irregular LDPC codes: Geometry decomposition and masking

被引：103

作者：

Marvell Semiconductor, Sunnyvale, CA 94089, United States ^{[1
]}

不详 ^{[2
]}

不详 ^{[3
]}

不详 ^{[4
]}

机构：

[1] Marvell Semiconductor, Sunnyvale

[2] Legend Silicon Corp., Fremont

[3] Hitachi GST, San Jose Research Center, San Jose

[4] Department of Electrical and Computer Engineering, University of California, Davis

来源：

IEEE Transactions on Information Theory | 2007年 / 53卷 / 01期

基金：

美国国家航空航天局; 美国国家科学基金会;

关键词：

Degree distribution; Euclidean geometry; Geometry decomposition; Masking; Permutation matrix;

D O I：

10.1109/TIT.2006.887082

中图分类号：

学科分类号：

摘要：

Two algebraic methods for systematic construction of structured regular and irregular low-density parity-check (LDPC) codes with girth of at least six and good minimum distances are presented. These two methods are based on geometry decomposition and a masking technique. Numerical results show that the codes constructed by these methods perform close to the Shannon limit and as well as random-like LDPC codes. Furthermore, they have low error floors and their iterative decoding converges very fast. The masking technique greatly simplifies the random-like construction of irregular LDPC codes designed on the basis of the degree distributions of their code graphs. © 2007 IEEE.

引用

页码：121 / 134

页数：13

共 67 条

[1]

Gallager R.G., Low-density parity-check codes, IRE Trans. In. Theory, IT-8, 1, pp. 21-28, (1962)

[2]

Sipser M., Spielman D., Expander codes, IEEE Trans. Inf. Theory, 42, 6, pp. 1710-1722, (1996)

[3]

MacKay D.J.C., Neal R.M., Near Shannon limit performance of low-density parity-check codes, Electron. Lett., 32, pp. 1645-1646, (1996)

[4]

MacKay D.J.C., Good error-correcting codes based on very sparse matrices, IEEE Trans. Inf. Theory, 45, 2, pp. 399-432, (1999)

[5]

Richardson T.J., Urbanke R.L., The capacity of low-density parity-check codes under message-passing decoding, IEEE Trans. Inf. Theory, 47, 2, pp. 599-618, (2001)

[6]

Richardson T.J., Shokrollahi M.A., Urbanke R.L., Design of capacity-approaching irregular low-density parity-check codes, IEEE Trans. Inf. Theory, 47, 2, pp. 619-637, (2001)

[7]

Chung S.Y., Forney G.D., Richardson T., Urbanke R., On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit, IEEE Commun. Lett., 5, 2, pp. 58-60, (2001)

[8]

Tanner R.M., A recursive approach to low complexity codes, IEEE Trans. Inf. Theory, IT-27, 5, pp. 533-547, (1981)

[9]

Wiberg N., Loeliger H.-A., Kotter R., Codes and iterative decoding on general graphs, Europ. Trans. Telecommun., 6, pp. 513-525, (1995)

[10]

Wiberg N., Codes and Decoding on General Graphs, (1996)

← 1 2 3 4 5 6 7 →