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 |
Fingerprint
Keywords
- BCH code
- Bounded-distance decoding
- Iterative decoding
- Soft-decision decoding
ASJC Scopus subject areas
- Electrical and Electronic Engineering
- Hardware and Architecture
- Information Systems
Cite this
Selection of search centers in iterative soft-decision decoding algorithms. / Tokushige, Hitoshi; Nakamaye, Kentaro; Kusaka, Takuya; Tang, Yuansheng; Kasami, Tadao.
In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E84-A, No. 10, 10.2001, p. 2397-2403.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - Selection of search centers in iterative soft-decision decoding algorithms
AU - Tokushige, Hitoshi
AU - Nakamaye, Kentaro
AU - Kusaka, Takuya
AU - Tang, Yuansheng
AU - Kasami, Tadao
PY - 2001/10
Y1 - 2001/10
N2 - 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.
AB - 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.
KW - BCH code
KW - Bounded-distance decoding
KW - Iterative decoding
KW - Soft-decision decoding
UR - http://www.scopus.com/inward/record.url?scp=0035483053&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0035483053&partnerID=8YFLogxK
M3 - Article
AN - SCOPUS:0035483053
VL - E84-A
SP - 2397
EP - 2403
JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
SN - 0916-8508
IS - 10
ER -