A systematic construction of capacity-achieving irregular low-density parity-check codes

Sundararajan Sankaranarayan; Bane Vasić; Erozan Kurtas

A systematic construction of capacity-achieving irregular low-density parity-check codes

Sundararajan Sankaranarayan, Bane Vasić, Erozan Kurtas

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

Abstract

The low density parity check (LDPC) codes from irregular bipartite graphs were analyzed. A method was proposed to split columns and rows of parity check matrix of regular LDPC code to construct capacity achieving irregular LDPC code with a given distribution. The process of splitting rows and columns of a regular LDPC code preserves the number of edges in the irregular graph.

Original language	English (US)
Pages (from-to)	DT09
Journal	Digests of the Intermag Conference
State	Published - 2003
Event	Intermag 2003: International Magnetics Conference - Boston, MA, United States Duration: Mar 28 2003 → Apr 3 2003

ASJC Scopus subject areas

Electrical and Electronic Engineering

Cite this

@article{75ba92a5b5da41168966686576804780,

title = "A systematic construction of capacity-achieving irregular low-density parity-check codes",

abstract = "The low density parity check (LDPC) codes from irregular bipartite graphs were analyzed. A method was proposed to split columns and rows of parity check matrix of regular LDPC code to construct capacity achieving irregular LDPC code with a given distribution. The process of splitting rows and columns of a regular LDPC code preserves the number of edges in the irregular graph.",

author = "Sundararajan Sankaranarayan and Bane Vasi{\'c} and Erozan Kurtas",

year = "2003",

language = "English (US)",

pages = "DT09",

journal = "Digests of the Intermag Conference",

issn = "0074-6843",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

note = "Intermag 2003: International Magnetics Conference ; Conference date: 28-03-2003 Through 03-04-2003",

}

TY - JOUR

T1 - A systematic construction of capacity-achieving irregular low-density parity-check codes

AU - Sankaranarayan, Sundararajan

AU - Vasić, Bane

AU - Kurtas, Erozan

PY - 2003

Y1 - 2003

N2 - The low density parity check (LDPC) codes from irregular bipartite graphs were analyzed. A method was proposed to split columns and rows of parity check matrix of regular LDPC code to construct capacity achieving irregular LDPC code with a given distribution. The process of splitting rows and columns of a regular LDPC code preserves the number of edges in the irregular graph.

AB - The low density parity check (LDPC) codes from irregular bipartite graphs were analyzed. A method was proposed to split columns and rows of parity check matrix of regular LDPC code to construct capacity achieving irregular LDPC code with a given distribution. The process of splitting rows and columns of a regular LDPC code preserves the number of edges in the irregular graph.

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

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

M3 - Conference article

SN - 0074-6843

SP - DT09

JO - Digests of the Intermag Conference

JF - Digests of the Intermag Conference

T2 - Intermag 2003: International Magnetics Conference

Y2 - 28 March 2003 through 3 April 2003

ER -

A systematic construction of capacity-achieving irregular low-density parity-check codes

Abstract

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this