Statistical power allocation and coded bit allocation optimization in Mercury/Waterfilling

Michael M. Taouk*, Matthew J M Peacock, Iain B. Collings

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contributionpeer-review

2 Citations (Scopus)

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 MAVF. Two analytical tests are derived to eliminate sub-trees of the graph.

Original languageEnglish
Title of host publicationProceedings - 7th Australian Communications Theory Workshop, 2006
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages159-164
Number of pages6
Volume2006
ISBN (Print)1424402131, 9781424402137
Publication statusPublished - 2006
Externally publishedYes
Event7th Australian Communications Theory Workshop, 2006 - Perth, Australia
Duration: 1 Feb 20063 Feb 2006

Other

Other7th Australian Communications Theory Workshop, 2006
Country/TerritoryAustralia
CityPerth
Period1/02/063/02/06

Fingerprint

Dive into the research topics of 'Statistical power allocation and coded bit allocation optimization in Mercury/Waterfilling'. Together they form a unique fingerprint.

Cite this