In this work, we consider the problem of assigning OVSF (Orthogonal
Variable Spreading Factor) codes to arriving calls for multi-rate
code-division multiple access systems, and propose a sequence of
algorithms to solve this problem from different angles. First, we
introduce two new policies, called FCA (Fixed Code Assignment) with
fixed set partitioning and DCA (Dynamic Code Assignment) with call
admission control under an objective to maximize the average data
throughput of the system. Numerical simulation confirms that optimized
FCA and DCA perform better than DCA with a greedy policy as the traffic load increases and high-rate calls become dominant. Second, a
suboptimal DCA with call admission control is examined. The objective
is to 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. By means of capacity or class partitioning and partial resource sharing, we can significantly reduce the computational complexity, thus achieving good design and implementation scalability. Numerical evaluation shows the superior performance of the proposed schemes with low complexity.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.