A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf
.
Computationally Efficient Dynamic Code Assignment Schemes With Call Admission Control (DCA-CAC) for OVSF-CDMA Systems
2008
IEEE Transactions on Vehicular Technology
This paper investigates computationally efficient suboptimal dynamic code assignment (DCA) schemes with call admission control (CAC) for orthogonal variable spreading factor code-division multiple-access systems. We examine two different approaches. The first approach reduces the complexity of the DCA scheme by partitioning the total resource (either capacity or service class) into several mutually exclusive subsets and assigns each subset of resource to a group of users in proportion to the
doi:10.1109/tvt.2007.904506
fatcat:lxptkyo23rfwrfht525dvus4jm