Performance Improvement of Accumulate-Repeat-Accumulate Codes with Bounded Complexity

被引：0

作者：

Saad, Waleed ^{[1
]}

Ibraheem, Shady M. ^{[2
,3
]}

Abd Elrazzak, Maher M. ^{[2
,3
]}

Eldin, Salwa S. ^{[4
,5
]}

Aboelazm, Atef E. ^{[1
]}

机构：

[1] Menoufiya Univ, Fac Elect Engn, Dept Commun Engn, Menoufia, Egypt

[2] Mansoura Univ, Fac Engn, Dept Commun Engn, Mansoura, Egypt

[3] Telecom Egypt, Cairo, Egypt

[4] Tanta Univ, Fac Engn, Dept Commun Engn, Tanta, Egypt

[5] Taif Univ, At Taif, Saudi Arabia

来源：

2015 IEEE 82ND VEHICULAR TECHNOLOGY CONFERENCE (VTC FALL) | 2015年

关键词：

Binary erasure channels (BEC); density evolution (DE); spatially coupling; degree distributions; state nodes; ENSEMBLES; CHANNEL;

D O I：

暂无

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

In this paper, we introduce a new family of codes named as systematic spatially-coupled accumulate repeat accumulate SC-ARA codes based on chain of interconnected proto-graphs over the binary erasure channels (BEC). It has been observed that Spatially-coupled low density parity check (SC-LDPC) codes are able to approach the capacity universally across the binary-input memoryless (BMS) channels. A density evolution (DE) analysis is provided for this class of codes which categorized by bounded density and/or complexity per information bit. Simulation results show that the spatially coupling of ensembles of ARA codes, with bounded density and/or complexity, drives the message-passing belief propagation decoding threshold (BP) to be closed to the maximum a posterior (MAP) threshold of the underlying codes over the BEC.

引用

页数：5

共 50 条

[1] Accumulate-repeat-accumulate codes
Abbasfar, Aliazam
Divsalar, Dariush
Yao, Kung
IEEE TRANSACTIONS ON COMMUNICATIONS, 2007, 55 (04) : 692 - 702
[2] Accumulate-repeat-accumulate codes: Capacity-achieving ensembles of systematic codes for the erasure channel with bounded complexity
Pfister, Henry D.
Sason, Igal
IEEE TRANSACTIONS ON INFORMATION THEORY, 2007, 53 (06) : 2088 - 2115
[3] Maximum likelihood decoding analysis of accumulate-repeat-accumulate codes
Abbasfar, A
Divsalar, D
Yao, K
GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 514 - 519
[4] Accumulate repeat accumulate codes
Abbasfar, A
Divsalar, D
Yao, K
2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 505 - 505
[5] Accumulate repeat accumulate codes
Abbasfar, A
Divsalar, D
Yao, K
GLOBECOM '04: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-6, 2004, : 509 - 513
[6] Accumulate-Repeat-Accumulate-Accumulate-codes
Divsalar, D
Dolinar, S
Thorpe, J
VTC2004-FALL: 2004 IEEE 60TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-7: WIRELESS TECHNOLOGIES FOR GLOBAL SECURITY, 2004, : 2292 - 2296
[7] Accumulate Repeat Accumulate Check Accumulate Codes
Jeon, Ki Jun
Kim, Kwang Soon
IEEE TRANSACTIONS ON COMMUNICATIONS, 2017, 65 (11) : 4585 - 4599
[8] On Trapping Sets for Repeat Accumulate Accumulate Codes
Kliewer, Joerg
Koller, Christian
Graell i Amat, Alexandre
Costello, Daniel J., Jr.
2009 INFORMATION THEORY AND APPLICATIONS WORKSHOP, 2009, : 161 - +
[9] On the Minimum Trapping Distance of Repeat Accumulate Accumulate Codes
Kliewer, Joerg
Zigangirov, Kamil S.
Costello, Daniel J., Jr.
2008 46TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1-3, 2008, : 1410 - +
[10] Extended Hamming accumulate codes and modified irregular repeat accumulate codes
Park, SI
Yang, K
ELECTRONICS LETTERS, 2002, 38 (10) : 467 - 468

← 1 2 3 4 5 →