Nonlinear product codes and their low complexity iterative decoding

Haesik Kim, Garik Markarian, Valdemar C Da Rocha Jr.

Research output: Contribution to journalArticleScientificpeer-review

2 Citations (Scopus)

Abstract

This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N‐dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well‐known nonlinear Nordstrom‐Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of 10−6 when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom‐Robinson codes has an effective gain of about 0.7 dB at a BER of 10−5 when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi‐cyclic codes.
Original languageEnglish
Pages (from-to)588-595
Number of pages8
JournalETRI Journal
Volume32
Issue number4
DOIs
Publication statusPublished - 2010
MoE publication typeA1 Journal article-refereed

Fingerprint

Iterative decoding
Binary codes
Decoding

Keywords

  • Turbo product code
  • nonlinear error control coding

Cite this

Kim, Haesik ; Markarian, Garik ; Da Rocha Jr., Valdemar C. / Nonlinear product codes and their low complexity iterative decoding. In: ETRI Journal. 2010 ; Vol. 32, No. 4. pp. 588-595.
@article{fe78bb749133450baa62e79658a426b9,
title = "Nonlinear product codes and their low complexity iterative decoding",
abstract = "This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N‐dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well‐known nonlinear Nordstrom‐Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of 10−6 when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom‐Robinson codes has an effective gain of about 0.7 dB at a BER of 10−5 when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi‐cyclic codes.",
keywords = "Turbo product code, nonlinear error control coding",
author = "Haesik Kim and Garik Markarian and {Da Rocha Jr.}, {Valdemar C}",
year = "2010",
doi = "10.4218/etrij.10.0109.0643",
language = "English",
volume = "32",
pages = "588--595",
journal = "ETRI Journal",
issn = "1225-6463",
publisher = "Wiley-Blackwell",
number = "4",

}

Nonlinear product codes and their low complexity iterative decoding. / Kim, Haesik; Markarian, Garik; Da Rocha Jr., Valdemar C.

In: ETRI Journal, Vol. 32, No. 4, 2010, p. 588-595.

Research output: Contribution to journalArticleScientificpeer-review

TY - JOUR

T1 - Nonlinear product codes and their low complexity iterative decoding

AU - Kim, Haesik

AU - Markarian, Garik

AU - Da Rocha Jr., Valdemar C

PY - 2010

Y1 - 2010

N2 - This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N‐dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well‐known nonlinear Nordstrom‐Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of 10−6 when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom‐Robinson codes has an effective gain of about 0.7 dB at a BER of 10−5 when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi‐cyclic codes.

AB - This paper proposes encoding and decoding for nonlinear product codes and investigates the performance of nonlinear product codes. The proposed nonlinear product codes are constructed as N‐dimensional product codes where the constituent codes are nonlinear binary codes derived from the linear codes over higher order alphabets, for example, Preparata or Kerdock codes. The performance and the complexity of the proposed construction are evaluated using the well‐known nonlinear Nordstrom‐Robinson code, which is presented in the generalized array code format with a low complexity trellis. The proposed construction shows the additional coding gain, reduced error floor, and lower implementation complexity. The (64, 24, 12) nonlinear binary product code has an effective gain of about 2.5 dB and 1 dB gain at a BER of 10−6 when compared to the (64, 15, 16) linear product code and the (64, 24, 10) linear product code, respectively. The (256, 64, 36) nonlinear binary product code composed of two Nordstrom‐Robinson codes has an effective gain of about 0.7 dB at a BER of 10−5 when compared to the (256, 64, 25) linear product code composed of two (16, 8, 5) quasi‐cyclic codes.

KW - Turbo product code

KW - nonlinear error control coding

U2 - 10.4218/etrij.10.0109.0643

DO - 10.4218/etrij.10.0109.0643

M3 - Article

VL - 32

SP - 588

EP - 595

JO - ETRI Journal

JF - ETRI Journal

SN - 1225-6463

IS - 4

ER -