Abstract
We consider a soft-decision iterative bounded distance decoding algorithm for binary linear block codes. In the decoding algorithm, bounded distance decodings are carried out with respect to successive input words, called the search centers. A search center is the sum of the hard-decision sequence of a received sequence and a sequence in a set of test patterns which are generated beforehand. This set of test patterns has influence on the error performance of the decoding algorithms as simulation results show. In this paper, we propose a construction method of a set of candidate test patterns and a selection method of test patterns based on an introduced measure of effectiveness of test patterns. For several BCH codes of lengths 127, 255 and 511, we show the effectiveness of the proposed method by simulation.
| Original language | English |
|---|---|
| Pages (from-to) | 2445-2451 |
| Number of pages | 7 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E86-A |
| Issue number | 10 |
| Publication status | Published - Oct 2003 |
| Externally published | Yes |
Keywords
- Algebraic decoding
- BCH code
- Covering code
- Iterative decoding
- Soft-decision decoding
ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics