Distance bounds for an ensemble of LDPC convolutional codes

被引：37

作者：

Sridharan, Arvind ^{[1
,2
]}

Truhachev, Dmitri ^{[3
]}

Lentmaier, Michael ^{[1
]}

Costello, Daniel J., Jr. ^{[1
]}

Zigangirov, Kamil Sh. ^{[1
,4
]}

机构：

[1] Univ Notre Dame, Dept Elect Engn, Notre Dame, IN 46556 USA

[2] Seagate Technol, Longmont, CO 80503 USA

[3] Univ Alberta, Res Fac, Dept Elect & Comp Engn, ECERF, Edmonton, AB T6G 2M7, Canada

[4] Inst Problems Informat Transmiss, Moscow, Russia

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 2007年 / 53卷 / 12期

基金：

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

关键词：

free distance lower bounds; low-density paritycheck (LDPC) codes; LDPC convolutional codes; minimum-distance lower bounds;

D O I：

10.1109/TIT.2007.909113

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

An ensemble of (J, K) -regular low-density parity-check (LDPC) convolutional codes is introduced and existence-type lower bounds on the minimum distance d(L) of code segments of finite length L and on the free distance d(free) are derived. For sufficiently large constraint lengths nu, the distances are shown to grow linearly with v and the ratio d(L)/nu approaches the ratio d(free)/nu for large L. Moreover, the ratio of free distance to constraint length is several times larger than the ratio of minimum distance to block length for Gallager's ensemble of (J, K) -regular LDPC block codes.

引用

页码：4537 / 4555

页数：19

共 50 条

[41] Asymptotic MAP upper bounds for LDPC codes
Matas, David
Lamarca, Meritxell
2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2893 - 2897
[42] On Upper Bounds for the Achievable Rates of LDPC Codes
Presman, Noam
Litsyn, Simon
2009 IEEE INFORMATION THEORY WORKSHOP (ITW 2009), 2009, : 21 - 25
[43] ML performance bounds of Turbo and LDPC codes
Chen, Kuan-Chi
Wu, Meng-Lin
Chen, Hsiao-Hsien
Shiu, Da-Shan
2012 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE (WCNC), 2012,
[44] LDPC Codes and Convolutional Codes with Equal Structural Delay: A Comparison
Hehn, Thorsten
Huber, Johannes B.
IEEE TRANSACTIONS ON COMMUNICATIONS, 2009, 57 (06) : 1683 - 1692
[45] Serially Concatenated Codes with Euclidean Geometry LDPC and Convolutional Codes
Vafi, Sina
Huu Dung Pham
2012 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATION SYSTEMS (IEEE ICCS 2012), 2012, : 393 - 397
[46] A Comparative Study of LDPC Codes and Convolutional Codes in WiMedia PHY
Lakshmi, R.
Jones, Theresa C.
Raju, Abin Johns
PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON ADVANCED COMPUTING & COMMUNICATION SYSTEMS (ICACCS), 2013,
[47] Ensemble weight enumerators for protograph LDPC codes
Divsalar, Dariush
2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 1554 - 1558
[48] Pseudocodeword Performance Analysis for LDPC Convolutional Codes
Smarandache, Roxana
Pusane, Ali E.
Vontobel, Pascal O.
Costello, Daniel J., Jr.
IEEE TRANSACTIONS ON INFORMATION THEORY, 2009, 55 (06) : 2577 - 2598
[49] On bandwidth-efficient convolutional LDPC codes
Pittermann, J
Lentmaier, M
Zigangirov, KS
2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 235 - 235
[50] DC-free LDPC convolutional codes
Frontana, Emma
Fair, Ivan John
IEICE COMMUNICATIONS EXPRESS, 2013, 2 (04): : 135 - 140

← 1 2 3 4 5 →