充水是一般容量最大化原则的极限情况

A. Schmeink, R. Mathar
{"title":"充水是一般容量最大化原则的极限情况","authors":"A. Schmeink, R. Mathar","doi":"10.1109/ISIT.2006.262032","DOIUrl":null,"url":null,"abstract":"The optimal power allocation for Gaussian vector channels subject to sum power constraints is achieved by the well known water-filling principle. In this correspondence, we show that the discontinuous water filling solution is obtained as the limiting case of p-norm bounds on the power covariance matrix as p tends to one. Directional derivatives are the main vehicle leading to this result. An easy graphical representation of the solution is derived by the level crossing points of simple power functions, which in the limit p = 1 gives a nice dual view of the classical representation","PeriodicalId":115298,"journal":{"name":"2006 IEEE International Symposium on Information Theory","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Water-filling is the Limiting Case of a General Capacity Maximization Principle\",\"authors\":\"A. Schmeink, R. Mathar\",\"doi\":\"10.1109/ISIT.2006.262032\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The optimal power allocation for Gaussian vector channels subject to sum power constraints is achieved by the well known water-filling principle. In this correspondence, we show that the discontinuous water filling solution is obtained as the limiting case of p-norm bounds on the power covariance matrix as p tends to one. Directional derivatives are the main vehicle leading to this result. An easy graphical representation of the solution is derived by the level crossing points of simple power functions, which in the limit p = 1 gives a nice dual view of the classical representation\",\"PeriodicalId\":115298,\"journal\":{\"name\":\"2006 IEEE International Symposium on Information Theory\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-07-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Symposium on Information Theory\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.2006.262032\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Symposium on Information Theory","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.2006.262032","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在和功率约束下,利用充水原理实现高斯矢量信道的最优功率分配。在这一通信中,我们证明了当p趋于1时幂协方差矩阵的p范数界的极限情况下,可以得到不连续充水解。方向导数是导致这一结果的主要工具。通过简单幂函数的水平交叉点推导出解的简单图形表示,在极限p = 1时给出了经典表示的良好对偶视图
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Water-filling is the Limiting Case of a General Capacity Maximization Principle
The optimal power allocation for Gaussian vector channels subject to sum power constraints is achieved by the well known water-filling principle. In this correspondence, we show that the discontinuous water filling solution is obtained as the limiting case of p-norm bounds on the power covariance matrix as p tends to one. Directional derivatives are the main vehicle leading to this result. An easy graphical representation of the solution is derived by the level crossing points of simple power functions, which in the limit p = 1 gives a nice dual view of the classical representation
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信