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

Sundararajan Sankaranarayan, Bane V Vasic, Erozan Kurtas

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 languageEnglish (US)
Title of host publicationDigests of the Intermag Conference
StatePublished - 2003
EventIntermag 2003: International Magnetics Conference - Boston, MA, United States
Duration: Mar 28 2003Apr 3 2003

Other

OtherIntermag 2003: International Magnetics Conference
CountryUnited States
CityBoston, MA
Period3/28/034/3/03

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Sankaranarayan, S., Vasic, B. V., & Kurtas, E. (2003). A systematic construction of capacity-achieving irregular low-density parity-check codes. In Digests of the Intermag Conference

A systematic construction of capacity-achieving irregular low-density parity-check codes. / Sankaranarayan, Sundararajan; Vasic, Bane V; Kurtas, Erozan.

Digests of the Intermag Conference. 2003.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Sankaranarayan, S, Vasic, BV & Kurtas, E 2003, A systematic construction of capacity-achieving irregular low-density parity-check codes. in Digests of the Intermag Conference. Intermag 2003: International Magnetics Conference, Boston, MA, United States, 3/28/03.
Sankaranarayan S, Vasic BV, Kurtas E. A systematic construction of capacity-achieving irregular low-density parity-check codes. In Digests of the Intermag Conference. 2003
Sankaranarayan, Sundararajan ; Vasic, Bane V ; Kurtas, Erozan. / A systematic construction of capacity-achieving irregular low-density parity-check codes. Digests of the Intermag Conference. 2003.
@inproceedings{a3b5f164068249a397f1e3a763c8609f,
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 Vasic, {Bane V} and Erozan Kurtas",
year = "2003",
language = "English (US)",
booktitle = "Digests of the Intermag Conference",

}

TY - GEN

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

AU - Sankaranarayan, Sundararajan

AU - Vasic, Bane V

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 contribution

BT - Digests of the Intermag Conference

ER -