Skip to Main Content
A resource allocation algorithm, that assigns the users to be served together with their number of Walsh codes and power, is proposed for a downlink CDMA system. The optimal solution of maximizing the reward function is achieved by serving at most two users simultaneously. In the proposed algorithm the maximum number of users served simultaneously, m, is variable. This allows to trade the reward and the throughput-capacity in a flexible manner. Simulations performed in the 1xEV-DV framework show that the proposed algorithm has a graceful degradation of the reward function as m increases. For m=2 the algorithm performs close to the optimal solution.
Personal, Indoor and Mobile Radio Communications, 2004. PIMRC 2004. 15th IEEE International Symposium on (Volume:3 )
Date of Conference: 5-8 Sept. 2004