Universal Estimation of Information Measures for Analog Sources

IF 2 Q3 COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS Foundations and Trends in Communications and Information Theory Pub Date : 2009-05-26 DOI:10.1561/0100000021
Qing Wang, Sanjeev R. Kulkarni, Sergio Verdú
{"title":"Universal Estimation of Information Measures for Analog Sources","authors":"Qing Wang, Sanjeev R. Kulkarni, Sergio Verdú","doi":"10.1561/0100000021","DOIUrl":null,"url":null,"abstract":"This monograph presents an overview of universal estimation of information measures for continuous-alphabet sources. Special attention is given to the estimation of mutual information and divergence based on independent and identically distributed (i.i.d.) data. Plug-in methods, partitioning-based algorithms, nearest-neighbor algorithms as well as other approaches are reviewed, with particular focus on consistency, speed of convergence and experimental performance.","PeriodicalId":45236,"journal":{"name":"Foundations and Trends in Communications and Information Theory","volume":"14 1","pages":"265-353"},"PeriodicalIF":2.0000,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"56","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Foundations and Trends in Communications and Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1561/0100000021","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS","Score":null,"Total":0}
引用次数: 56

Abstract

This monograph presents an overview of universal estimation of information measures for continuous-alphabet sources. Special attention is given to the estimation of mutual information and divergence based on independent and identically distributed (i.i.d.) data. Plug-in methods, partitioning-based algorithms, nearest-neighbor algorithms as well as other approaches are reviewed, with particular focus on consistency, speed of convergence and experimental performance.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
模拟源信息测度的通用估计
本专著提出了对连续字母源的信息测度的普遍估计的概述。特别注意了基于独立和同分布(i.i.d)数据的互信息和发散估计。综述了插件方法、基于分区的算法、最近邻算法以及其他方法,特别关注一致性、收敛速度和实验性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Foundations and Trends in Communications and Information Theory
Foundations and Trends in Communications and Information Theory COMPUTER SCIENCE, INTERDISCIPLINARY APPLICATIONS-
CiteScore
7.90
自引率
0.00%
发文量
6
期刊介绍: Foundations and Trends® in Communications and Information Theory publishes survey and tutorial articles in the following topics: - Coded modulation - Coding theory and practice - Communication complexity - Communication system design - Cryptology and data security - Data compression - Data networks - Demodulation and Equalization - Denoising - Detection and estimation - Information theory and statistics - Information theory and computer science - Joint source/channel coding - Modulation and signal design - Multiuser detection - Multiuser information theory
期刊最新文献
Probabilistic Amplitude Shaping Reed-Muller Codes Ultra-Reliable Low-Latency Communications: Foundations, Enablers, System Design, and Evolution Towards 6G Reed-Muller Codes Finite Blocklength Lossy Source Coding for Discrete Memoryless Sources
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1