Scalable dynamic code assignment for OVSF-CDMA systems
Two scalable dynamic code assignment (DCA) schemes with call admission control for OVSF-CDMA systems are studied in this research. The proposed schemes generate an average data throughput of the system close to that of the optimal scheme while demanding much lower design and implementation complexity than the optimal scheme. The capacity-partitioning scheme partitions the whole resource into several mutually exclusive subsets of resource and assigns each subset of resource to a group of users in proportion to the corresponding traffic load. The class-partitioning scheme partitions the set of service classes into mutually exclusive groups of classes and assigns a subset of the total resource to the corresponding group of classes. In either case, the call requests that belong to each subset of resource or each group of classes are served independently of others by the optimal DCA. Numerical evaluation confirms the superior performance of the proposed schemes with low complexity.