2010
DOI: 10.4218/etrij.10.0109.0643
|View full text |Cite
|
Sign up to set email alerts
|

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 pr… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2

Citation Types

0
1
0

Year Published

2011
2011
2024
2024

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(2 citation statements)
references
References 22 publications
(64 reference statements)
0
1
0
Order By: Relevance
“…A detailed overview of different decoding algorithms for codes over rings is given in Section 2. Classical codes over rings are interesting as component codes in product and turbo coding schemes [16,22,23], but one of the main obstacles to their adoption in modern coding systems is the lack of efficient SISO decoding algorithms. As far as we are aware, generalized Kerdock codes do not yet have any soft decoders specifically designed to exploit their unique structure, so the main objective of this study is to address this gap by presenting maximum likelihood (ML) and maximum a posteriori (MAP) decoding algorithms for them.…”
Section: Introductionmentioning
confidence: 99%
“…A detailed overview of different decoding algorithms for codes over rings is given in Section 2. Classical codes over rings are interesting as component codes in product and turbo coding schemes [16,22,23], but one of the main obstacles to their adoption in modern coding systems is the lack of efficient SISO decoding algorithms. As far as we are aware, generalized Kerdock codes do not yet have any soft decoders specifically designed to exploit their unique structure, so the main objective of this study is to address this gap by presenting maximum likelihood (ML) and maximum a posteriori (MAP) decoding algorithms for them.…”
Section: Introductionmentioning
confidence: 99%
“…There is widespread use of the Nordstrom-Robinson code in digital systems [9,10]. A turbo product coding scheme with Nordstrom-Robinson as a component code was presented in [11,12]. Kerdock codes for limited feedback MIMO systems were presented in [13,14].…”
Section: Introductionmentioning
confidence: 99%