Modified algorithm for hard decision decoding of product codes
Product coding produces powerful long codes from short constituent codes. The conventional row-column decoding algorithm of the product code does not exploit its full power of correcting random errors and proposes a modification to the conventional decoding algorithm, which makes it capable of reach...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2004
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14442/1/14442_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14442/2/14442_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | Product coding produces powerful long codes from short constituent codes. The conventional row-column decoding algorithm of the product code does not exploit its full power of correcting random errors and proposes a modification to the conventional decoding algorithm, which makes it capable of reaching the theoretical error correction capability of the code. In addition to its theoretical significance, the modified algorithm is shown to provide a gain of 0.5 dB over the conventional algorithm for AWGN channels. |
|---|