Browse

Transmit Power Allocation for a Downlink Two-User Interference Channel

DC Field Value Language
dc.contributor.authorPark, Taewon-
dc.contributor.authorJang, Jiho-
dc.contributor.authorShin, Oh-Soon-
dc.contributor.authorLee, Kwang Bok-
dc.date.accessioned2009-08-13T03:20:38Z-
dc.date.available2009-08-13T03:20:38Z-
dc.date.issued2005-01-
dc.identifier.citationIEEE Commun. Lett., vol. 9, no. 1, pp. 13-15, Jan. 2005en
dc.identifier.issn1089-7798-
dc.identifier.urihttps://hdl.handle.net/10371/7111-
dc.description.abstractWe develop the optimal transmit power allocation
scheme that maximizes the total throughput for a downlink twouser
interference channel. The derived optimal scheme allocates
the total power to one user in better channel state, as in the
greedy scheme, when the degree of interference between users
exceeds a certain threshold. When it is less than the threshold, on
the contrary, the transmit power is divided into two users, as in
the water-filling scheme. Numerical results are presented to verify
the optimality of the derived scheme and to show throughput
gains over the greedy and water-filling schemes.
en
dc.description.sponsorshipThis work was supported in part by the National Research Laboratory
(NRL) Program and Brain Korea 21 Project.
en
dc.language.isoenen
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en
dc.subjectGreedy power allocationen
dc.subjectinterference channelen
dc.subjecttransmit power allocationen
dc.subjectwater-fillingen
dc.titleTransmit Power Allocation for a Downlink Two-User Interference Channelen
dc.typeArticleen
dc.contributor.AlternativeAuthor박태원-
dc.contributor.AlternativeAuthor장지호-
dc.contributor.AlternativeAuthor신오순-
dc.contributor.AlternativeAuthor이광복-
dc.identifier.doi10.1109/LCOMM.2005.01019-
Appears in Collections:
College of Engineering/Engineering Practice School (공과대학/대학원)Dept. of Electrical and Computer Engineering (전기·정보공학부)Journal Papers (저널논문_전기·정보공학부)
Files in This Item:
  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Browse