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 some more basic decoder. Thus, a low complexity decoding algorithm is obtained while also providing an efficient stopping criterion within the framework of iterative decoding. A single-list optimum approach for decoding product codes is also considered.
|Number of pages||4|
|State||Published - 2004|
|Event||2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings - Tel-Aviv, Israel|
Duration: 6 Sep 2004 → 7 Sep 2004
|Conference||2004 23rd IEEE Convention of Electrical and Electronics Engineers in Israel, Proceedings|
|Period||6/09/04 → 7/09/04|