汞/充水中统计功率分配和编码位分配优化

M. Taouk, Matthew J. M. Peacock, I. Collings
{"title":"汞/充水中统计功率分配和编码位分配优化","authors":"M. Taouk, Matthew J. M. Peacock, I. Collings","doi":"10.1109/AUSCTW.2006.1625274","DOIUrl":null,"url":null,"abstract":"Motivated by statistical Waterfilling, we derive statistical Mercury/Waterfilling (M/WF) for both fixed average power and fixed average rate as the infinite time limit of the spatio-temporal M/WF solution. The M → ∞ limit of the conditional mean estimate (CME) receiver for unit-energy M-QAM constellations is derived, which may be used as a low complexity approximate CME estimate for dense QAM constellations. The asymptotic CME result is used to analytically characterize an upper bound on the mutual information properties of QAM. We develop a tree-search algorithm to efficiently optimize coded bit allocation in M/WF. Two analytical tests are derived to eliminate sub-trees of the graph.","PeriodicalId":206040,"journal":{"name":"2006 Australian Communications Theory Workshop","volume":"33 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Statistical Power Allocation and Coded Bit Allocation Optimization in Mercury/Waterfilling\",\"authors\":\"M. Taouk, Matthew J. M. Peacock, I. Collings\",\"doi\":\"10.1109/AUSCTW.2006.1625274\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Motivated by statistical Waterfilling, we derive statistical Mercury/Waterfilling (M/WF) for both fixed average power and fixed average rate as the infinite time limit of the spatio-temporal M/WF solution. The M → ∞ limit of the conditional mean estimate (CME) receiver for unit-energy M-QAM constellations is derived, which may be used as a low complexity approximate CME estimate for dense QAM constellations. The asymptotic CME result is used to analytically characterize an upper bound on the mutual information properties of QAM. We develop a tree-search algorithm to efficiently optimize coded bit allocation in M/WF. Two analytical tests are derived to eliminate sub-trees of the graph.\",\"PeriodicalId\":206040,\"journal\":{\"name\":\"2006 Australian Communications Theory Workshop\",\"volume\":\"33 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 Australian Communications Theory Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AUSCTW.2006.1625274\",\"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 Australian Communications Theory Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AUSCTW.2006.1625274","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

摘要

在统计充水的激励下,我们导出了固定平均功率和固定平均速率的统计汞/水充水(M/WF),作为时空M/WF解的无限时间限制。导出了单位能量M-QAM星座条件平均估计接收机的M→∞极限,可作为密集QAM星座条件平均估计的低复杂度近似估计。利用渐近CME结果解析表征了QAM互信息性质的上界。我们开发了一种树搜索算法来有效地优化M/WF中的编码位分配。导出了两个分析检验来消除图的子树。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Statistical Power Allocation and Coded Bit Allocation Optimization in Mercury/Waterfilling
Motivated by statistical Waterfilling, we derive statistical Mercury/Waterfilling (M/WF) for both fixed average power and fixed average rate as the infinite time limit of the spatio-temporal M/WF solution. The M → ∞ limit of the conditional mean estimate (CME) receiver for unit-energy M-QAM constellations is derived, which may be used as a low complexity approximate CME estimate for dense QAM constellations. The asymptotic CME result is used to analytically characterize an upper bound on the mutual information properties of QAM. We develop a tree-search algorithm to efficiently optimize coded bit allocation in M/WF. Two analytical tests are derived to eliminate sub-trees of the graph.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信