TY - JOUR
T1 - A direct approach for decoding product codes
AU - Ovadya, Kobi
AU - Amrani, Ofer
N1 - Publisher Copyright:
© 2005 Institute of Electrical and Electronics Engineers Inc.. All rights reserved.
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 - ???researchoutput.researchoutputtypes.contributiontojournal.conferencearticle???
AN - SCOPUS:36248957701
SN - 2157-8095
VL - 2005-January
JO - IEEE International Symposium on Information Theory - Proceedings
JF - IEEE International Symposium on Information Theory - Proceedings
M1 - 1523514
T2 - 2005 IEEE International Symposium on Information Theory, ISIT 05
Y2 - 4 September 2005 through 9 September 2005
ER -