Dynamic resource allocation for frequency-selective orthogonal QS-CDMA channels

We consider a frequency-selective orthogonal QSCDMA system with random packet arrivals. The orthogonality can be guaranteed in frequency-selective QS-CDMA systems provided that sequence design is appropriate. The disadvantage of this approach is a strictly limited number of available spreading sequences. This problem can be mitigated by exploiting the relative delay tolerance of data applications and the random packet arrivals. In this paper, we consider a throughput optimal policy for dynamic allocation of spreading sequences and transmit powers, and compare this policy with other heuristic approaches.