Abstract
We consider iterative soft-decision decoding algorithms in which bounded distance decodings are carried out with respect to successively selected input words, called search centers. Their error performances are degraded by the decoding failure of bounded distance decoding and the duplication in generating candidate codewords. To avoid those weak points, we present a new method of selecting sequences of search centers. For some BCH codes, we show the effectiveness by simulation results.
| Original language | English |
|---|---|
| Pages (from-to) | 2397-2403 |
| Number of pages | 7 |
| Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |
| Volume | E84-A |
| Issue number | 10 |
| Publication status | Published - Oct 2001 |
| Externally published | Yes |
Keywords
- BCH code
- Bounded-distance decoding
- Iterative decoding
- Soft-decision decoding
ASJC Scopus subject areas
- Signal Processing
- Computer Graphics and Computer-Aided Design
- Electrical and Electronic Engineering
- Applied Mathematics
Fingerprint Dive into the research topics of 'Selection of search centers in iterative soft-decision decoding algorithms'. Together they form a unique fingerprint.
Cite this
Tokushige, H., Nakamaye, K., Koumoto, T., Tang, Y., & Kasami, T. (2001). Selection of search centers in iterative soft-decision decoding algorithms. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E84-A(10), 2397-2403.