This preview shows page 1. Sign up to view the full content.
Unformatted text preview: Power allocation with coherent combining receivers. In this problem we consider a variation on
the power allocation problem described on pages 413 and 414 of the notes. In that problem we
have m transmitters, each of which transmits (broadcasts) to n receivers, so the total number of
receivers is mn. In this problem we have the converse: multiple transmitters send a signal to each
receiver.
More speciﬁcally we have m receivers labeled 1, . . . , m, and mn transmitters labeled (j, k ), j =
1, . . . , m, k = 1, . . . , n. The transmitters (i, 1), . . . , (i, n) all transmit the same message to the
receiver i, for i = 1, . . . , m.
Transmitter (j, k ) operates at power pjk , which must satisfy 0 ≤ pjk ≤ Pmax , where Pmax is a given
maximum allowable transmitter power.
The path gain from transmitter (j, k ) to receiver i is Aijk > 0 (which are given and known). Thus
the power received at receiver i from transmitter (j, k ) is given by Aijk pjk .
For i = j , the received power Aijk pjk represents an interference signal....
View
Full
Document
This note was uploaded on 09/10/2013 for the course C 231 taught by Professor F.borrelli during the Fall '13 term at University of California, Berkeley.
 Fall '13
 F.Borrelli
 The Aeneid

Click to edit the document details