SEQUENTIAL DECODING FOR BINARY CHANNELS WITH NOISE AND SYNCHRONIZATION ERRORS
SEQUENTIAL DECODING FOR BINARY CHANNELS WITH NOISE AND SYNCHRONIZATION ERRORS
复制标题
具有噪声和同步误差的二进制通道的顺序解码
DOI：
--
复制
发表时间：
1961
期刊：
影响因子：
--
通讯作者：
R. Gallager
中科院分区：
文献类型：
--
作者：
R. Gallager
摘要：考虑一个信道，其输入是一个二进制数字序列，其输出是相同的序列，每个数字以下列方式独立修改：概率为Pe，数字被改变;概率为Pd，数字从序列中删除;概率为Pi，数字被两个随机选择的数字取代。通道输出没有指示哪些数字被删除或插入。它示出，卷积编码和顺序解码可以应用，与微小的修改，这个通道和边界上的计算和错误概率推导出类似的二进制对称信道的边界。更确切地说，定义了计算截止率。对于小于每数字Rcomp比特的码率，不正确子集中的平均解码计算随着编码约束长度比线性增长更慢，并且解码错误的概率随着约束长度呈指数下降。对于Pd=Pi=0，Rcomp的上述表达式简化为Wozencraft和Reiffen针对二进制对称信道导出的表达式。（作者）
Abstract : Consider a channel for which the input is a sequence of binary digits and for which the output is the same sequence with each digit independ ently modified in the following way: with probability Pe, the digit is changed; with probability Pd, the digit is deleted from the sequence; and with probability Pi, the digit is replaced by two randomly chosen digits. The channel output gives no indication which digits were deleted or inserted. It is shown that convolutional coding and sequential decoding can be applied, with minor modifications, to this channel and bounds are derived on computation and error probability analogous to the bounds for the Binary Symmetric Channel. More precisely, a computational cut-off rate is defined. For code rates less than Rcomp bits per digit, the average decoding computation in the incorrect subset grows more slowly than linearly with the coding constraint length, and the probability of decoding error decreases exponentially with constraint length. For Pd=Pi=0, the above expression for Rcomp reduces to that derived by Wozencraft and Reiffen for the Binary Symmetric Channel. (Author)