New Design of High-Rate Generalized Root Protograph LDPC Codes for Nonergodic Block Interference

Chanki Kim; Jong Seon No; Gangsan Kim; Hong Yeop Song; Jaeha Ahn

doi:10.1109/LCOMM.2018.2885944

New Design of High-Rate Generalized Root Protograph LDPC Codes for Nonergodic Block Interference

Chanki Kim^*
, Jong Seon No
, Gangsan Kim
, Hong Yeop Song
, Jaeha Ahn

^*Corresponding author for this work

Department of Computer Science & Artificial Intelligence

Seoul National University
Yonsei University
Korean Agency for Defense Development

Research output: Contribution to journal › Journal article › peer-review

5 Scopus citations

Abstract

In this letter, we propose high-rate generalized root protograph (GRP) low-density parity-check (LDPC) codes for a nonergodic two-state binary symmetric channel with block interference with and without block fading. In these channels, the proposed GRP LDPC codes have asymptotic and finite-length performance improvement approaching to channel outage probability.

Original language	English
Article number	8571264
Pages (from-to)	214-217
Number of pages	4
Journal	IEEE Communications Letters
Volume	23
Issue number	2
DOIs	https://doi.org/10.1109/LCOMM.2018.2885944
State	Published - 2019.02

Keywords

Block fading
block interference
low-density parity-check (LDPC) codes
protograph LDPC codes
root protograph (RP) LDPC codes

Access to Document

10.1109/LCOMM.2018.2885944

Cite this

@article{10a166d82e1e497e9851f5bd59957acf,

title = "New Design of High-Rate Generalized Root Protograph LDPC Codes for Nonergodic Block Interference",

abstract = "In this letter, we propose high-rate generalized root protograph (GRP) low-density parity-check (LDPC) codes for a nonergodic two-state binary symmetric channel with block interference with and without block fading. In these channels, the proposed GRP LDPC codes have asymptotic and finite-length performance improvement approaching to channel outage probability.",

keywords = "Block fading, block interference, low-density parity-check (LDPC) codes, protograph LDPC codes, root protograph (RP) LDPC codes",

author = "Chanki Kim and No, \{Jong Seon\} and Gangsan Kim and Song, \{Hong Yeop\} and Jaeha Ahn",

note = "Publisher Copyright: {\textcopyright} 1997-2012 IEEE.",

year = "2019",

month = feb,

doi = "10.1109/LCOMM.2018.2885944",

language = "English",

volume = "23",

pages = "214--217",

journal = "IEEE Communications Letters",

issn = "1089-7798",

number = "2",

}

TY - JOUR

T1 - New Design of High-Rate Generalized Root Protograph LDPC Codes for Nonergodic Block Interference

AU - Kim, Chanki

AU - No, Jong Seon

AU - Kim, Gangsan

AU - Song, Hong Yeop

AU - Ahn, Jaeha

PY - 2019/2

Y1 - 2019/2

N2 - In this letter, we propose high-rate generalized root protograph (GRP) low-density parity-check (LDPC) codes for a nonergodic two-state binary symmetric channel with block interference with and without block fading. In these channels, the proposed GRP LDPC codes have asymptotic and finite-length performance improvement approaching to channel outage probability.

AB - In this letter, we propose high-rate generalized root protograph (GRP) low-density parity-check (LDPC) codes for a nonergodic two-state binary symmetric channel with block interference with and without block fading. In these channels, the proposed GRP LDPC codes have asymptotic and finite-length performance improvement approaching to channel outage probability.

KW - Block fading

KW - block interference

KW - low-density parity-check (LDPC) codes

KW - protograph LDPC codes

KW - root protograph (RP) LDPC codes

UR - https://www.scopus.com/pages/publications/85058154694

U2 - 10.1109/LCOMM.2018.2885944

DO - 10.1109/LCOMM.2018.2885944

M3 - Journal article

AN - SCOPUS:85058154694

SN - 1089-7798

VL - 23

SP - 214

EP - 217

JO - IEEE Communications Letters

JF - IEEE Communications Letters

IS - 2

M1 - 8571264

ER -

New Design of High-Rate Generalized Root Protograph LDPC Codes for Nonergodic Block Interference

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this