This preview shows page 1. Sign up to view the full content.
Unformatted text preview: 22.214.171.124 Survey Of Margin Adaptive Resource Allocation Algorithms In , Wong and Cheng consider an adaptive multi-user subcarrier allocation scheme. Their scheme tries to exploit all the subcarriers (except maybe those that are in deep fade for all the users at a given time). In this scheme, the authors assume perfect channel information and ignore the overhead created by the transmission of the subcarrier allocation information.  considers the multi-user problem that was discussed in section 4.1.2. The problem is reformulated as a convex optimization problem over a convex set as follows : min c k , n , r k , n c k , n h k , n 2 n = 1 N ∑ f k r k , n ( ) k = 1 K ∑ …(E23) with the constraints on r k,n and c k,n such that R k ≤ c k , n r k , n n = 1 N ∑ and c k , n k = 1 K ∑ = 1 …(E24)...
View Full Document
This note was uploaded on 09/27/2009 for the course ECE 399 taught by Professor Prof during the Spring '09 term at University of Texas at Austin.
- Spring '09