Average min-sum decoding of LDPC codes

Nathan Axvig, Deanna Dreher, Katherine Morrison, Eric Psota, Lance C Perez, Judy L. Walker

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

4 Citations (Scopus)

Abstract

Simulations have shown that the outputs of min-sum (MS) decoding generally behave in one of two ways: either the output vector eventually stabilizes at a codeword or it eventually cycles through a finite set of vectors that may include both code-words and non-codewords. The latter behavior has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average min-sum (AMS), is proposed; this decoder outputs the average of the MS output vectors over a finite set of iterations. Simulations comparing MS, AMS, linear programming (LP) decoding, and maximum likelihood (ML) decoding are presented, illustrating the relative performances of each of these decoders. In general, MS and AMS have comparable word error rates; however, in the simulation of a code with large block length, AMS has a significantly lower bit error rate. Finally, AMS pseudocodewords are introduced and their relationship to graph cover and LP pseudocodewords is explored, with particular focus on the AMS pseudocodewords of regular LDPC codes and cycle codes.

Original languageEnglish (US)
Title of host publication2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
Pages356-361
Number of pages6
DOIs
StatePublished - Dec 29 2008
Event2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING - Lausanne, Switzerland
Duration: Sep 1 2008Sep 5 2008

Publication series

Name2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

Other

Other2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING
CountrySwitzerland
CityLausanne
Period9/1/089/5/08

Fingerprint

Decoding
Linear programming
Bit error rate
Maximum likelihood

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Computer Science Applications

Cite this

Axvig, N., Dreher, D., Morrison, K., Psota, E., Perez, L. C., & Walker, J. L. (2008). Average min-sum decoding of LDPC codes. In 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING (pp. 356-361). [4658725] (2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING). https://doi.org/10.1109/TURBOCODING.2008.4658725

Average min-sum decoding of LDPC codes. / Axvig, Nathan; Dreher, Deanna; Morrison, Katherine; Psota, Eric; Perez, Lance C; Walker, Judy L.

2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING. 2008. p. 356-361 4658725 (2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING).

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

Axvig, N, Dreher, D, Morrison, K, Psota, E, Perez, LC & Walker, JL 2008, Average min-sum decoding of LDPC codes. in 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING., 4658725, 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING, pp. 356-361, 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING, Lausanne, Switzerland, 9/1/08. https://doi.org/10.1109/TURBOCODING.2008.4658725
Axvig N, Dreher D, Morrison K, Psota E, Perez LC, Walker JL. Average min-sum decoding of LDPC codes. In 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING. 2008. p. 356-361. 4658725. (2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING). https://doi.org/10.1109/TURBOCODING.2008.4658725
Axvig, Nathan ; Dreher, Deanna ; Morrison, Katherine ; Psota, Eric ; Perez, Lance C ; Walker, Judy L. / Average min-sum decoding of LDPC codes. 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING. 2008. pp. 356-361 (2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING).
@inproceedings{ec4971924abc4b4581973efc46844c20,
title = "Average min-sum decoding of LDPC codes",
abstract = "Simulations have shown that the outputs of min-sum (MS) decoding generally behave in one of two ways: either the output vector eventually stabilizes at a codeword or it eventually cycles through a finite set of vectors that may include both code-words and non-codewords. The latter behavior has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average min-sum (AMS), is proposed; this decoder outputs the average of the MS output vectors over a finite set of iterations. Simulations comparing MS, AMS, linear programming (LP) decoding, and maximum likelihood (ML) decoding are presented, illustrating the relative performances of each of these decoders. In general, MS and AMS have comparable word error rates; however, in the simulation of a code with large block length, AMS has a significantly lower bit error rate. Finally, AMS pseudocodewords are introduced and their relationship to graph cover and LP pseudocodewords is explored, with particular focus on the AMS pseudocodewords of regular LDPC codes and cycle codes.",
author = "Nathan Axvig and Deanna Dreher and Katherine Morrison and Eric Psota and Perez, {Lance C} and Walker, {Judy L.}",
year = "2008",
month = "12",
day = "29",
doi = "10.1109/TURBOCODING.2008.4658725",
language = "English (US)",
isbn = "9781424428632",
series = "2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING",
pages = "356--361",
booktitle = "2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING",

}

TY - GEN

T1 - Average min-sum decoding of LDPC codes

AU - Axvig, Nathan

AU - Dreher, Deanna

AU - Morrison, Katherine

AU - Psota, Eric

AU - Perez, Lance C

AU - Walker, Judy L.

PY - 2008/12/29

Y1 - 2008/12/29

N2 - Simulations have shown that the outputs of min-sum (MS) decoding generally behave in one of two ways: either the output vector eventually stabilizes at a codeword or it eventually cycles through a finite set of vectors that may include both code-words and non-codewords. The latter behavior has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average min-sum (AMS), is proposed; this decoder outputs the average of the MS output vectors over a finite set of iterations. Simulations comparing MS, AMS, linear programming (LP) decoding, and maximum likelihood (ML) decoding are presented, illustrating the relative performances of each of these decoders. In general, MS and AMS have comparable word error rates; however, in the simulation of a code with large block length, AMS has a significantly lower bit error rate. Finally, AMS pseudocodewords are introduced and their relationship to graph cover and LP pseudocodewords is explored, with particular focus on the AMS pseudocodewords of regular LDPC codes and cycle codes.

AB - Simulations have shown that the outputs of min-sum (MS) decoding generally behave in one of two ways: either the output vector eventually stabilizes at a codeword or it eventually cycles through a finite set of vectors that may include both code-words and non-codewords. The latter behavior has significantly contributed to the difficulty in studying the performance of this decoder. To overcome this problem, a new decoder, average min-sum (AMS), is proposed; this decoder outputs the average of the MS output vectors over a finite set of iterations. Simulations comparing MS, AMS, linear programming (LP) decoding, and maximum likelihood (ML) decoding are presented, illustrating the relative performances of each of these decoders. In general, MS and AMS have comparable word error rates; however, in the simulation of a code with large block length, AMS has a significantly lower bit error rate. Finally, AMS pseudocodewords are introduced and their relationship to graph cover and LP pseudocodewords is explored, with particular focus on the AMS pseudocodewords of regular LDPC codes and cycle codes.

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

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

U2 - 10.1109/TURBOCODING.2008.4658725

DO - 10.1109/TURBOCODING.2008.4658725

M3 - Conference contribution

SN - 9781424428632

T3 - 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

SP - 356

EP - 361

BT - 2008 5th International Symposium on Turbo Codes and Related Topics, TURBOCODING

ER -