{"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}
引用次数: 3
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.