TY - GEN

T1 - Throughput maximization on the downlink of a CDMA system

AU - Karakayali, M. Kemal

AU - Yates, Roy

AU - Razumov, Leo

N1 - Publisher Copyright:
© 2003 IEEE.

PY - 2003

Y1 - 2003

N2 - We propose a rate scheduling algorithm to maximize the network throughput of a variable data rate CDMA system and prove its optimality. The system uses OVSF (orthogonal variable spreading factor) codes and the algorithm finds the optimum rate assignments on the binary code tree under constraints on the total transmit power and minimum QoS (rate) requirement of each user. The algorithm is optimal in the sense that it maximizes the total network throughput within the constraints and achieves this with minimum possible power. The algorithm works in a greedy fashion and has a polynomial time complexity of O(N), where N is the number of users. We also extend our results to a more general set of combinatorial optimization problems where the user rates can be any integer multiples of a basic rate (such as multi-code CDMA), not necessarily the set of rates on the binary tree structure, but the optimal solutions are still greedy achievable.

AB - We propose a rate scheduling algorithm to maximize the network throughput of a variable data rate CDMA system and prove its optimality. The system uses OVSF (orthogonal variable spreading factor) codes and the algorithm finds the optimum rate assignments on the binary code tree under constraints on the total transmit power and minimum QoS (rate) requirement of each user. The algorithm is optimal in the sense that it maximizes the total network throughput within the constraints and achieves this with minimum possible power. The algorithm works in a greedy fashion and has a polynomial time complexity of O(N), where N is the number of users. We also extend our results to a more general set of combinatorial optimization problems where the user rates can be any integer multiples of a basic rate (such as multi-code CDMA), not necessarily the set of rates on the binary tree structure, but the optimal solutions are still greedy achievable.

UR - http://www.scopus.com/inward/record.url?scp=33846303481&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846303481&partnerID=8YFLogxK

U2 - 10.1109/WCNC.2003.1200490

DO - 10.1109/WCNC.2003.1200490

M3 - Conference contribution

AN - SCOPUS:33846303481

T3 - IEEE Wireless Communications and Networking Conference, WCNC

SP - 894

EP - 901

BT - 2003 IEEE Wireless Communications and Networking Conference, WCNC 2003

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 2003 IEEE Wireless Communications and Networking Conference: The Dawn of Pervasive Communication, WCNC 2003

Y2 - 16 March 2003 through 20 March 2003

ER -