An algorithm for source coding subject to a fidelity criterion, based on string matching
An algorithm for source coding subject to a fidelity criterion, based on string matching
复制标题
一种基于字符串匹配、符合保真度标准的源编码算法
DOI：
--
复制
发表时间：
1993
影响因子：
2.5
通讯作者：
M. Gutman
中科院分区：
文献类型：
--
作者：
Y. Steinberg;M. Gutman
提出了一种实用的次优元源编码方案，但提出了符合忠实标准的情况。该算法是LEMPEL-ZIV算法的扩展，基于与失真匹配的字符串。结果表明，给定平均失真d> 0，对于大型来源和失真度量，算法达到了超过R（d/2）的速率。对于离散的无内存源和无内存的高斯来源，该速率上的范围更紧密。 >
A practical suboptimal universal block source coding scheme, subject to a fidelity criterion, is proposed. The algorithm is an extension of the Lempel-Ziv algorithm and is based on string matching with distortion. It is shown that given average distortion D>0, the algorithm achieves a rate of exceeding R(D/2) for a large class of sources and distortion measures. Tighter bounds on the rate are derived for discrete memoryless sources and for memoryless Gaussian sources. >