检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:穆天杰 陈晓辉[1] 汪逸云 马陆鹏 刘东[1] 周晶[1] 张文逸[1] MU Tianjie;CHEN Xiaohui;WANG Yiyun;MA Lupeng;LIU Dong;ZHOU Jing;ZHANG Wenyi(University of Science and Technology of China,Hefei 230026,China)
出 处:《电信科学》2020年第10期56-66,共11页Telecommunications Science
基 金:国家重点研发计划项目(No.2018YFA0701603)。
摘 要:信息论的经典结果表明,信源信道分离编码是渐进最优的。但现代通信系统对时延、带宽等愈发敏感,分离设计对解码具有无限计算能力这一假设难以成立。带宽有限时,相对于信源信道联合编码,分离编码已被证明是次优的。传统的联合信源信道编码需要复杂的编码方案,相较之下,数据驱动的深度学习技术则带来了新的设计思路。适时地对相关研究成果进行总结,有助于进一步明确深度学习方法解决信源信道联合编码问题的方式,为研究新的研究方向提供依据。首先介绍了基于深度学习的信源压缩方案和端对端收发信机模型,随后分析不同信源类型下的两种联合编码设计思路,最后探讨了基于深度学习的信源信道联合编码的潜在问题和未来的工作方向。Classical information theory shows that separate source-channel coding is asymptotically optimal over a point-to-point channel.As modern communication systems are becoming more sensitive to delays and bandwidth,it becomes difficult to adopt the assumption that such separate designs have unlimited computing power for encoding and decoding.Compared to joint source-channel coding,separate coding has proven to be sub-optimal when the bandwidth is limited.However,conventional joint source-channel coding schemes require complicated design.In contrast,data-driven deep learning brings new designing ideas into the paradigm.A summary of relevant research results was provided,which will help to clarify the way in which deep learning methods solve the joint source-channel coding problem and to provide an overviewof new research directions.Source compression schemes and end-to-end communication system models were firstly introduced,both based on deep learning,then two kinds of joint coding designs under different types of source,and potential problems of joint source-channel coding based on deep learning and possible future research directions were introduced.
关 键 词:深度学习 图像/视频压缩 端到端收发信机 信源信道联合编码
分 类 号:TN929.5[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.49