Premium
Reducing code wastage in orthogonal variable spreading factor‐based wideband code division multiple access networks
Author(s) -
Saini Davinder,
Gupta Ankit,
Joshi Aditi
Publication year - 2013
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.1374
Subject(s) - computer science , code (set theory) , variable (mathematics) , orthogonal frequency division multiple access , code division multiple access , division (mathematics) , algorithm , computer network , mathematics , channel (broadcasting) , arithmetic , set (abstract data type) , orthogonal frequency division multiplexing , programming language , mathematical analysis
SUMMARY Most third‐generation and beyond wideband code division multiple access networks use the orthogonal variable spreading factor code tree for channelization codes. The codes in this code tree are limited and the performance of a wireless network depends upon the code assignment for new calls. In this paper, we introduce a term called ‘wastage capacity’, which gives us the amount of wastage caused when a code (single or multiple) with a data rate higher than the rate of the incoming call is assigned to it. We suggest two methods to keep wastage capacity below an arbitrary threshold value or zero. In the first method, we devised an algorithm in which wastage up to a certain threshold would be tolerated and the minimum rakes to get this wastage capacity were identified. In the second approach, we reduced the wastage capacity to zero irrespective of the number of rakes at the expense of higher cost and complexity. Copyright © 2011 John Wiley & Sons, Ltd.