Home > Research > Publications & Outputs > Nonlinear Product Codes and Their Low Complexit...
View graph of relations

Nonlinear Product Codes and Their Low Complexity Iterative Decoding

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

Nonlinear Product Codes and Their Low Complexity Iterative Decoding. / Kim, Haesik; Markarian, Garik; Cardoso Da Rocha, Valdemar.
In: ETRI Journal, Vol. 32, No. 4, 08.2010, p. 588-595.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Kim, H, Markarian, G & Cardoso Da Rocha, V 2010, 'Nonlinear Product Codes and Their Low Complexity Iterative Decoding', ETRI Journal, vol. 32, no. 4, pp. 588-595. https://doi.org/10.4218/etrij.10.0109.0643

APA

Vancouver

Kim H, Markarian G, Cardoso Da Rocha V. Nonlinear Product Codes and Their Low Complexity Iterative Decoding. ETRI Journal. 2010 Aug;32(4):588-595. doi: 10.4218/etrij.10.0109.0643

Author

Kim, Haesik ; Markarian, Garik ; Cardoso Da Rocha, Valdemar. / Nonlinear Product Codes and Their Low Complexity Iterative Decoding. In: ETRI Journal. 2010 ; Vol. 32, No. 4. pp. 588-595.

Bibtex

@article{5a7eb5ef142248688a6862805006766a,
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 {Cardoso Da Rocha}, Valdemar",
year = "2010",
month = aug,
doi = "10.4218/etrij.10.0109.0643",
language = "English",
volume = "32",
pages = "588--595",
journal = "ETRI Journal",
publisher = "ETRI",
number = "4",

}

RIS

TY - JOUR

T1 - Nonlinear Product Codes and Their Low Complexity Iterative Decoding

AU - Kim, Haesik

AU - Markarian, Garik

AU - Cardoso Da Rocha, Valdemar

PY - 2010/8

Y1 - 2010/8

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 - Journal article

VL - 32

SP - 588

EP - 595

JO - ETRI Journal

JF - ETRI Journal

IS - 4

ER -