A direct approach for decoding product codes

Kobi Ovadya; Ofer Amrani

doi:10.1109/ISIT.2005.1523514

A direct approach for decoding product codes

Kobi Ovadya, Ofer Amrani^*

^*Corresponding author for this work

School of Electrical Engineering

Research output: Contribution to journal › Conference article › peer-review

Abstract

A non-iterative soft decision decoding for direct product codes is discussed. The proposed decoder initially "distorts" the received matrix in a non-linear fashion - matching it to the geometrical properties of a certain, more basic, decoder. Thus, a low complexity decoding algorithm is obtained. On top of providing an efficient stopping criterion within the framework of iterative decoding, the proposed decoder also boosts overall performance for bounded decoding complexity.

Original language	English
Article number	1523514
Journal	IEEE International Symposium on Information Theory - Proceedings
Volume	2005-January
DOIs	https://doi.org/10.1109/ISIT.2005.1523514
State	Published - 2005
Event	2005 IEEE International Symposium on Information Theory, ISIT 05 - Adelaide, Australia Duration: 4 Sep 2005 → 9 Sep 2005

Keywords

Bounded-distance decoding
Clipping
Decision region
Product codes
Projection

Access to Document

10.1109/ISIT.2005.1523514

Cite this

@article{1d11d5415b6a46b89f31a66a6fbf745f,

title = "A direct approach for decoding product codes",

abstract = "A non-iterative soft decision decoding for direct product codes is discussed. The proposed decoder initially {"}distorts{"} the received matrix in a non-linear fashion - matching it to the geometrical properties of a certain, more basic, decoder. Thus, a low complexity decoding algorithm is obtained. On top of providing an efficient stopping criterion within the framework of iterative decoding, the proposed decoder also boosts overall performance for bounded decoding complexity.",

keywords = "Bounded-distance decoding, Clipping, Decision region, Product codes, Projection",

author = "Kobi Ovadya and Ofer Amrani",

year = "2005",

doi = "10.1109/ISIT.2005.1523514",

language = "אנגלית",

volume = "2005-January",

journal = "IEEE International Symposium on Information Theory - Proceedings",

issn = "2157-8095",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - A direct approach for decoding product codes

AU - Ovadya, Kobi

AU - Amrani, Ofer

PY - 2005

Y1 - 2005

N2 - A non-iterative soft decision decoding for direct product codes is discussed. The proposed decoder initially "distorts" the received matrix in a non-linear fashion - matching it to the geometrical properties of a certain, more basic, decoder. Thus, a low complexity decoding algorithm is obtained. On top of providing an efficient stopping criterion within the framework of iterative decoding, the proposed decoder also boosts overall performance for bounded decoding complexity.

AB - A non-iterative soft decision decoding for direct product codes is discussed. The proposed decoder initially "distorts" the received matrix in a non-linear fashion - matching it to the geometrical properties of a certain, more basic, decoder. Thus, a low complexity decoding algorithm is obtained. On top of providing an efficient stopping criterion within the framework of iterative decoding, the proposed decoder also boosts overall performance for bounded decoding complexity.

KW - Bounded-distance decoding

KW - Clipping

KW - Decision region

KW - Product codes

KW - Projection

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

U2 - 10.1109/ISIT.2005.1523514

DO - 10.1109/ISIT.2005.1523514

M3 - מאמר מכנס

AN - SCOPUS:36248957701

VL - 2005-January

JO - IEEE International Symposium on Information Theory - Proceedings

JF - IEEE International Symposium on Information Theory - Proceedings

SN - 2157-8095

M1 - 1523514

Y2 - 4 September 2005 through 9 September 2005

ER -

A direct approach for decoding product codes

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this