Design of low-rate irregular LDPC codes using trellis search

Sang Hyun Lee, Kwang Soon Kim

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

A simple design method using trellis search is proposed for good low-density parity-check (LDPC) codes with relatively low code rates. By applying a trellis search technique to the design of a pre-assigned part of the parity-check matrix that allows a simple encoding, we improve the distribution of cycles formed by the entries contained in the parity-check part of the parity-check matrix. In addition, we extend the proposed algorithm to a class of structured LDPC codes, which have been recently preferred in many practical applications. Simulation results show that the codes designed by the proposed method outperform those constructed by conventionally used greedy design algorithms.

Original languageEnglish
Pages (from-to)1994-2004
Number of pages11
JournalIEEE Transactions on Communications
Volume57
Issue number7
DOIs
Publication statusPublished - 2009 Aug 12

Fingerprint

Trellis codes

All Science Journal Classification (ASJC) codes

  • Electrical and Electronic Engineering

Cite this

@article{0b091121f991494b801237fec555eb54,
title = "Design of low-rate irregular LDPC codes using trellis search",
abstract = "A simple design method using trellis search is proposed for good low-density parity-check (LDPC) codes with relatively low code rates. By applying a trellis search technique to the design of a pre-assigned part of the parity-check matrix that allows a simple encoding, we improve the distribution of cycles formed by the entries contained in the parity-check part of the parity-check matrix. In addition, we extend the proposed algorithm to a class of structured LDPC codes, which have been recently preferred in many practical applications. Simulation results show that the codes designed by the proposed method outperform those constructed by conventionally used greedy design algorithms.",
author = "Lee, {Sang Hyun} and Kim, {Kwang Soon}",
year = "2009",
month = "8",
day = "12",
doi = "10.1109/TCOMM.2009.07.070088",
language = "English",
volume = "57",
pages = "1994--2004",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "7",

}

Design of low-rate irregular LDPC codes using trellis search. / Lee, Sang Hyun; Kim, Kwang Soon.

In: IEEE Transactions on Communications, Vol. 57, No. 7, 12.08.2009, p. 1994-2004.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Design of low-rate irregular LDPC codes using trellis search

AU - Lee, Sang Hyun

AU - Kim, Kwang Soon

PY - 2009/8/12

Y1 - 2009/8/12

N2 - A simple design method using trellis search is proposed for good low-density parity-check (LDPC) codes with relatively low code rates. By applying a trellis search technique to the design of a pre-assigned part of the parity-check matrix that allows a simple encoding, we improve the distribution of cycles formed by the entries contained in the parity-check part of the parity-check matrix. In addition, we extend the proposed algorithm to a class of structured LDPC codes, which have been recently preferred in many practical applications. Simulation results show that the codes designed by the proposed method outperform those constructed by conventionally used greedy design algorithms.

AB - A simple design method using trellis search is proposed for good low-density parity-check (LDPC) codes with relatively low code rates. By applying a trellis search technique to the design of a pre-assigned part of the parity-check matrix that allows a simple encoding, we improve the distribution of cycles formed by the entries contained in the parity-check part of the parity-check matrix. In addition, we extend the proposed algorithm to a class of structured LDPC codes, which have been recently preferred in many practical applications. Simulation results show that the codes designed by the proposed method outperform those constructed by conventionally used greedy design algorithms.

UR - http://www.scopus.com/inward/record.url?scp=68249147430&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=68249147430&partnerID=8YFLogxK

U2 - 10.1109/TCOMM.2009.07.070088

DO - 10.1109/TCOMM.2009.07.070088

M3 - Article

AN - SCOPUS:68249147430

VL - 57

SP - 1994

EP - 2004

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 7

ER -