...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Information Theory >Joint source-channel coding and guessing with application to sequential decoding
【24h】

Joint source-channel coding and guessing with application to sequential decoding

机译：联合源信道编码和猜测及其在顺序解码中的应用

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

We extend our earlier work on guessing subject to distortion to the joint source-channel coding context. We consider a system in which there is a source connected to a destination via a channel and the goal is to reconstruct the source output at the destination within a prescribed distortion level with respect to (w.r.t.) some distortion measure. The decoder is a guessing decoder in the sense that it is allowed to generate successive estimates of the source output until the distortion criterion is met. The problem is to design the encoder and the decoder so as to minimize the average number of estimates until successful reconstruction. We derive estimates on nonnegative moments of the number of guesses, which are asymptotically tight as the length of the source block goes to infinity. Using the close relationship between guessing and sequential decoding, we give a tight lower bound to the complexity of sequential decoding in joint source-channel coding systems, complementing earlier works by Koshelev (1973) and Hellman (1975). Another topic explored here is the probability of error for list decoders with exponential list sizes for joint source-channel coding systems, for which we obtain tight bounds as well. It is noteworthy that optimal performance w.r.t. the performance measures considered here can be achieved in a manner that separates source coding and channel coding.
机译：我们将早先的关于失真的猜测的工作扩展到联合源信道编码上下文。我们考虑一种系统，其中有一个源通过通道连接到目标，并且目标是在相对于某些失真度量的预定失真级别内，在目标处重构源输出。从允许生成源输出的连续估计直到满足失真标准的意义上讲，该解码器是一种猜测解码器。问题是设计编码器和解码器，以使估计的平均数量最小化，直到成功重建为止。我们推导出对猜测次数的非负矩的估计，当源块的长度达到无穷大时，这些估计逐渐渐近。利用猜测和顺序解码之间的紧密关系，我们对联合源信道编码系统中顺序解码的复杂性给出了严格的下限，补充了Koshelev（1973）和Hellman（1975）的早期著作。此处探讨的另一个主题是联合源信道编码系统具有指数列表大小的列表解码器的错误概率，对此我们也获得了严格的界限。值得注意的是，最佳性能这里考虑的性能指标可以通过分离源编码和信道编码的方式来实现。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号