arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1802.09167cs.ITmath.IT
收藏

无损分组编码中的时延问题

Timeliness in Lossless Block Coding

Jing Zhong, Roy D. Yates

摘要:

我们研究无损数据压缩从平均延迟的角度来看。编码器每单位时间从i.i.d.接收一个输入符号。源,并将二进制码字提交给FIFO缓冲器,FIFO缓冲器以固定速率将比特传输到接收器/解码器。编码器处的每个输入符号被源视为状态更新,并且系统性能由状态更新年龄表征,状态更新年龄被定义为解码器输出滞后于编码器输入的时间单位(符号)的数量。平均状态年龄的上界是从具有延迟的流信源编码中的错误概率的指数界导出的。除了描述误差收敛的误差指数的影响外,该上界还与误差概率中的常数乘子项成比例。然而,错误指数不会导致一个准确的描述状态年龄为小延迟和小块长度。通过将流信源编码系统转化为D/G/1排队系统,提出了一种基于平均年龄近似的年龄最优分组编码方案。我们比较这个方案的错误指数最佳编码方案,使用的方法类型。我们表明,最大化的错误指数是不等于最小化的平均状态年龄。

英文摘要:

We examine lossless data compression from an average delay perspective. An encoder receives input symbols one per unit time from an i.i.d. source and submits binary codewords to a FIFO buffer that transmits bits at a fixed rate to a receiver/decoder. Each input symbol at the encoder is viewed as a status update by the source and the system performance is characterized by the status update age, defined as the number of time units (symbols) the decoder output lags behind the encoder input. An upper bound on the average status age is derived from the exponential bound on the probability of error in streaming source coding with delay. Apart from the influence of the error exponent that describes the convergence of the error, this upper bound also scales with the constant multiplier term in the error probability. However, the error exponent does not lead to an accurate description of the status age for small delay and small blocklength. An age optimal block coding scheme is proposed based on an approximation of the average age by converting the streaming source coding system into a D/G/1 queue. We compare this scheme to the error exponent optimal coding scheme which uses the method of types. We show that maximizing the error exponent is not equivalent to minimizing the average status age.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑