Error detection in arithmetic coding with artificial markers
Error detection in arithmetic coding with artificial markers
复制标题
DOI：
10.1016/j.camwa.2011.05.017
复制
发表时间：
2011-07
期刊：
影响因子：
--
通讯作者：
Kwok-wo Wong;Qiuzhen Lin;Jianyong Chen
中科院分区：
文献类型：
--
作者：
Kwok-wo Wong;Qiuzhen Lin;Jianyong Chen
算术码中的错误检测通常通过在编码期间在源序列中插入标记来实现。如果插入的标记没有出现在预期位置，则可以在解码过程中检测到传输错误。与现有的方法，其中的标记符号是从源符号的集合中选择，我们建议，标记被人为地创建，以便不影响源符号的原始分布。我们的计划被证明具有更好的压缩比现有的标记方法在相同的错误误检概率。该方法推导了码字长度扩展与编码块内错误误检概率之间的关系式，使其易于适应不同误码率的信道。仿真结果表明，对于采用有限精度计算的自适应算术编码，检错时延分布在略大于译码寄存器长度的值处有一个峰值。在一个足够长的寄存器，我们的方法可以检测到大多数错误模式在长源序列在一个高的概率。
Error detection in arithmetic code is usually achieved by inserting markers in the source sequence during encoding. Transmission errors can then be detected in the decoding process if the inserted markers do not appear at the expected positions. Unlike the existing approaches in which the marker symbol is selected from the set of source symbols, we propose that the marker be created artificially so as not to affect the original distribution of the source symbols. Our scheme is proved to possess a better compression ratio than existing marker approaches at the same error misdetection probability. The relationship between codeword length expansion and error misdetection probability within a coded block is well formulated, which makes it easy to adapt to channels with different bit error rates. Simulation results show that, for adaptive arithmetic coding implemented using finite-precision computation, the distribution of error detection delay has a peak at a value slightly larger than the length of the decoding register. With a sufficiently long register, our approach can detect most error patterns in long source sequences at a high probability.