| D. Tse and S. Hanly, "Multi-access fading channels: part I: polymatroid structure, optimal resource allocation and throughput capacities," IEEE Tran. on Information Theory, Vol. 44, No. 7, Nov., 1998, pp. 2796-2815. |
....channel state at the transmitter. In addition, both transmitted power and code rate assignments must adapt continuously to changes in the channel state. Both of these requirements have been widely adopted in further work on information theoretic aspects of communication over fading channels [6], 7] Unfortunately, these requirements are hard to satisfy in practice. In order to simplify an adaptive transmission system, an adaptive M ary quadrature amplitude modulation (MQAM) with a finite number of modulation levels and an adaptive trellis coded modulation (TCM) scheme with a finite ....
D. Tse and S. Hanly, "Multi-access fading channels: Part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Transactions on Information Theory, vol. 44, no. 7, pp. 2796--2815, Nov. 1998.
....channels established in (1) we show that duality holds for the ergodic capacity region of fading channels as well. We also show that the relationship in (2) holds for fading channels. Duality also holds for outage capacity and minimum rate capacity. Though the ergodic capacity regions [2] [3] and outage capacity regions [4] 5] of both the MAC and BC have previously been found, duality ties these results together. Minimum rate capacity has only been found for the BC [6] but using duality we can find the minimum rate capacity of the MAC as well. Duality is an exciting new concept ....
....examine the points where the MAC and BC capacity region boundaries touch, we find that there is also a fundamental relationship between the power policies used to achieve these points. The optimal power policies (i.e. boundary achieving power policies) for the fading MAC and BC are established in [3] and [2] respectively. Given a priority vector , it is possible to find the optimal power policy that maximizes in both the MAC and the BC. Due to the duality of these channels, the optimal power policies derived independently for the BC and MAC are related by the MAC BC (12) and BC MAC (13) ....
[Article contains additional citation context not shown here]
D. N. C. Tse and S. Hanly, "Multiaccess fading channels--Part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Trans. Inform. Theory, vol. 44, pp. 2796--2815, Nov. 1998.
.... years, as multimedia wireless communications become important, many useful MAC protocols have also been suggested to efficiently handle the heterogeneous nature of the traffic characteristics [8] Lately, it is widely envisioned that the time varying nature of the wireless channel quality [15] [19], inevitable as it is, can potentially allow further exploitation to enhance the performance of the system [4] 22] As such, several channel adaptive protocols have also been reported [2] However, for the MAC problem, existing channel adaptive protocols just blindly maximize the overall system ....
D. N. C. Tse and S. V. Hanly, "Multiaccess Fading Channels---Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities, " IEEE Trans. Information Theory, vol. 44, no. 7, Nov. 1998, pp. 2796--2815.
....the following problem for all fixed (s; h) pairs, r;p) P e r) pg subject to r 2 C(h; p) 2) Let q be the received power vector. Define, for a given rate vector r and an (s; h) pair, Q(h; r) fq : 9 p s:t: q i = h i p i ; r 2 C(h; p)g: The region Q(h; r) is a contra polymatroid [2]. The optimization problem (2) can be restated as, r;q) P e r) qg subject to q 2 Q(h; r) where, by an abuse of notation, denotes the row vector ( h 1 ; Without loss of generality, let us assume that 1 2 . For any given rate vector r, the minimum value of h q ....
....to q 2 Q(h; r) where, by an abuse of notation, denotes the row vector ( h 1 ; Without loss of generality, let us assume that 1 2 . For any given rate vector r, the minimum value of h q subject to above said contra polymatroid constraint is given by (see Lemma 3. 3 of [2]) r k ) g; where f(x) e x 1) ln(2) and f(0) 0. Rewriting the above problem, we get a convex objective function and the problem is n w i N( s i r i ) P e r i ) r k ) g o In order to remove ( from the above problem we use an ....
[Article contains additional citation context not shown here]
David N. C. Tse and Stephen V. Hanly, "Multi-access fading channels: Part I: Polymatroid structure, optimal resource allocation and throughput capacities ," IEEE Trans. on Info. Theory, 44(7):2796-2815, 1998.
....= W (f; g P (g) j(Fg) f)j df: 3. 37) This is the capacity of a time invariant channel with impulse response g and average power constraint P (g) The capacity of the block fading channel with perfect trans mitter side information is the solution of the optimization problem [Gol94] [TH98]: P :G7 R E GCWB (G; P (G) subject to: E G P (G) 3.38) Note the similarity of this to the optimization in (3.18) In a similar manner, the other results in Sect. 3.2 can be generalized to frequency selective fading channels. In summary we have looked at block fading channels ....
....is g. For a given power allocation, let C (P) be the set of rates (R ) such that Assume that user i has an average power constraint of . Let denote the set of all power allocations which satisfy these average power constraints, i.e. fP : E G (P (G) g. In [TH98] it is shown that the capacity region of the channel with complete state information is given by: P2 (P) 7.5) This capacity region is not a polyhedron, but the union of the polyhedrons C (P) Likewise, assume we restrict to be the set of power allocations such that P (g ) for ....
[Article contains additional citation context not shown here]
D. Tse and S. Hanly. Multi-access Fading Channels: Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities. IEEE Trans. Inf. Th., 44(7):2796--2815, Nov. 1998.
....bit error rates may be di#cult to obtain though. Ulukus and Yates consider stochastic measurements in power control and study convergence in stochastic sense by means of mean square error [96] 1.4. 2 Variable Rate Power Control A general information theoretic approach was used by Hanly and Tse [42, 95]. Therein, they find the capacity regions for the single cell multiple access fad ing channel considering both delay tolerant and intolerant cases. Knopp and Humblet [60] determine the optimal power control from an information theoretic aspect for the single cell multiple access fading channel. ....
D. N. C. Tse and S. V. Hanly, "Multiaccess fading channels- Part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Transactions on Information Theory, vol. 44, no. 7, pp. 2796-2815, 1998.
No context found.
D. Tse and S. Hanly, "Multiaccess fading channels - Part I: polymatroid structure, optimal resource allocation and throughput capacities," IEEE Trans. Inform. Theory, vol. 4, no. 7, November 1998.
No context found.
D. Tse and S. Hanly, "Multi-access fading channels: part I: polymatroid structure, optimal resource allocation and throughput capacities," IEEE Tran. on Information Theory, Vol. 44, No. 7, Nov., 1998, pp. 2796-2815.
No context found.
D. Tse and S. Hanly, "Multi-access fading channels: part I: polymatroid structure, optimal resource allocation and throughput capacities," IEEE Tran. on Information Theory, Vol. 44, No. 7, Nov., 1998, pp. 2796-2815.
No context found.
D. N.C. Tse, and S. V. Hanly, "Multi-access Fading Channels: Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities, " IEEE Transactions on Information Theory, Vol. 44, No. 7, pp. 2796-2815, 1998.
No context found.
D. Tse and S. Hanly, "Multi-access fading channels: Part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Trans. on Info. Th., vol. 44, pp. 2796--2815, Nov. 1998.
No context found.
D.N. Tse and S. Hanly. Multiaccess fading channels--Part I:Polymatroid structure, optimal resource allocation and throughput capacities. IEEE Trans. Inform. Theory, 44(7):2796--2815, November 1998.
No context found.
D. Tse and S. Hanly, "Multiaccess fading channels - part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Trans. on Inform. Theory, vol. 44, no. 7, pp. 2796--2815, November 1998.
No context found.
D. Tse and S. Hanly, "Multi-access fading channels - part i - polymatroid structure, optimal resource allocation and throughput capacities," IEEE Transactions on Information Theory, vol. 44, no. 7, pp. 2796--2815, November 1998.
No context found.
D. N. C. Tse and S. V. Hanly, "Multiaccess fading channels - Part I: polymatroid structure, optimal resource allocation, and throughput capacities," IEEE Trans. Inform. Theory, vol.44, no. 7, pp.2796-2815, November 1998.
No context found.
D. Tse and S. Hanly, "Multi-access fading channels - part i - polymatroid structure, optimal resource allocation and throughput capacities," IEEE Transactions on Information Theory, vol. 44, no. 7, pp. 2796--2815, November 1998.
No context found.
D. N. C. Tse and S. V. Hanly, "Multiaccess fading channels- Part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Transactions on Information Theory, vol. 44, no. 7, pp. 2796-2815, 1998.
No context found.
D. Tse and S. Hanly, "Multi-access fading channels: Part I: polymatroid structure, optimal resource allocation and throughput capacities," IEEE Trans. Inform. Theory, vol. 44, pp. 2796--2815, Nov. 1998.
No context found.
D. Tse, S. Hanly. "Multi-access Fading Channels - part I - Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities". IEEE Transactions on Information Theory, 44(7):2796--2815, November 1998.
No context found.
D. N. Tse and S. V. Hanly. Multi-access fading channels: Part I: Polymatroid structure, optimal resource allocation and throughput capacities. IEEE Transactions on Information Theory, 44(7):2796-2815, 1998.
No context found.
D. N. C. Tse and S. Hanly, "Multiaccess fading channels - part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Trans. on Information Theory, Vol. 44, no. 7, Nov. 1998.
No context found.
D.N. Tse and S. Hanly, "Multi-Access Fading Channels: Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities", IEEE Trans. Inform. Theory, v. 44, pp 2796-2815, Nov. 1998.
No context found.
D.N. Tse and S. Hanly, "Multi-Access Fading Channels: Part I: Polymatroid Structure, Optimal Resource Allocation and Throughput Capacities",IEEE Trans. Inform. Theory, v. 44, pp. 2796-2815, Nov. 1998.
No context found.
D. N. C. Tse and S. Hanly, "Multiaccess fading channels-Part I: Polymatroid structure, optimal resource allocation and throughput capacities," IEEE Trans. Inform. Theory, vol. 44, pp. 2796--2815, Nov. 1998.
No context found.
D. N. C. Tse and S. V. Hanly, "Multiaccess fading channels---Part I: Polymatroid structure, optimal resource allocation and throughput capacities, " IEEE Trans. Inform. Theory, vol. 44, pp. 2796--2815, Nov. 1998.
First 50 documents
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC