Selection of search centers in iterative soft-decision decoding algorithms

Authors
Tokushige, H Nakamaye, K Koumoto, T Tang, YS Kasami, T
Citation
H. Tokushige et al., Selection of search centers in iterative soft-decision decoding algorithms, IEICE T FUN, E84A(10), 2001, pp. 2397-2403
Citations number
14
Categorie Soggetti
Eletrical & Eletronics Engineeing
Journal title
IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES
ISSN journal
09168508 → ACNP
Volume
E84A
Issue
10
Year of publication
2001
Pages
2397 - 2403
Database
ISI
SICI code
0916-8508(200110)E84A:10<2397:SOSCII>2.0.ZU;2-T
Abstract
We consider iterative soft-decision decoding algorithms in which bounded di stance decodings are carried out with respect to successively selected inpu t words, called search centers. Their error performances are degraded by th e decoding failure of bounded distance decoding and the duplication in gene rating candidate codewords. To avoid those weak points, we present a new me thod of selecting sequences of search centers. For some BCH codes, we show the effectiveness by simulation results.