Composite Scheme LR + Th for Decoding with Erasures and Its Effective Equivalence to Forney's Rule
Composite Scheme LR + Th for Decoding with Erasures and Its Effective Equivalence to Forney's Rule
复制标题
擦除解码的复合方案 LR Th 及其与 Forney 规则的有效等价
DOI：
10.1109/18.746773
复制
发表时间：
1999
影响因子：
2.5
通讯作者：
T. Hashimoto
中科院分区：
文献类型：
--
作者：
T. Hashimoto
对于具有擦除的解码，已知Forney的方案在没有其它方案可以使擦除概率P/sub er/和未检测到的错误概率P/sub er/同时更小的意义上是最优的。我们提出了一个计划的擦除决策测试的似然比，以及本身的可能性，并表明可达到的上界P/子/和P/子uer/是相同的，证明了最佳方案的一个常数因子。我们还表明，该计划给出，当应用于卷积码，一个绑定，这是相关的块编码绑定通过Forney的逆级联建设。我们表明，这个界限是相同的，自然出现的，当我们应用Raghavan和Baum（1998）的最佳方案卷积码。
For decoding with erasures, Forney's scheme is known to be optimal in the sense that no other scheme can make the erasure probability P/sub ers/ and undetected error probability P/sub uer/ simultaneously smaller. We propose a scheme for erasure decision which tests the likelihood ratio as well as the likelihood itself and show that the attainable upper bounds on P/sub ers/ and P/sub uer/ are the same as those proved for the optimal scheme up to a constant factor. We also show that the scheme gives, when applied to convolutional codes, a bound which is related to the block-coding bound via Forney's inverse concatenation construction. We show that this bound is the same as the one which naturally arises when we apply Raghavan and Baum's (1998) optimal scheme to convolutional code.