Wireless LAN White Papers
Iterative Water-Filling for Optimal Resource Allocation in OFDM Multiple-Access and Broadcast Channels
Overview A class of optimal resource allocation problems in linear Gaussian Multiple-access and Broadcast channels (MAC and BC) can be summarized as weighted sum power minimization problem. In this paper an iterative water-filling algorithm is proposed to solve this problem efficiently. It is shown that by formulating an explicit rate expression for MAC, though non-convex of power spectral densities, the KKT conditions demonstrate a strong water-filling flavor. By iteratively solving the KKT conditions, whereas in each iteration a slightly modified single-user Margin Adaptive Water-Filling(MAWF) algorithm is applied to update the dual variable in a greedy manner, the power spectral density of each user converges to the optimal solution very fast. Simulations verify zero duality gap and fast convergence.
| Publisher | Stanford University | File Format | |
|---|---|---|---|
| Date Published | March 2006 | ||
| Format | White Papers | ||
| Topics | |||


