Lower Bounds on the Graphical Complexity of Finite-Length LDPC Codes

被引：0

作者：

Sason, Igal ^{[1
]}

机构：

[1] Technion Israel Inst Technol, Dept Elect Engn, IL-32000 Haifa, Israel

来源：

2009 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1- 4 | 2009年

关键词：

Bipartite graphs; complexity; low-density parity-check (LDPC) codes; memoryless binary-input output-symmetric (MBIOS) channels; CAPACITY-ACHIEVING ENSEMBLES; PARITY-CHECK DENSITY; LINEAR BLOCK-CODES; ERROR-PROBABILITY; ERASURE CHANNEL; PERFORMANCE;

D O I：

10.1109/ISIT.2009.5205822

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

This paper considers information-theoretic lower bounds on the graphical complexity of finite-length LDPC codes. It is assumed that the transmission of the codes takes place over a memoryless binary-input output-symmetric (MBIOS) channel, and the bounds are expressed as a function of the code performance and their achievable gap to capacity (either under ML decoding or any sub-optimal decoding algorithm). The lower bounds on the graphical complexity are compared to some explicit LDPC codes (or code ensembles), showing that these bounds are informative for considering the fundamental tradeoff which exists between the performance and graphical complexity of finite-length LDPC codes. This work relies on the full paper version [15].

引用

页码：219 / 223

页数：5

共 20 条

[1] AMRAOUI A, LDPCOPT SOFTWARE OPT
[2] ARDAKANI M, 2005, P 43 ANN ALL C COMM, P45
[3] Construction of protograph LDPC codes with linear minimum distance
Divsalar, Dariush
Dolinar, Sam
Jones, Christopher
[J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, VOLS 1-6, PROCEEDINGS, 2006, : 664 - +
[4] HSU CH, 2005, P 43 ANN ALL C COMM, P1825
[5] Capacity achieving LDPC codes through puncturing
Hsu, Chun-Hao
Anastasopoulos, Achilleas
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2008, 54 (10) : 4698 - 4706
[6] Khandekar A., 2001, Proceedings. 2001 IEEE International Symposium on Information Theory (IEEE Cat. No.01CH37252), DOI 10.1109/ISIT.2001.935864
[7] Construction of quasi-cyclic LDPC codes for AWGN and binary erasure channels: A finite field approach
Lan, Lan
Zeng, Lingqi
Tai, Ying Y.
Chen, Lei
Lin, Shu
Abdel-Ghaffar, Khaled
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (07) : 2429 - 2458
[8] Capacity-achieving ensembles for the binary erasure channel with bounded complexity
Pfister, HD
Sason, I
Urbanke, M
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2005, 51 (07) : 2352 - 2379
[9] Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity
Pfister, Henry D.
Sason, Igal
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) : 2088 - 2115
[10] BOUNDS ON THE DECODING ERROR-PROBABILITY OF BINARY LINEAR CODES VIA THEIR SPECTRA
POLTYREV, G
[J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 1994, 40 (04) : 1284 - 1292

← 1 2 →