Abstract
For binary linear block codes, we introduce multiple GMD decoding algorithm. In this algorithm, GMDlike decoding is iterated around a few appropriately selected search centers. The original GMD decoding by Forney [1] is a GMD-like decoding around the hard-decision sequence. Compared with the original GMD decoding, this decoding algorithm provides better error performance with moderate increment of iteration numbers. To reduce the number of iterations, we derive new effective sufficient conditions on the optimality of decoded codewords.
| Original language | English |
|---|---|
| Pages (from-to) | 1963-1965 |
| Number of pages | 3 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E83-A |
| Issue number | 10 |
| Publication status | Published - 2000 |
| Externally published | Yes |
Keywords
- Binary block codes
- Early termination conditions
- Multiple GMD decoding
- Soft-decision iterative decoding
ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics