On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes
On soft-decision iterative decoding algorithms by using algebraic decoding for RS codes
复制标题
基于RS码代数译码的软判决迭代译码算法
DOI：
10.1109/glocom.2002.1188353
复制
发表时间：
2002
期刊：
影响因子：
--
通讯作者：
T. Kasami
中科院分区：
文献类型：
--
作者：
H. Tokushige;Ippei Hisadomi;T. Kasami
我们考虑一种使用代数译码的非二进制码的迭代译码算法。在译码算法中，对被称为搜索中心的连续选择的输入词执行代数译码。提出了一种选择代数译码搜索中心序列的新方法。在采用BPSK信令的AWGN信道上，我们给出了迭代译码算法的误码性能仿真结果，其搜索中心由所提出的方法确定，适用于Reed-Solomon码。仿真结果表明，在相同的迭代次数下，IAD译码的误码性能明显优于GMD和CGA译码。
We consider an iterative decoding algorithm by using algebraic decoding for non-binary codes. In the decoding algorithm, algebraic decoding are carried out with respect to successively chosen input words, called the search centers. We present a new method for selecting sequences of search centers of algebraic decoding. Over the AWGN channel using BPSK signaling, we show simulation results on the error performances of the iterative decoding algorithms whose search centers are given by the proposed method, abbreviated IAD, for Reed-Solomon codes. From the simulation results, IAD provides considerably better error performance than GMD and CGA decoding with the same number of iterations.