Linear time decoding of real-field codes over high error rate channels
Linear time decoding of real-field codes over high error rate channels
复制标题
DOI：
10.1109/icassp.2011.5946695
复制
发表时间：
2011-05
期刊：
影响因子：
--
通讯作者：
Zaixing He;Takahiro Ogawa;M. Haseyama
中科院分区：
文献类型：
--
作者：
Zaixing He;Takahiro Ogawa;M. Haseyama
本文提出了一种新的实数域码在错误信道上的译码算法，其中编码的消息被稀疏的错误，即脉冲噪声所破坏。对这种被破坏的编码消息进行解码的主要问题是重建误差向量；最近，重建误差向量的一种常见方法是为使用奇偶校验矩阵构造的欠定系统找到最稀疏的解。与传统的直接重构高维误差向量的方法不同，该方法从两组(或几组)低维方程中交叉恢复误差向量的元素。与传统算法相比，该方法能够以更高的误码率对编码消息进行译码。此外，我们的方法的复杂度是线性的，比传统方法低得多。实验结果验证了该方法具有较高的纠错能力和速度。
This paper proposes a novel algorithm for decoding real-field codes over erroneous channels, where the encoded message is corrupted by sparse errors, i.e., impulsive noise. The main problem of decoding such a corrupted encoded message is to reconstruct the error vector; recently, a common way to reconstruct it is to find the sparsest solution to an underdetermined system that is constructed using a paritycheck matrix. Unlike the conventional approaches reconstructing the high-dimensional error vector directly, the proposed method crossly recovers the elements of error vector from two (or several) groups of low-dimensional equations. Compared with the traditional algorithms, the proposed method can decode an encoded message with a much higher corruption rate. Furthermore, the complexity of our method is linear, which is much lower than those of the traditional methods. The experimental results verified the high error correction ability and speed of the proposed method.