CLASS OF ALGORITHMS FOR DECODING BLOCK CODES WITH CHANNEL MEASUREMENT INFORMATION
CLASS OF ALGORITHMS FOR DECODING BLOCK CODES WITH CHANNEL MEASUREMENT INFORMATION
复制标题
DOI：
10.1109/tit.1972.1054746
复制
发表时间：
1972-01-01
影响因子：
2.5
通讯作者：
CHASE, D
中科院分区：
文献类型：
--
作者：
CHASE, D
一类解码算法，利用信道测量信息，除了传统的使用的代数性质的代码，提出。能够以高概率被校正的错误的最大数目等于小于码的最小汉明距离的1。通过使用信道测量（软判决）信息来提供每个接收到的二进制数字的相对可靠性的测量，实现了比传统二进制解码器的纠错能力增加两倍。这些解码算法的上限推导，这是成比例的错误四阶分集的概率，已被评估为广泛的通信信道和调制技术的表达。借助这些算法的下界，这也是一个下界的相关性（最大似然）解码器，我们表明高斯和瑞利衰落信道，作为信号噪声比（SNR）的增加，这些解码算法的渐近行为不能得到改善。计算机模拟表明，即使对于！在低SNR下，相关解码器的性能可以通过相对简单的解码过程来接近。此外，我们研究了当使用阈值来简化解码过程时对这些解码算法性能的影响。
A class of decoding algorithms that utilizes channel measurement information, in addition to the conventional use of the algebraic properties of the code, is presented. The maximum number of errors that can, with high probability, be corrected is equal to one less than, the minimum Hamming distance of the code. This two-fold increase over the error-correcting capability of a conventional binary decoder is achieved by using channel measurement (soft-decision) information to provide a measure of the relative reliability of each of the received binary digits. An upper bound on these decoding algorithms is derived, which is proportional to the probability of an error forth order diversity, an expression that has been evaluated for a wide range of communication channels and modulation techniques. With the aid of a lower bound on these algorithms, which is also a lower bound on a correlation (maximum-likelihood) decoder, we show for both the Gaussian and Rayleigh fading channels, that as the signal-to-noise ratio (SNR) increases, the asymptotic behavior of these decoding algorithms cannot be improved. Computer simulations indicate that even for !ow SNR the performance of a correlation decoder can be approached by relatively simple decoding procedures. In addition, we study the effect on the performance of these decoding algorithms when a threshold is used to simplify the decoding process.