Non-systematic LDPC codes via scrambling and splitting

Amira Alloum, Joseph Boutros, Gil I. Shamir, Li Wang

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

12 Citations (Scopus)

Abstract

We consider design of non-systematic low-density parity-check (LDPC) codes for channel decoding of redundant sequences. We demonstrate that in the presence of source redundancy in channel coded sequences there may be a significant advantage to well designed non-systematic channel encoding over systematic encoding. In particular, we study methods we recently proposed for designing non-systematic LDPC codes by scrambling or splitting redundant data bits into coded bits. These methods consist of cascading a sparse matrix or an inverse of a sparse matrix with an LDPC code. We propose a method to perform density evolution on splitting based LDPC codes, and show that splitting based LDPC codes achieve better gains in the presence of redundancy than other known codes, including MacKay-Neal (MN) codes, without significant loss even if the data contains no redundancy. Using density evolution, we show that for independently identically distributed (i.i.d.) nonuniform (redundant) sequences, splitting based non-systematic codes can theoretically achieve very good performance.

Original languageEnglish
Title of host publication43rd Annual Allerton Conference on Communication, Control and Computing 2005
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages1879-1888
Number of pages10
Volume4
ISBN (Electronic)9781604234916
Publication statusPublished - 1 Jan 2005
Externally publishedYes
Event43rd Annual Allerton Conference on Communication, Control and Computing 2005 - Monticello, United States
Duration: 28 Sep 200530 Sep 2005

Other

Other43rd Annual Allerton Conference on Communication, Control and Computing 2005
CountryUnited States
CityMonticello
Period28/9/0530/9/05

Fingerprint

Redundancy
Decoding

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Computer Science Applications

Cite this

Alloum, A., Boutros, J., Shamir, G. I., & Wang, L. (2005). Non-systematic LDPC codes via scrambling and splitting. In 43rd Annual Allerton Conference on Communication, Control and Computing 2005 (Vol. 4, pp. 1879-1888). University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering.

Non-systematic LDPC codes via scrambling and splitting. / Alloum, Amira; Boutros, Joseph; Shamir, Gil I.; Wang, Li.

43rd Annual Allerton Conference on Communication, Control and Computing 2005. Vol. 4 University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2005. p. 1879-1888.

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

Alloum, A, Boutros, J, Shamir, GI & Wang, L 2005, Non-systematic LDPC codes via scrambling and splitting. in 43rd Annual Allerton Conference on Communication, Control and Computing 2005. vol. 4, University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, pp. 1879-1888, 43rd Annual Allerton Conference on Communication, Control and Computing 2005, Monticello, United States, 28/9/05.
Alloum A, Boutros J, Shamir GI, Wang L. Non-systematic LDPC codes via scrambling and splitting. In 43rd Annual Allerton Conference on Communication, Control and Computing 2005. Vol. 4. University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering. 2005. p. 1879-1888
Alloum, Amira ; Boutros, Joseph ; Shamir, Gil I. ; Wang, Li. / Non-systematic LDPC codes via scrambling and splitting. 43rd Annual Allerton Conference on Communication, Control and Computing 2005. Vol. 4 University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering, 2005. pp. 1879-1888
@inproceedings{3f41749444f8409893f52580d8adba63,
title = "Non-systematic LDPC codes via scrambling and splitting",
abstract = "We consider design of non-systematic low-density parity-check (LDPC) codes for channel decoding of redundant sequences. We demonstrate that in the presence of source redundancy in channel coded sequences there may be a significant advantage to well designed non-systematic channel encoding over systematic encoding. In particular, we study methods we recently proposed for designing non-systematic LDPC codes by scrambling or splitting redundant data bits into coded bits. These methods consist of cascading a sparse matrix or an inverse of a sparse matrix with an LDPC code. We propose a method to perform density evolution on splitting based LDPC codes, and show that splitting based LDPC codes achieve better gains in the presence of redundancy than other known codes, including MacKay-Neal (MN) codes, without significant loss even if the data contains no redundancy. Using density evolution, we show that for independently identically distributed (i.i.d.) nonuniform (redundant) sequences, splitting based non-systematic codes can theoretically achieve very good performance.",
author = "Amira Alloum and Joseph Boutros and Shamir, {Gil I.} and Li Wang",
year = "2005",
month = "1",
day = "1",
language = "English",
volume = "4",
pages = "1879--1888",
booktitle = "43rd Annual Allerton Conference on Communication, Control and Computing 2005",
publisher = "University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering",

}

TY - GEN

T1 - Non-systematic LDPC codes via scrambling and splitting

AU - Alloum, Amira

AU - Boutros, Joseph

AU - Shamir, Gil I.

AU - Wang, Li

PY - 2005/1/1

Y1 - 2005/1/1

N2 - We consider design of non-systematic low-density parity-check (LDPC) codes for channel decoding of redundant sequences. We demonstrate that in the presence of source redundancy in channel coded sequences there may be a significant advantage to well designed non-systematic channel encoding over systematic encoding. In particular, we study methods we recently proposed for designing non-systematic LDPC codes by scrambling or splitting redundant data bits into coded bits. These methods consist of cascading a sparse matrix or an inverse of a sparse matrix with an LDPC code. We propose a method to perform density evolution on splitting based LDPC codes, and show that splitting based LDPC codes achieve better gains in the presence of redundancy than other known codes, including MacKay-Neal (MN) codes, without significant loss even if the data contains no redundancy. Using density evolution, we show that for independently identically distributed (i.i.d.) nonuniform (redundant) sequences, splitting based non-systematic codes can theoretically achieve very good performance.

AB - We consider design of non-systematic low-density parity-check (LDPC) codes for channel decoding of redundant sequences. We demonstrate that in the presence of source redundancy in channel coded sequences there may be a significant advantage to well designed non-systematic channel encoding over systematic encoding. In particular, we study methods we recently proposed for designing non-systematic LDPC codes by scrambling or splitting redundant data bits into coded bits. These methods consist of cascading a sparse matrix or an inverse of a sparse matrix with an LDPC code. We propose a method to perform density evolution on splitting based LDPC codes, and show that splitting based LDPC codes achieve better gains in the presence of redundancy than other known codes, including MacKay-Neal (MN) codes, without significant loss even if the data contains no redundancy. Using density evolution, we show that for independently identically distributed (i.i.d.) nonuniform (redundant) sequences, splitting based non-systematic codes can theoretically achieve very good performance.

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

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

M3 - Conference contribution

AN - SCOPUS:84961911055

VL - 4

SP - 1879

EP - 1888

BT - 43rd Annual Allerton Conference on Communication, Control and Computing 2005

PB - University of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering

ER -