Min-max power allocation for successive decoding

S. V. Hanly, D. N. Tse

Research output: Chapter in Book/Report/Conference proceedingConference proceeding contribution

5 Citations (Scopus)

Abstract

This paper studies resource allocation in the multi-access, fading channel, with power constraints. Given a desired bit rate vector R, we wish to determine if it is possible to achieve it with a power budget P: the call admissions problem. If so, we wish to achieve it using "niiniinal" power: the resource allocation problem. We take a niin-max fairness approach to determining the "minimum" power. Using "power prices" that arise from a Lagrangian characterization of the Shannon capacity region, we provide an algorithm to vary the power prices to obtain the solution to the min-max resource allocation problem. This algorithm siniultaneoulsy solves the call admissions problem.

Original languageEnglish
Title of host publicationInformation Theory Workshop, ITW 1998
Place of PublicationPiscataway, NJ
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
Pages56-57
Number of pages2
ISBN (Electronic)0780344081
DOIs
Publication statusPublished - 1998
Externally publishedYes
Event1998 Information Theory Workshop, ITW 1998 - Killarney, Ireland
Duration: 22 Jun 199826 Jun 1998

Other

Other1998 Information Theory Workshop, ITW 1998
CountryIreland
CityKillarney
Period22/06/9826/06/98

Fingerprint Dive into the research topics of 'Min-max power allocation for successive decoding'. Together they form a unique fingerprint.

Cite this