Algebraic design and implementation of protograph codes using non-commuting permutation matrices

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Random lifts of graphs, or equivalently, random permutation matrices, have been used to construct good families of codes known as protograph codes. An algebraic analog of this approach was recently presented using voltage graphs, and it was shown that many existing algebraic constructions of graph-based codes that use commuting permutation matrices may be seen as special cases of voltage graph codes. Voltage graphs are graphs that have an element of a finite group assigned to each edge, and the assignment determines a specific lift of the graph. In this paper we discuss how assignments of permutation group elements to the edges of a base graph affect the properties of the lifted graph and corresponding codes, and present a construction method of LDPC code ensembles based on non-commuting permutation matrices. We also show encoder and decoder implementations for these codes.

Original languageEnglish (US)
Article number6427619
Pages (from-to)910-918
Number of pages9
JournalIEEE Transactions on Communications
Volume61
Issue number3
DOIs
StatePublished - Feb 5 2013

Fingerprint

Electric potential

Keywords

  • Low density parity check codes
  • graph lift
  • iterative decoding
  • voltage graphs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Algebraic design and implementation of protograph codes using non-commuting permutation matrices. / Kelley, Christine A.

In: IEEE Transactions on Communications, Vol. 61, No. 3, 6427619, 05.02.2013, p. 910-918.

Research output: Contribution to journalArticle

@article{a16adb45d39a4e25b0ba731555321732,
title = "Algebraic design and implementation of protograph codes using non-commuting permutation matrices",
abstract = "Random lifts of graphs, or equivalently, random permutation matrices, have been used to construct good families of codes known as protograph codes. An algebraic analog of this approach was recently presented using voltage graphs, and it was shown that many existing algebraic constructions of graph-based codes that use commuting permutation matrices may be seen as special cases of voltage graph codes. Voltage graphs are graphs that have an element of a finite group assigned to each edge, and the assignment determines a specific lift of the graph. In this paper we discuss how assignments of permutation group elements to the edges of a base graph affect the properties of the lifted graph and corresponding codes, and present a construction method of LDPC code ensembles based on non-commuting permutation matrices. We also show encoder and decoder implementations for these codes.",
keywords = "Low density parity check codes, graph lift, iterative decoding, voltage graphs",
author = "Kelley, {Christine A}",
year = "2013",
month = "2",
day = "5",
doi = "10.1109/TCOMM.2013.012313.110513",
language = "English (US)",
volume = "61",
pages = "910--918",
journal = "IEEE Transactions on Communications",
issn = "0096-1965",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "3",

}

TY - JOUR

T1 - Algebraic design and implementation of protograph codes using non-commuting permutation matrices

AU - Kelley, Christine A

PY - 2013/2/5

Y1 - 2013/2/5

N2 - Random lifts of graphs, or equivalently, random permutation matrices, have been used to construct good families of codes known as protograph codes. An algebraic analog of this approach was recently presented using voltage graphs, and it was shown that many existing algebraic constructions of graph-based codes that use commuting permutation matrices may be seen as special cases of voltage graph codes. Voltage graphs are graphs that have an element of a finite group assigned to each edge, and the assignment determines a specific lift of the graph. In this paper we discuss how assignments of permutation group elements to the edges of a base graph affect the properties of the lifted graph and corresponding codes, and present a construction method of LDPC code ensembles based on non-commuting permutation matrices. We also show encoder and decoder implementations for these codes.

AB - Random lifts of graphs, or equivalently, random permutation matrices, have been used to construct good families of codes known as protograph codes. An algebraic analog of this approach was recently presented using voltage graphs, and it was shown that many existing algebraic constructions of graph-based codes that use commuting permutation matrices may be seen as special cases of voltage graph codes. Voltage graphs are graphs that have an element of a finite group assigned to each edge, and the assignment determines a specific lift of the graph. In this paper we discuss how assignments of permutation group elements to the edges of a base graph affect the properties of the lifted graph and corresponding codes, and present a construction method of LDPC code ensembles based on non-commuting permutation matrices. We also show encoder and decoder implementations for these codes.

KW - Low density parity check codes

KW - graph lift

KW - iterative decoding

KW - voltage graphs

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

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

U2 - 10.1109/TCOMM.2013.012313.110513

DO - 10.1109/TCOMM.2013.012313.110513

M3 - Article

VL - 61

SP - 910

EP - 918

JO - IEEE Transactions on Communications

JF - IEEE Transactions on Communications

SN - 0096-1965

IS - 3

M1 - 6427619

ER -